第五章 栈与队列part01

232.用栈实现队列

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() {
        dumpStackIn();
        return stackOut.pop();


    }
    
    public int peek() {
        dumpStackIn();
        return stackOut.peek();


    }
    
    public boolean empty() {
        return stackIn.isEmpty() && stackOut.isEmpty();

    }
    public void dumpStackIn(){
        if(!stackOut.isEmpty())return;
        while(!stackIn.isEmpty()){
            stackOut.push(stackIn.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.用队列实现栈
 

class MyStack {
    Queue<Integer> queue;

    public MyStack() {
        queue = new LinkedList<>();


    }
    
    public void push(int x) {
        queue.add(x);

    }
    
    public int pop() {
        rePostion();
        return queue.poll();


    }
    
    public int top() {
        rePostion();
        int result = queue.poll();
        queue.add(result);
        return result;

    }
    
    public boolean empty() {
        return queue.isEmpty();


    }
    public void rePostion(){
        int size = queue.size();
        size--;
        while(size-- > 0){
            queue.add(queue.poll());
        }
        
    }
}

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