【leetcode】【232】Implement Queue using Stacks

一、问题描述

Implement the following operations of a queue using stacks.

• push(x) -- Push element x to the back of queue.
• pop() -- Removes the element from in front of queue.
• peek() -- Get the front element.
• empty() -- Return whether the queue is empty.

Notes:

• You must use only standard operations of a stack -- which means only push to top, peek/pop from top, size, and is empty operations are valid.
• Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.
• You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).

二、问题分析

design类题目，与两个队列实现一个栈差不多，可以画一下分析分析。

三、Java AC代码

class MyQueue {
    private LinkedList<Integer> stack1 = new LinkedList<Integer>();
	private LinkedList<Integer> stack2 = new LinkedList<Integer>();
    // Push element x to the back of queue.
    public void push(int x) {
        stack1.push(x);
    }

    // Removes the element from in front of queue.
    public void pop() {
        if (!stack2.isEmpty()) {
			stack2.pop();
		}else {
			while(!stack1.isEmpty()){
				stack2.push(stack1.pop());
			}
			stack2.pop();
		}
    }

    // Get the front element.
    public int peek() {
    	if (!stack2.isEmpty()) {
			return stack2.peek();
		}else {
			while(!stack1.isEmpty()){
				stack2.push(stack1.pop());
			}
			return stack2.peek();
		}
    }

    // Return whether the queue is empty.
    public boolean empty() {
        if (!stack1.isEmpty() || !stack2.isEmpty()) {
			return false;
		}
        return true;
    }
}