LintCode:用栈实现队列

LintCode:用栈实现队列

Python

class MyQueue:

    def __init__(self):
        self.stack1 = []
        self.stack2 = []

    def push(self, element):
        # write your code here
        self.stack1.append(element)

    def top(self):
        # write your code here
        # return the top element
        while len(self.stack1) != 0:
            tmp = self.stack1.pop()
            self.stack2.append(tmp)
        ans = self.stack2[-1]
        while len(self.stack2) != 0:
            tmp = self.stack2.pop()
            self.stack1.append(tmp)
        return ans

    def pop(self):
        # write your code here
        # pop and return the top element
        while len(self.stack1) != 0:
            tmp = self.stack1.pop()
            self.stack2.append(tmp)
        ans = self.stack2.pop()
        while len(self.stack2) != 0:
            tmp = self.stack2.pop()
            self.stack1.append(tmp)
        return ans

Java

public class Queue {
    private Stack<Integer> stack1;
    private Stack<Integer> stack2;

    public Queue() {
       // do initialization if necessary
        stack1 = new Stack<Integer>();
        stack2 = new Stack<Integer>();
    }

    public void push(int element) {
        // write your code here
        stack1.push(element);
    }

    public int pop() {
        // write your code here
        while(!stack1.empty()){
            int tmp = stack1.pop();
            stack2.push(tmp);
        }
        int ans = stack2.pop();
        while(!stack2.empty()){
            int tmp = stack2.pop();
            stack1.push(tmp);
        }
        return ans;
    }

    public int top() {
        // write your code here
        while(!stack1.empty()){
            int tmp = stack1.pop();
            stack2.push(tmp);
        }
        int ans = stack2.peek();
        while(!stack2.empty()){
            int tmp = stack2.pop();
            stack1.push(tmp);
        }
        return ans;
    }
}