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

1.第一份工作的面试题

class Solution {
public:
    vector<pair<int, int>> stack;
    
    void push(int value) {
        int min_value = value;
        if(stack.size()>0) {
            int top_min = get<1>(stack.back());
            min_value = max(-top_min,-min_value) * -1;
        }
        stack.push_back(pair<int,int>(value,min_value));
    }
    void pop() {
        stack.pop_back();
    }
    int top() {
        return get<0>(stack.back());
    }
    int min() {
        return get<1>(stack.back());
    }
};