class CQueue {
public:
CQueue() {
}
void appendTail(int value) {
s1.push(value);
}
int deleteHead() {
int ans;
if (s2.empty()) {
while (!s1.empty()) {
s2.push(s1.top());
s1.pop();
}
}
if (s2.empty())return -1;
ans = s2.top();
s2.pop();
return ans;
}
private:
stack<int> s1, s2;
};
剑指 Offer 09. 用两个栈实现队列
最新推荐文章于 2024-07-13 13:36:16 发布