155. 最小栈

typedef struct {

    int data[10000];
    int top;
} MinStack;

/** initialize your data structure here. */

MinStack* minStackCreate() {
    MinStack *st;
    st = (MinStack *)malloc(sizeof(MinStack));
    st->top=-1;
    //st->data = (int *)malloc(sizeof(int)*100000);
    return st;
}

void minStackPush(MinStack* obj, int val) {
    
    obj->data[++(obj->top)]=val;
}

void minStackPop(MinStack* obj) {
    obj->data[(obj->top)--];
}

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

int minStackGetMin(MinStack* obj) {
    int min=obj->data[0];
    for(int i=0;i<=obj->top;i++)
    {
        if(min>(obj->data[i]))
        {
            min = obj->data[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);
*/