用队列实现栈

每次插入元素后，调整队列中元素的位置，先获取队头元素并删除，再将该元素插入到队尾。实现先入后出的特性。

class MyStack {
private:
  queue<int> q;
public:
  /** Initialize your data structure here. */
  MyStack() 
  {}
  /** Push element x onto stack. */
  void push(int x) {
    int size = q.size();
    q.push(x);
    while (size--){
      int temp = q.front();
      q.pop();
      q.push(temp);
    }
  }
  /** Removes the element on top of the stack and returns that element. */
  int pop() {
    int temp = q.front();
    q.pop();
    return temp;
  }
  /** Get the top element. */
  int top() {
    return q.front();
  }
  /** Returns whether the stack is empty. */
  bool empty() {
    return q.empty();
  }
};