题目描述
用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 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元素全部压回s1
该方法不是最优解,时间复杂度较高
class CQueue {
private:
stack<int> s1;
stack<int> s2;
public:
CQueue() {
}
void appendTail(int value) {
while(!s1.empty())
{
s2.push(s1.top());
s1.pop();
}
s1.push(value);
while(!s2.empty())
{
s1.push(s2.top());
s2.pop();
}
}
int deleteHead() {
if(s1.empty()) return -1;
int x = s1.top();
s1.pop();
return x;
}
};
/**
* Your CQueue object will be instantiated and called as such:
* CQueue* obj = new CQueue();
* obj->appendTail(value);
* int param_2 = obj->deleteHead();
*/
思路二(最优解)
栈s1、s2各司其职,s1用来队列头部增加元素,s2用来队列尾部删减元素。只需当s2为空时,将s1的所有元素压入s2即可.
class CQueue {
stack<int>s1;
stack<int>s2;
public:
CQueue() {
}
void appendTail(int value) {
s1.push(value);
}
int deleteHead() {
if(s2.empty()){
if(s1.empty()){
return -1;
}
else{
while(!s1.empty()){
s2.push(s1.top());
s1.pop();
}
}
}
int head=s2.top();
s2.pop();
return head;
}
};
/**
* Your CQueue object will be instantiated and called as such:
* CQueue* obj = new CQueue();
* obj->appendTail(value);
* int param_2 = obj->deleteHead();
*/