#include<stdio.h>
#define MAXLEN 10
int stack[MAXLEN];
int top;
void push[int stack[],x]{
if(top==size(stack)-1){
printf("stack overflow");
return 1;
}else{
top=top+1;
stack[top]=x;
printf("push ok");
return 0;
}
}
void pop(int stack[]){
if(size(stack)-1==-1){
printf("stack is empty")
return 1;
}
else{
top=top-1;
printf("pop ok");
return 0;
}
}
int *read(int stack[]){
int *p;
if(size(stack)-1==-1){
printf("stack is empty")
return 1;
}else{
*p=stack[top];
top=top-1;
printf("read ok");
return p;
}
}
栈的顺式结构
最新推荐文章于 2022-03-01 13:10:27 发布