C++ | Leetcode C++题解之第225题用队列实现栈
题目：
题解：
class MyStack {
public:queue<int> q;/** Initialize your data structure here. */MyStack() {}/** Push element x onto stack. */void push(int x) {int n = q.size();q.push(x);for (int i = 0; i < n; i++) {q.push(q.front());q.pop();}}/** Removes the element on top of the stack and returns that element. */int pop() {int r = q.front();q.pop();return r;}/** Get the top element. */int top() {int r = q.front();return r;}/** Returns whether the stack is empty. */bool empty() {return q.empty();}
};