当前位置：网站首页>Stacks and queues a

Stacks and queues a

2022-04-23 12:15:00 【Yuerya.】

One . Stack

1. Definition (top A subscript pointing to the last element )

#define Max 100
Typedef struct stack{
SElemType data[Max]       // or *data;
int top;
int stackSize;
}sqStack;

2. initialization 

int InitSqStack(sqStack *LS,int max){
LS->data=(SElemType*)malloc(max*(SElemType));
if(LS->data==NULL) { printf(" Application failed \n"); exit(0); }
LS->top=-1;
LS->stackSize=max;
return 1;
}

3. The judgment is empty 

int EmptyStack(sqStack S){
if(S.top==-1) return 1;
else return 0;
}

4. Get the top of the stack 

int GetTopSqStack(sqStack S,SElemType *e){
if(S.top==-1) return 0;
*e=S.data[S.top];
return 1;
}

5. Find the length 

int lengthsqStack(sqStack S){
if(S.top==-1) return 0;
return S.top+1;
}

6. Into the stack 

int PushsqStack(sqStack *S,SElemType e){
if(S->top+1==S->stackSize)   // If the stack is full

版权声明
本文为[Yuerya.]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/04/202204231212025744.html

边栏推荐

猜你喜欢

随机推荐