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

class Solution {
public:
    vector<int> vec, minvec;
    
    void push(int value) {
        vec.push_back(value);
        if (minvec.empty() || value < minvec.back()) minvec.push_back(value);
        else  minvec.push_back(minvec.back());
    }
    void pop() {
        vec.pop_back();
        minvec.pop_back();
    }
    int top() {
        return vec.back();
    }
    int min() {
        return minvec.back();
    }
};