双栈法:
用数组代替栈,s2的栈顶始终是最先进入的的数
时间复杂度:,每个元素插入只有一次,删除看似会从 s1 移动到 s2,但是实际每次每个元素只是移动一次再弹出一次,所有也是
的时间复杂度
空间复杂度:
class CQueue {
public:
CQueue() {
}
void appendTail(int value) {
s1.push_back(value);
}
int deleteHead() {
if (s2.empty()) {
while (!s1.empty()) {
s2.push_back(s1.back());
s1.pop_back();
}
}
if (s2.empty()) return -1;
int res = s2.back();
s2.pop_back();
return res;
}
private:
vector<int> s1;
vector<int> s2;
};
/**
* Your CQueue object will be instantiated and called as such:
* CQueue* obj = new CQueue();
* obj->appendTail(value);
* int param_2 = obj->deleteHead();
*/