代码随想录算法训练营Day10| 232.用栈实现队列、 225. 用队列实现栈

232.用栈实现队列

class MyQueue {
    Stack<Integer> stackIn;
    Stack<Integer> stackOut;
    public MyQueue() {
        this.stackIn = new Stack<Integer>();
        this.stackOut = new Stack<Integer>();
    }
    
    public void push(int x) {
        stackIn.push(x);
    }
    
    public int pop() {
        int result;
        if(stackOut.isEmpty()){
            while(!stackIn.isEmpty()){
                stackOut.push(stackIn.pop());
            }
            result = stackOut.pop();
        }else{
            result = stackOut.pop();
        }
        return result;
    }
    
    public int peek() {
        int result;
        if(stackOut.isEmpty()){
            while(!stackIn.isEmpty()){
                stackOut.push(stackIn.pop());
            }
            result = stackOut.peek();
        }else{
            result = stackOut.peek();
        }
        return result;
    }
    
    public boolean empty() {
        return stackIn.isEmpty() && stackOut.isEmpty();
    }
}

/**
 * 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. 用队列实现栈

单队列实现

class MyStack {
    Deque<Integer> deque;
    public MyStack() {
        this.deque = new LinkedList<Integer>();
    }
    
    public void push(int x) {
        deque.offer(x);
    }
    
    public int pop() {
        int size = deque.size();
        for(int i=0;i < size-1;i++){
            deque.offer(deque.poll());
        }
        return deque.poll();
    }
    
    public int top() {
        int result;
        int size = deque.size();
        for(int i=0;i < size-1;i++){
            deque.offer(deque.poll());
        }
        result = deque.peek();
        deque.offer(deque.poll());
        return result;
    }
    
    public boolean empty() {
        return deque.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();
 */