用两个栈来实现一个队列,完成队列的Push和Pop操作. 队列中的元素为int类型. public class Solution { Stack<Integer> stack1 = new Stack<Integer>(); Stack<Integer> stack2 = new Stack<Integer>(); public void push(int node) { sta…
题目描述 用两个栈来实现一个队列,完成队列的Push和Pop操作. 队列中的元素为int类型. 牛客网链接 js代码 let stack1 = [] let stack2 = [] function push(node) { // write code here stack1.push(node) } function pop() { // write code here if (stack2.length === 0){ while (stack1.length > 0){ stack2.pu…
class Solution: def __init__(self): self.stackpush=[] self.stackpop=[] def push(self, node): # write code here self.stackpush.append(node) def pop(self): # return xx if len(self.stackpop)==0: while len(self.stackpush) is not 0: self.stackpop.append(s…
