LeetCode 232用栈实现队列Easy
- 题目简述:使用栈实现队列的下列操作
- push(x) – 将一个元素放入队列的尾部。
- pop() – 从队列首部移除元素。
- peek() – 返回队列首部的元素。
- empty() – 返回队列是否为空。
- 思路:
- 入队实现:无条件将新元素加入栈A
- 出队实现:判断栈B是否为空,如果为空,则将栈A中所有元素push进栈B;如果栈B不为空,栈B直接出栈。
class MyQueue {
public:
/** Initialize your data structure here. */
MyQueue() {
}
/** Push element x to the back of queue. */
void push(int x) {
stk1.push(x);
}
/** Removes the element from in front of queue and returns that element. */
int pop() {
if(stk2.empty())
{
if(stk1.empty()) return -1;
while(stk1.size())
{
stk2.push(stk1.top());
stk1.pop();
}
}
int res = stk2.top();
stk2.pop();
return res;
}
/** Get the front element. */
int peek() {
if(stk2.empty())
{
if(stk1.empty()) return -1;
while(stk1.size())
{
stk2.push(stk1.top());
stk1.pop();
}
}
return stk2.top();
}
/** Returns whether the queue is empty. */
bool empty() {
if(stk1.empty() && stk2.empty()) return true;
else return false;
}
private:
stack<int> stk1;
stack<int> stk2;
};
/**
* 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();
*/