mirror of
https://github.com/ViolentAyang/DataStructureC.git
synced 2026-02-03 02:13:14 +08:00
Create 顺序栈的共享栈初始化.c
This commit is contained in:
31
栈/顺序栈的共享栈初始化.c
Normal file
31
栈/顺序栈的共享栈初始化.c
Normal file
@@ -0,0 +1,31 @@
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdbool.h>
|
||||
#define MaxSize 10
|
||||
|
||||
typedef struct{
|
||||
int data[MaxSize]; //静态数组存放栈中元素
|
||||
int top0; //0号栈栈顶指针
|
||||
int top1; //1号栈栈顶指针
|
||||
}ShStack;
|
||||
|
||||
//初始化栈
|
||||
void InitStack(ShStack *S){
|
||||
S->top0 = -1;
|
||||
S->top1 = MaxSize;
|
||||
}
|
||||
//栈满
|
||||
bool fillStack(ShStack S){
|
||||
if(S.top0+1==S.top1){
|
||||
return true;
|
||||
}else{
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
int main(){
|
||||
ShStack S;
|
||||
InitStack(&S);
|
||||
printf("%d",fillStack(S));
|
||||
return 0;
|
||||
}
|
||||
Reference in New Issue
Block a user