代码随想录训练营day10|LeetCode 232|

LeetCode 232 用栈实现队列

用两个栈来实现队列。当需要pop时，将StackIn栈中的值一次弹入out栈中，再进行pop

class MyQueue {
    Stack<Integer> stackIn;
    Stack<Integer> stackOut;

    public MyQueue() {
        stackIn = new Stack<>();
        stackOut = new Stack<>();
    }
    
    public void push(int x) {
        stackIn.push(x);
    }
    
    public int pop() {
        if(stackOut.isEmpty()){
            while(!stackIn.isEmpty()){
                int x = stackIn.pop();
                stackOut.push(x);
            }
        }
        return stackOut.pop();

    }
    
    public int peek() {
        if(stackOut.isEmpty()){
            while(!stackIn.isEmpty()){
                int x = stackIn.pop();
                stackOut.push(x);
            }
        }
        return stackOut.peek();
    }
    
    public boolean empty() {
        if(stackIn.isEmpty() &&stackOut.isEmpty()) return true;
        else return false;
    }
}

/**
 * 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();
 */

LeetCode 225 用队列实现栈

这里使用了一个辅助队列，再每次进行添加操作时，我们需要先将原来队列中的数据先添加到辅助队列中，然后再进行增加操作，最后再把辅助队列中的数据转移回来。

因为时间有限，就只使用了一种方式实现

class MyStack {
    Queue<Integer> queue1;
    Queue<Integer> queue2;
    public MyStack() {
        queue1 = new LinkedList<Integer>();
        queue2 = new LinkedList<Integer>();
    }
    
    public void push(int x) {
        while(queue1.size()>0){
            queue2.offer(queue1.poll());
        }
        queue1.offer(x);
        while(queue2.size()>0){
            queue1.offer(queue2.poll());
        }
    }
    
    public int pop() {
       return  queue1.poll();
    }
    
    public int top() {
        return queue1.peek();
    }
    
    public boolean empty() {
        return queue1.isEmpty();
    }
}

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