225. 用队列实现栈

class MyStack {
    private Queue<Integer> queuePush;
    private Queue<Integer> queuePop;

    public MyStack() {
        queuePush = new LinkedList<Integer>();
        queuePop = new LinkedList<Integer>();
    }

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

    public int pop() {
        int length = queuePush.size();

        for (int i = 0; i < length - 1; i++) {
            queuePop.add(queuePush.poll());
        }

        int value = queuePush.poll();
        queuePush.addAll(queuePop);
        queuePop.clear();
        return value;
    }

    public int top() {
        int length = queuePush.size();

        for (int i = 0; i < length - 1; i++) {
            queuePop.add(queuePush.poll());
        }

        int value = queuePush.poll();
        queuePop.add(value);
        queuePush.addAll(queuePop);
        queuePop.clear();
        return value;
    }

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