本人采用双栈的方法,
1:定义结构体;
2: 将栈初始化;
3:创建辅助函数;
4:Push函数,一个将元素推入栈,一个记录最小栈,最小栈需要在栈内有两个元素及以上的时候开始工作;
5:删除函数,依次删除栈顶元素;
6:TOP:指向栈顶元素
7:getMin 检索栈中的最小元素;
8:释放资源
typedef struct {
int *val;
int *minVal;
int idx;
int baseSize;
} MinStack;
//初始化
MinStack* minStackCreate() {
MinStack *stack = (MinStack*)malloc(sizeof(MinStack));
stack -> idx = 0;
stack -> baseSize = 100;
stack -> val = (int*)malloc(sizeof(int) * stack -> baseSize);
stack -> minVal = (int*)malloc(sizeof(int) * stack -> baseSize);
return stack;
}
//辅助函数,扩容栈
void bigStack(MinStack* obj){
obj -> baseSize *= 10;
obj -> val = (int*)realloc(obj -> val, sizeof(int) * (obj -> baseSize));
obj -> minVal = (int*)realloc(obj -> minVal, sizeof(int) * (obj -> baseSize));
return obj;
}
void minStackPush(MinStack* obj, int val) {
if(obj == NULL) return;
if(obj ->idx >= (obj -> baseSize >> 1)) bigStack(obj);
obj -> idx++;
//栈从1 开始
obj -> val[obj -> idx] = val;
obj -> minVal[obj -> idx] = val;
//从2开始,最小值栈开始工作。前缀最小值:当前值 = min(上一数值, 新值)
if(obj -> idx >= 2){
obj -> minVal[obj -> idx] = fmin(obj -> minVal[obj -> idx - 1], val);
}
}//删除
void minStackPop(MinStack* obj) {
if(obj -> idx >= 1){
obj -> idx--;
}
}
//栈顶元素
int minStackTop(MinStack* obj) {
return obj -> val[obj -> idx];
}
//最小栈
int minStackGetMin(MinStack* obj) {
return obj -> minVal[obj -> idx];
}
//释放资源
void minStackFree(MinStack* obj) {
free (obj);
}