用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 appendTail
和 deleteHead
,分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素,deleteHead
操作返回 -1 )
示例 1:
输入: ["CQueue","appendTail","deleteHead","deleteHead","deleteHead"] [[],[3],[],[],[]] 输出:[null,null,3,-1,-1]
示例 2:
输入: ["CQueue","deleteHead","appendTail","appendTail","deleteHead","deleteHead"] [[],[],[5],[2],[],[]] 输出:[null,-1,null,null,5,2]
提示:
1 <= values <= 10000
- 最多会对
appendTail、deleteHead
进行10000
次调用
class CQueue {
public:
stack<int>s1;stack<int>s2;
CQueue() {
}
void appendTail(int value) {
s1.push(value);
}
int deleteHead() {
int ans=0;
if(s2.size()==0&&s1.size()==0)return -1;
else if(s2.size()==0)
{
while(!s1.empty())
{
int t=s1.top();
s1.pop();
s2.push(t);
}
}
ans=s2.top();
s2.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();
*/