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

#define MAXSIZE 300
class Solution {
private:
    int * arr = new int[300];
    int t = 0;
public:
    void push(int value) {
        if(t == 300) 
        return;
        else arr[++ t ] = value;   
        
    }
    void pop() {
        if(t == 0) return;
        t --;
        
    }
    int top() {
        if(t == 0) return -1;
        else {
            return arr[t];
        }
        
    }
    int min() {
        int min = arr[t];
        int k = t;
        while(k){
            if(min > arr[k]){
                min = arr[k];
            }
            k --;
        }
        return min;
        
    }
};