mirror of
https://github.com/ViolentAyang/DataStructureC.git
synced 2026-02-02 18:10:59 +08:00
Create 进栈操作.c
This commit is contained in:
39
栈/进栈操作.c
Normal file
39
栈/进栈操作.c
Normal file
@@ -0,0 +1,39 @@
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdbool.h>
|
||||
#define MaxSize 10
|
||||
|
||||
typedef struct{
|
||||
int data[MaxSize]; //静态数组存放栈中元素
|
||||
int top; //栈顶指针
|
||||
}SqStack;
|
||||
|
||||
//初始化栈
|
||||
void InitStack(SqStack *S){
|
||||
S->top = -1;
|
||||
}
|
||||
//新元素进栈
|
||||
bool Push(SqStack *S,int x){
|
||||
if(S->top==MaxSize-1){
|
||||
return false;
|
||||
}
|
||||
S->top += 1;
|
||||
S->data[S->top] = x;
|
||||
return true;
|
||||
}
|
||||
//打印
|
||||
void PrintStack(SqStack S){
|
||||
if(S.top==-1){
|
||||
printf("栈为空!");
|
||||
}
|
||||
for(int i=0;i<=S.top;i++){
|
||||
printf("%d\n",S.data[i]);
|
||||
}
|
||||
}
|
||||
int main(){
|
||||
SqStack S;
|
||||
InitStack(&S);
|
||||
Push(&S,5);
|
||||
PrintStack(S);
|
||||
return 0;
|
||||
}
|
||||
Reference in New Issue
Block a user