题目:
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.
- You must use only standard operations of a stack -- which means only
push to top
,peek/pop from top
,size
, andis 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).
思路:
我开始的思路是仿照我原来的帖子《[Leetcode] 225. Implement Stack using Queues 解题报告》中的实现,在pop的时候,定义一个临时stack,来对原来的stack进行腾挪。这样的实现可以通过所有测试,但是其时间复杂度却每次都高达O(2 * n),不是一个好的实现。看到别人用了两个stack来模拟队列,觉得很巧妙。这里关键是对pop的实现:
我们知道栈的特性是后入先出,队列的特性是先入先出。所以要出队列的值是最先入队列的,而这个值在st1的最底部,因此我们可以将栈st1的值全部取出,放入栈st2中,这样在栈st2顶部的值就是队列的首部。那么当我们要出队列一个值的时候,如果st2不为空,则可知其栈顶元素就是我们队列的首个元素,因此把这个元素出栈即可;如果st2为空,则我们首先将st1中的元素反序加入st2中。在这样的实现中,大多数情况下,pop的时间复杂度都是O(1),均摊时间复杂度要比我原来的实现好很多。
代码:
class MyQueue {
public:
/** Initialize your data structure here. */
MyQueue() {
}
/** Push element x to the back of queue. */
void push(int x) {
st1.push(x);
}
/** Removes the element from in front of queue and returns that element. */
int pop() {
if (!st2.empty()) {
int ret = st2.top();
st2.pop();
return ret;
}
while (!st1.empty()) {
st2.push(st1.top());
st1.pop();
}
int ret = st2.top();
st2.pop();
return ret;
}
/** Get the front element. */
int peek() {
if (!st2.empty()) {
return st2.top();
}
while (!st1.empty()) {
st2.push(st1.top());
st1.pop();
}
return st2.top();
}
/** Returns whether the queue is empty. */
bool empty() {
return st1.empty() && st2.empty();
}
private:
stack<int> st1, st2;
};
/**
* Your MyQueue object will be instantiated and called as such:
* MyQueue obj = new MyQueue();
* obj.push(x);
* int param_2 = obj.pop();
* int param_3 = obj.peek();
* bool param_4 = obj.empty();
*/