Beat 85% java submissions. 2 stacks.


  • 0
    F
    class MyQueue {
        // Push element x to the back of queue.
        Stack<Integer> stack1=new Stack();
    	Stack<Integer> stack2=new Stack();
        public void push(int x) {
            stack1.push(x);
        }
    
        // Removes the element from in front of queue.
        public void pop() {
            while(!stack1.empty()){
                stack2.push(stack1.pop());
            }
            stack2.pop();
            while(!stack2.empty()){
                stack1.push(stack2.pop());
            }
        }
    
        // Get the front element.
        public int peek() {
            while(!stack1.empty()){
                stack2.push(stack1.pop());
            }
            int res=stack2.peek();
            while(!stack2.empty()){
                stack1.push(stack2.pop());
            }
            return res;
        }
    
        // Return whether the queue is empty.
        public boolean empty() {
            return stack1.empty();
        }
    }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.