还是用栈啊

#define Size 1000

typedef struct {
    int stack[Size];
    int top;
} MinStack;


MinStack* minStackCreate() {
    MinStack* p = (MinStack*)malloc(sizeof(MinStack));
    p->top = -1;
    return p;
}

void minStackPush(MinStack* obj, int val) {
    if(obj->top == Size-1)
        return;
    obj->top++;
    obj->stack[obj->top] = val;
}

void minStackPop(MinStack* obj) {
    if(obj->top == -1)
        return;
    obj->top--;
}

int minStackTop(MinStack* obj) {
    return obj->stack[obj->top];
}

int minStackMin(MinStack* obj) {
    if(obj->top == 0)
        return obj->stack[0];
    int min = obj->stack[0];
    for (int i = obj->top; i >= 0; --i)
    {
        if (min > obj->stack[i])
        {
            min = obj->stack[i];
        }
    }
    return min;
}

void minStackFree(MinStack* obj) {
    free(obj);
}

/**
 * Your MinStack struct will be instantiated and called as such:
 * MinStack* obj = minStackCreate();
 * minStackPush(obj, val);
 
 * minStackPop(obj);
 
 * int param_3 = minStackTop(obj);
 
 * int param_4 = minStackGetMin(obj);
 
 * minStackFree(obj);