LeetCode09栈与队列232.用栈实现队列225. 用队列实现栈

232.用栈实现队列

232. 用栈实现队列

class MyQueue {

    Stack<Integer> in = new Stack<>();
    Stack<Integer> out = new Stack<>();

    public MyQueue() {

    }
    
    public void push(int x) {
        in.push(x);
    }
    
    public int pop() {
        dumpStackIn();
        return out.pop();
    }
    
    public int peek() {
        dumpStackIn();
        return out.peek();
    }
    
    public boolean empty() {
        return out.empty() && in.empty();
    }
    //out不为空直接返回，还有的弹
    //out空将in全装进来，只有装到in栈底，才能实现队列的先入先出
    public void dumpStackIn(){
        if(!out.empty())return;
        while(!in.empty()){
            out.push(in.pop());
        }
    }
}

/**
 * Your MyQueue object will be instantiated and called as such:
 * MyQueue obj = new MyQueue();
 * obj.push(x);
 * int param_2 = obj.pop();
 * int param_3 = obj.peek();
 * boolean param_4 = obj.empty();
 */

225. 用队列实现栈

225. 用队列实现栈

一个队列实现

class MyStack {
    Queue<Integer> queue =  new LinkedList<>() ;

    public MyStack() {

    }
    
    public void push(int x) {
        queue.offer(x);
        int size = queue.size();
        while(size-- > 1){
            queue.offer(queue.poll());
        }
    }
    
    public int pop() {
        return queue.poll();
    }
    
    public int top() {
        return queue.peek();
    }
    
    public boolean empty() {
        return queue.peek() == null ;
    }

}