# LeetCode232 Implement Queue using Stacks Java 题解

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 toppeek/pop from topsize, and is emptyoperations 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).

class MyQueue {
// Push element x to the back of queue.
Stack<Integer> stack=new Stack<>();
Stack<Integer> stack2=new Stack<>();

public void push(int x) {
while(!stack.isEmpty())
{
stack2.push(stack.pop());
}
stack2.push(x);
while(!stack2.isEmpty())
{
stack.push(stack2.pop());
}

}

// Removes the element from in front of queue.
public void pop() {
stack.pop();
}

// Get the front element.
public int peek() {
return stack.peek();
}

// Return whether the queue is empty.
public boolean empty() {
return stack.isEmpty();
}
}

class MyQueue2 {
// Push element x to the back of queue.
Stack<Integer> stack=new Stack<>();
Stack<Integer> stack2=new Stack<>();

public void push(int x) {
while(!stack2.isEmpty())
stack.push(stack2.pop());
stack.push(x);

}

// Removes the element from in front of queue.
public void pop() {

while(!stack.isEmpty())
stack2.push(stack.pop());
stack2.pop();

}

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

}

// Return whether the queue is empty.
public boolean empty() {
while(!stack2.isEmpty())
stack.push(stack2.pop());
return stack.isEmpty();
}
}

• 本文已收录于以下专栏：

举报原因： 您举报文章：LeetCode232 Implement Queue using Stacks Java 题解 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)