用栈实现队列
题目描述
请你仅使用两个栈实现先入先出队列。队列应当支持一般队列支持的所有操作(push、pop、peek、empty):
实现 MyQueue 类:
void push(int x) 将元素 x 推到队列的末尾
int pop() 从队列的开头移除并返回元素
int peek() 返回队列开头的元素
boolean empty() 如果队列为空,返回 true ;否则,返回 false
具体代码
代码如下(示例):
class MyQueue {
public:
stack<int> stack1,stack2;
/** Initialize your data structure here. */
MyQueue() {
}
/** Push element x to the back of queue. */
void push(int x) {
stack1.push(x);
}
/** Removes the element from in front of queue and returns that element. */
int pop() {
if (stack2.empty()){
while (!stack1.empty()){
int tem = stack1.top();
stack1.pop();
stack2.push(tem);
}
}
int front = stack2.top();
stack2.pop();
return front;
}
/** Get the front element. */
int peek() {
if (stack2.empty()){
while (!stack1.empty()){
int tem = stack1.top();
stack1.pop();
stack2.push(tem);
}
}
return stack2.top();
}
/** Returns whether the queue is empty. */
bool empty() {
return stack1.empty() && stack2.empty();
}
};