定義棧的數(shù)據(jù)結(jié)構(gòu),要求添加一個 min 函數(shù),能夠得到棧的最小元素颅夺。 要求函數(shù) min资盅、push 以及 pop 的時間復(fù)雜度都是 O(1)漓库。
hint: 棧元素攜帶min的信息
#include<iostream>
#include <stdlib.h>
using namespace std;
struct MinStackElement {
int data;
int min;
};
struct MinStack{
int size;
int top;
MinStackElement * data;
};
MinStack minStackInit(int maxSize){
MinStack stack;
stack.size = maxSize;
stack.data = (MinStackElement *)
malloc(sizeof(MinStackElement)*maxSize);
stack.top = 0;
return stack;
}
void MinStackFree(MinStack &stack){
free(stack.data);
}
void push(MinStack &stack,int d){
if (stack.top==stack.size) {
// error("out of stack");
}
MinStackElement* p = stack.data+stack.top;
p->data = d;
p->min = (stack.top==0 ?d:stack.data[stack.top-1].min);
if (d<p->min) {
p->min = d;
}
stack.top++;
}
int pop(MinStack stack){
if (stack.top ==0) {
//error("stack is empty");
}
return stack.data[--stack.top].data;
}
int min(MinStack stack){
if (stack.top ==0) {
//error("stack is empty");
}
return stack.data[--stack.top].min;
}
int main(){
MinStack stack = minStackInit(6);
push(stack, 1);
push(stack, 2);
push(stack, 3);
push(stack, 4);
push(stack, 5);
push(stack, 6);
cout<<pop(stack)<<endl;
cout<<min(stack)<<endl;
MinStackFree(stack);
return 0;
}
