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

#include <bits/types/stack_t.h>
#include <stack>
class Solution {
public:
    stack<int>stk1;
    stack<int>stk2;

    void push(int value) {
        stk1.push(value);
        if(stk2.empty()||stk2.top()>value){
            stk2.push(value);
        }else{
            stk2.push(stk2.top());//每个入栈元素需要对应当前栈的最小值
        }   
    }
    void pop() {
         stk1.pop();
         stk2.pop();
        
    }
    int top() {
        return stk1.top();
    }
    int min() {
        return stk2.top();
    }
};