问题描述:用两个栈实现队列
用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 appendTail
和 deleteHead
,分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素,deleteHead
操作返回 -1 )
示例 1:
输入:
["CQueue","appendTail","deleteHead","deleteHead"]
[[],[3],[],[]]
输出:[null,null,3,-1]
示例 2:
输入:
["CQueue","deleteHead","appendTail","appendTail","deleteHead","deleteHead"]
[[],[],[5],[2],[],[]]
输出:[null,-1,null,null,5,2]
提示:
1 <= values <= 10000
最多会对 appendTail、deleteHead 进行 10000 次调用
解题思路
- 使用两个栈s1和s2来维护队列
- s1只负责插入,队头就被压入了栈底
- s2只负责删除,将s1的数据出栈压入到s2,s2入栈顺序恰好是队列的顺序
代码
class CQueue {
public:
CQueue() {
while(!s1.empty())
s1.pop();
while(!s2.empty())
s2.pop();
}
void appendTail(int value) {
s1.push(value);
}
int deleteHead() {
//s2为空就将s1的数据全部导入s2
if(s2.size() <= 0)
{
while(!s1.empty())
{
int value = s1.top();
s1.pop();
s2.push(value);
}
}
//如果s2仍未空,则说明s1也为空,队列中没有数据
if(s2.empty())
return -1;
int value = s2.top();
s2.pop();
return value;
}
private:
stack<int> s1; //s1插入
stack<int> s2; //s2删除
};
/**
* Your CQueue object will be instantiated and called as such:
* CQueue* obj = new CQueue();
* obj->appendTail(value);
* int param_2 = obj->deleteHead();
*/