题解 | #包含min函数的栈#

#include <climits>
#include <stack>
class Solution {
  public:
    vector<int> s;
    void push(int value) {
        s.push_back(value);
    }
    void pop() {
        s.pop_back();
    }
    int top() {
        return s[s.size() - 1];
    }
    int min() {
        int m = INT_MAX;
        for (int i = 0; i < s.size(); ++i) {
            if (s[i] < m) {
                m = s[i];
            }
        }
        return m;
    }
};