以下是一个基本的顺序栈的C语言实现示例： #include<stdio.h> #include

来源：恒创科技编辑：恒创科技编辑部

2024-02-19 13:56:00

以下是一个基本的顺序栈的C语言实现示例：

#include<stdio.h>
#include<stdlib.h>

#defineMAX_SIZE100

typedefstruct{
intdata[MAX_SIZE];
inttop;
}Stack;

voidinitStack(Stack*s){
s->top=-1;
}

intisEmpty(Stack*s){
returns->top==-1;
}

intisFull(Stack*s){
returns->top==MAX_SIZE-1;
}

voidpush(Stack*s,intvalue){
if(isFull(s)){
printf("Stackisfull\n");
return;
}
s->top++;
s->data[s->top]=value;
}

intpop(Stack*s){
if(isEmpty(s)){
printf("Stackisempty\n");
return-1;
}
intvalue=s->data[s->top];
s->top--;
returnvalue;
}

intpeek(Stack*s){
if(isEmpty(s)){
printf("Stackisempty\n");
return-1;
}
returns->data[s->top];
}

intmain(){
Stackstack;
initStack(&stack);

push(&stack,10);
push(&stack,20);
push(&stack,30);

printf("Topelement:%d\n",peek(&stack));

printf("Poppedelement:%d\n",pop(&stack));
printf("Poppedelement:%d\n",pop(&stack));
printf("Poppedelement:%d\n",pop(&stack));

printf("Isstackempty:%s\n",isEmpty(&stack)?"true":"false");

return0;
}