思路:
一个in栈专门用于队列尾部插入,一个out栈专门用于队列头部删除;
当out栈为空时但in栈不为空,则把in中的元素依次弹出并压入out中;若in和out栈都为空,代表队列中没有元素。
class CQueue {
public:
stack<int> in,out;
CQueue() {
}
void appendTail(int value) {
in.push(value);
}
int deleteHead() {
if(!out.empty()){
int ans = out.top();
out.pop();
return ans;
}else if(!in.empty()){
while(!in.empty()){
out.push(in.top());
in.pop();
}
int ans = out.top();
out.pop();
return ans;
}
else return -1;
}
};
/**
* Your CQueue object will be instantiated and called as such:
* CQueue* obj = new CQueue();
* obj->appendTail(value);
* int param_2 = obj->deleteHead();
*/