今日份题目:
用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 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
次调用
题目思路
栈的特点是先进后出,队列的特点是先进先出。使用in栈存放入队元素,使用out栈存放出队元素,使用temp栈用来中间转换。
代码
class CQueue
{
public:
stack<int> in,out,temp;
CQueue() { }
void appendTail(int value)
{
in.push(value);
}
int deleteHead()
{
if(out.empty()&&in.empty()) return -1;
else if(out.empty()&&!in.empty())
{
while(!in.empty())
{
int cur=in.top();
in.pop();
out.push(cur);
}
}
else if(!out.empty()&&in.empty())
{
int cur=out.top();
out.pop();
return cur;
}
else //in栈和out栈都有内容的情况,过程见图解
{
while(!out.empty())
{
int cur=out.top();
out.pop();
temp.push(cur);
}
while(!in.empty())
{
int cur=in.top();
in.pop();
out.push(cur);
}
while(!temp.empty())
{
int cur=temp.top();
temp.pop();
out.push(cur);
}
}
int cur=out.top();
out.pop();
return cur;
}
};
/**
* Your CQueue object will be instantiated and called as such:
* CQueue* obj = new CQueue();
* obj->appendTail(value);
* int param_2 = obj->deleteHead();
*/
提交结果