题目:定义栈的数据结构,请在该类型中实现一个能能够得到栈的最小元素的min函数。在该栈中,调用min,push,pop时间复杂度都是O(1).
思路:创建一个辅助栈(主栈每次压栈或出栈,辅助栈每次压入最小值,出栈),主栈压入的值与辅助栈顶的作比较,若value>栈顶的值,则辅助栈压入栈顶的值,否则,压入value.
#define STACK_SIZE 1024
typedef struct Stack
{
int base;
int top;
int data[STACK_SIZE]; // 暂不考虑溢出情况
}mystack;
bool stack_empty(mystack *stack) {
return stack->base == stack->top;
}
int stack_top(mystack *stack) {
int i = stack->top;
return stack->data[--i];
}
//push
void my_push(mystack *main_stack, mystack *help_stack, int val) {
// main_stack 直接push
main_stack->data[main_stack->top] = val;
main_stack->top++;
// help_stack 需要判断大小
if (true == stack_empty(help_stack) || help_stack->data[help_stack->top] > val) {
help_stack->data[help_stack->top] = val;
help_stack->top++;
}
else {
help_stack->data[help_stack->top] = stack_top(help_stack);
help_stack->top++;
}
}
//pop
int my_pop(mystack *main_stack, mystack *help_stack) {
if (false == stack_empty(main_stack)) { // 两个栈判断一个即可
// mian_stack
int val = main_stack->data[--main_stack->top];
// help_stack
help_stack->top--;
return val;
}
}
//min
int my_min(mystack *help_stack) {
if (false == stack_empty(help_stack)) {
return stack_top(help_stack);
}
}