做题链接:https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/
用双栈代替队列,一个栈用于push,一个栈用于pop
class CQueue {
stack<int> stack1, stack2;
public:
CQueue() {
while(!stack1.empty()) stack1.pop();
while(!stack2.empty()) stack2.pop();
}
void appendTail(int value) {
stack1.push(value);
}
int deleteHead() {
if(stack2.empty()){
while(!stack1.empty()){
stack2.push(stack1.top());
stack1.pop();
}
}
if(stack2.empty()) return -1;
else{
int del = stack2.top();
stack2.pop();
return del;
}
}
};
/**
* Your CQueue object will be instantiated and called as such:
* CQueue* obj = new CQueue();
* obj->appendTail(value);
* int param_2 = obj->deleteHead();
*/