支持FindMin的栈(顺序栈)
基本思路:没什么好说的声明一个含有min记录最小值的标志变量,每次入栈时比较下就可以了
整体代码:
#include<iostream>
const int stacksize=100;
typedef struct Stack{
int data[stacksize];
int top=-1;
int min=data[0];
}Stack;
using namespace std;
int Isempty(Stack*);
int Isfull(Stack*);
int Push(Stack*,int);
int Pop(Stack*);
int FindMin(Stack*);
int main(void){
Stack p;
int x;
while(cin>>x)
Push(&p,x);
cout<<"$$"<<endl<<"The min number is "<<p.min<<endl;
while(p.data[p.top])
cout<<Pop(&p)<<endl;
return 0;
}
int Isempty(Stack* p){
return p->top==-1;
}
int Isfull(Stack* p){
return p->top==stacksize-1;
}
int Push(Stack* p,int x){
if(Isfull(p)){
cout<<"The stack is full."<<endl;
exit(0);
}
if(p->min>x) p->min=x;
p->data[++p->top]=x;
return 1;
}
int Pop(Stack* p){
if(Isempty(p)){
cout<<"The stack is empty."<<endl;
exit(0);
}
return p->data[p->top--];
}
int FindMin(Stack* p){
return p->min;
}