Note:
一个栈存,一个栈弹出,弹出的栈空了,就倒一次存放的栈到弹出的栈
代码如下:
class CQueue {
public:
stack<int> s1, s2;
CQueue() {
}
void appendTail(int value) {
s2.push(value);
}
int deleteHead() {
if(s1.empty() && s2.empty()) return -1;
if(s1.empty() && !s2.empty()){
while(!s2.empty()){
int h = s2.top();
s2.pop();
s1.push(h);
}
}
int ans = s1.top();
s1.pop();
return ans;
}
};
/**
* Your CQueue object will be instantiated and called as such:
* CQueue* obj = new CQueue();
* obj->appendTail(value);
* int param_2 = obj->deleteHead();
*/