40. 用栈实现队列

40. 用栈实现队列

 

正如标题所述，你需要使用两个栈来实现队列的一些操作。

队列应支持push(element)，pop() 和 top()，其中pop是弹出队列中的第一个(最前面的)元素。

pop和top方法都应该返回第一个元素的值。

样例

例1:

输入:

push(1)

pop()

push(2)

push(3)

top()

pop()

输出:

1

2

2

例2:

输入:

push(1)

push(2)

push(2)

push(3)

push(4)

push(5)

push(6)

push(7)

push(1)

输出:

[]

挑战

仅使用两个栈来实现它，不使用任何其他数据结构，push，pop 和 top的复杂度都应该是均摊O(1)的

注意事项

假设调用pop()函数的时候，队列非空

public class MyQueue {
        Stack<Integer> stack;
//        Stack<Integer> next;


        public MyQueue() {
            // do intialization if necessary
            stack = new Stack<>();
//            next = new Stack<>();
        }


        /*
         * @param element: An integer
         * @return: nothing
         */
        public void push(int element) {
            // write your code here
            stack.add(0,element);
        }


        /*
         * @return: An integer
         */
        public int pop() {
            // write your code here
//            while (!stack.empty()) {
//                next.add(stack.pop());
//            }
//            int result = next.pop();
//            while (!next.empty()) {
//                stack.add(next.pop());
//            }
            return stack.pop();
        }


        /*
         * @return: An integer
         */
        public int top() {
            // write your code here
//            while (!stack.empty()) {
//                next.add(stack.pop());
//            }
//            int result = next.peek();
//            while (!next.empty()) {
//                stack.add(next.pop());
//            }
            return stack.peek();
        }
}



public class MyQueue {
   Stack<Integer> stack;
        Stack<Integer> next;


        public MyQueue() {
            // do intialization if necessary
            stack = new Stack<>();
            next = new Stack<>();
        }


        /*
         * @param element: An integer
         * @return: nothing
         */
        public void push(int element) {
            // write your code here
            stack.add(element);
        }


        /*
         * @return: An integer
         */
        public int pop() {
            // write your code here
            while (!stack.empty()) {
                next.add(stack.pop());
            }
            int result = next.pop();
            while (!next.empty()) {
                stack.add(next.pop());
            }
            return result;
        }


        /*
         * @return: An integer
         */
        public int top() {
            // write your code here
            while (!stack.empty()) {
                next.add(stack.pop());
            }
            int result = next.peek();
            while (!next.empty()) {
                stack.add(next.pop());
            }
            return result;
        }
}