c++栈，+练习题

1

栈stack：先进后出

#include<stack>

stack<int>stk;
stk.push(1) ;

stk.push(2);//插入到栈中
stk.top();//返回栈顶元素的引用

stk.pop()://移除并返回栈顶元素

str.peek();//返回栈顶但不删除

2

利用两个栈实现队列：

代码如下：

class MyQueue {
public:
    /** Initialize your data structure here. */
    stack<int>s1,s2;
    MyQueue() {
        
    }
    
    /** Push element x to the back of queue. */
    void push(int x) {
        s1.push(x);
    }
    
    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        while(s1.size()>1) s2.push(s1.top()),s1.pop();
        int t=s1.top();
        s1.pop();
        while(s2.size()) s1.push(s2.top()),s2.pop();
        return t;
    }
    
    /** Get the front element. */
    int peek() {
         while(s1.size()>1) s2.push(s1.top()),s1.pop();
        int t=s1.top();
        
        while(s2.size()) s1.push(s2.top()),s2.pop();
        return t;
    }
    
    /** Returns whether the queue is empty. */
    bool empty() {
        return s1.empty();
    }
};

/**
 * Your MyQueue object will be instantiated and called as such:
 * MyQueue obj = MyQueue();
 * obj.push(x);
 * int param_2 = obj.pop();
 * int param_3 = obj.peek();
 * bool param_4 = obj.empty();
 */