# [LeetCode] Implement Queue using Stacks

1816人阅读 评论(0)

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

class Queue {
public:
// Push element x to the back of queue.
void push(int x) {
stacks[0].push(x);
}

// Removes the element from in front of queue.
void pop(void) {
if(stacks[1].empty()){
while(!stacks[0].empty()){
stacks[1].push(stacks[0].top());
stacks[0].pop();
}
}
stacks[1].pop();
}

// Get the front element.
int peek(void) {
if(stacks[1].empty()){
while(!stacks[0].empty()){
stacks[1].push(stacks[0].top());
stacks[0].pop();
}
}
return stacks[1].top();
}

// Return whether the queue is empty.
bool empty(void) {
return stacks[0].empty() && stacks[1].empty();
}

private:
stack<int> stacks[2];
};

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：283962次
• 积分：5500
• 等级：
• 排名：第5024名
• 原创：278篇
• 转载：11篇
• 译文：0篇
• 评论：81条
阅读排行
评论排行
最新评论