包含min函数的栈

class Solution {public:    stack<int> s;    stack<int> minS;void push(int value) {if(minS.size() == 0 || value < minS.top())            minS.push(value);        s.push(value);}void pop() {if(s.top() == minS.top())            minS.pop();        s.pop();}int top() {return s.top();}int min() {return minS.top();}};