剑指 Offer 09. 用两个栈实现队列
题目链接
a,b两个栈实现队列,a栈负责入队,b栈负责出队,做这道题相当于把两个栈的尾部相连接,为了避免频繁的入栈出栈,等出队的栈为空时,再把a栈中的数据倒进b。
具体实现如下:
class CQueue {
public:
stack<int> s1, s2;
CQueue() {
while (!s1.empty()) {
s1.pop();
}
while (!s2.empty()) {
s2.pop();
}
}
void appendTail(int value) {
s1.push(value);
}
int deleteHead() {
if(s2.empty())
{
if(s1.empty()) return -1;
while(!s1.empty())
{
s2.push(s1.top());
s1.pop();
}
}
int res = s2.top();
s2.pop();
return res;
}
};
/**
* Your CQueue object will be instantiated and called as such:
* CQueue* obj = new CQueue();
* obj->appendTail(value);
* int param_2 = obj->deleteHead();
*/
如果对你有帮助的话,请点个赞哦!