Implement the following operations of a stack using queues.
- push(x) -- Push element x onto stack.
- pop() -- Removes the element on top of the stack.
- top() -- Get the top element.
- empty() -- Return whether the stack is empty.
- You must use only standard operations of a queue -- which means only
push to back
,peek/pop from front
,size
, andis empty
operations are valid. - Depending on your language, queue may not be supported natively. You may simulate a queue by using a list or deque (double-ended queue), as long as you use only standard operations of a queue.
- You may assume that all operations are valid (for example, no pop or top operations will be called on an empty stack).
思路:数据结构采用STL里的queue,在每次push进数据的时候,对queue里该数据之后的数据重新出队列进队列即可维持一个栈的顺序。
class Stack {
public:
// Push element x onto stack.
void push(int x) {
myqueue.push(x);
for (int i = 0; i < myqueue.size() - 1; i++){
int tmp = myqueue.front();
myqueue.pop();
myqueue.push(tmp);
}
}
// Removes the element on top of the stack.
void pop() {
myqueue.pop();
}
// Get the top element.
int top() {
return myqueue.front();
}
// Return whether the stack is empty.
bool empty() {
return myqueue.empty();
}
private:
queue<int> myqueue;
};