LeetCode 225题用队列实现栈（Implement Stack using Queues

import java.util.LinkedList;
import java.util.Queue;

class MyStack {

    private Queue<Integer> queue_1 = new LinkedList<>();
    private Queue<Integer> queue_2 = new LinkedList<>();
    private int top;
    /** Initialize your data structure here. */
    public MyStack() {

    }

    /** Push element x onto stack. */
    public void push(int x) {
        queue_1.add(x);
        top = x;
    }

    /** Removes the element on top of the stack and returns that element. */
    public int pop() {
        if(empty()){
            throw new RuntimeException("MyStack空了!");
        }
        while(queue_1.size() > 1){
            top = queue_1.remove();
            queue_2.add(top);
        }
        int last_ele = queue_1.remove();
        Queue<Integer> queue_temp = queue_1;
        queue_1 = queue_2;
        queue_2 = queue_temp;
        return last_ele;
    }

    /** Get the top element. */
    public int top() {
        if(empty()){
            throw new RuntimeException("MyStack空了!");
        }
        return top;
    }

    /** Returns whether the stack is empty. */
    public boolean empty() {
        return queue_1.isEmpty() && queue_2.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();
 */