用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 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.元素“入队”:
直接将元素在栈st1中进行入栈
2.元素“出队”:
如果栈st1和st2均为空直接返回-1,“队列”中无元素
如果栈st1有元素,栈st2为空,栈st1元素逐个出栈并在栈st2中进行入栈,完成后取栈st2 的栈顶元素即为“出队”
如果栈st2有元素,直接将st2栈顶元素出栈,即为“出队”
#include<stack>
class CQueue {
public:
CQueue() {
}
void appendTail(int value) {
st1.push(value);
}
int deleteHead() {
if(st2.empty())
{
if(st1.empty())
return -1;
while(!st1.empty())
{
st2.push(st1.top());
st1.pop();
}
}
int value=st2.top();
st2.pop();
return value;
}
private:
stack<int> st1;
stack<int> st2;
};
/**
* Your CQueue object will be instantiated and called as such:
* CQueue* obj = new CQueue();
* obj->appendTail(value);
* int param_2 = obj->deleteHead();
*/