leetcode 225. 用队列实现栈 easy
题目描述:
解题思路:
可以用一个队列实现, push的时候,把之前的元素都pop,push回去
代码:
class MyStack {
public:
MyStack() {
}
void push(int x) {
int len = que.size();
que.push(x);
for (int i = 0; i < len; i++)
{
que.push(que.front());
que.pop();
}
}
int pop() {
int res = que.front();
que.pop();
return res;
}
int top() {
return que.front();
}
bool empty() {
return que.empty();
}
private:
queue<int> que;
};
/**
* Your MyStack object will be instantiated and called as such:
* MyStack* obj = new MyStack();
* obj->push(x);
* int param_2 = obj->pop();
* int param_3 = obj->top();
* bool param_4 = obj->empty();
*/