题目:用两个栈实现队列
用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 appendTail 和 deleteHead ,分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素,deleteHead 操作返回 -1 )
示例 1:
输入:
["CQueue","appendTail","deleteHead","deleteHead"]
[[],[3],[],[]]
输出:[null,null,3,-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:
CQueue() {
}
void appendTail(int value) {
}
int deleteHead() {
}
};
/**
* Your CQueue object will be instantiated and called as such:
* CQueue* obj = new CQueue();
* obj->appendTail(value);
* int param_2 = obj->deleteHead();
*/
解题:
入栈操作O(1),出栈操作最坏O(n),最好O(1)。
class CQueue {
private:
stack<int> inStack;
stack<int> outStack;
public:
CQueue() {
}
void appendTail(int value) {
inStack.push(value);
}
int deleteHead() {
int res=-1;
if(!outStack.empty()) {
res=outStack.top();
outStack.pop();
} else if(!inStack.empty()) {
while(!inStack.empty()) {
outStack.push(inStack.top());
inStack.pop();
}
res = outStack.top();
outStack.pop();
}
return res;
}
};
拓展:如果不要求栈的个数,可以用一个vector解决:
class CQueue {
private:
vector<int> inStack;
public:
CQueue() {
}
void appendTail(int value) {
inStack.push_back(value);
}
int deleteHead() {
int res =-1;
if(inStack.size()!=0){
res = inStack[0];
inStack.erase(inStack.begin());
}
return res;
}
};