232. 用栈实现队列_剑指offer_面试题09. 用两个栈实现队列

问题

例子

思路
先进后出+先进后出==先进先出
用两个栈：in,out
添加时：放入in
删除时，如果in中有，直接pop，否则，如果in不为空，先把in中元素弹出并push进out，再从out中pop

• 方法1

• 方法2

代码

//方法1
class MyQueue {
    Stack<Integer> in = new Stack<>();
    Stack<Integer> out = new Stack<>();
    /** Initialize your data structure here. */
    public MyQueue() {

    }
    
    /** Push element x to the back of queue. */
    public void push(int x) {
        in.push(x);
    }
    
    /** Removes the element from in front of queue and returns that element. */
    public int pop() {
        if(out.size()>0) return out.pop();
        if(out.size()==0 && in.size()>0) {
            while(in.size()>0)
                out.push(in.pop());
            return out.pop();
        }
        return -1;

    }
    
    /** Get the front element. */
    public int peek() {
        if(out.size()>0) return out.peek();
        if(out.size()==0 && in.size()>0) {
            while(in.size()>0)
                out.push(in.pop());
            return out.peek();
        }
        return -1;
    }
    
    /** Returns whether the queue is empty. */
    public boolean empty() {
        return out.size()+in.size()==0;
    }
}
//方法2