用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 appendTail 和 deleteHead ,分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素,deleteHead 操作返回 -1 )
示例 1:
输入:
["CQueue","appendTail","deleteHead","deleteHead"]
[[],[3],[],[]]
输出:[null,null,3,-1]
题解:
class CQueue {
public:
stack<int> s;
stack<int> t;
CQueue() {
}
void appendTail(int value) {
s.push(value);
}
int deleteHead() {
int tmp,del;
if(s.empty()==1){
del=-1;
}
else{
while(!s.empty()){
tmp=s.top();
t.push(tmp);
s.pop();
}
del=t.top();
t.pop();
while(!t.empty()){
tmp=t.top();
s.push(tmp);
t.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();
*/