顺序栈实现

航仔咕噜咕噜

已于 2022-10-31 23:12:02 修改

阅读量77

点赞数

分类专栏：学习笔记文章标签： c语言 c++ 算法

于 2022-10-31 23:06:35 首次发布

本文链接：https://blog.csdn.net/m0_63763655/article/details/127625357

版权

学习笔记专栏收录该内容

5 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#include <stdlib.h>
#define ERROR 0
#define OK 1
#define STACK_INT_SIZE 10
#define STACKINCREMENT 5
typedef  int ElemType;
typedef struct
{
    ElemType *base;
    ElemType *top;
    int stacksize;
} SqStack;

int initStack(SqStack *s);
int emptyStack(SqStack *s);
int pushStack(SqStack *s, ElemType e);
int popStack(SqStack *s,ElemType *e);
//初始化栈
int initStack(SqStack *s)
{
s->base=(ElemType*)malloc(STACK_INT_SIZE*sizeof(ElemType));
if(!s->base)return ERROR;
s->top=s->base;
s->stacksize=STACK_INT_SIZE;
return OK;
}
//判断栈空
int emptyStack(SqStack *s)
{
if(s->base==s->top)
return 1;
else
return 0;
}
//入栈
int pushStack(SqStack *s, ElemType e)
{
if(s->top-s->base>=s->stacksize)
{
          s->base=(ElemType*)realloc(s->base,(s->stacksize+STACKINCREMENT)*sizeof(ElemType));
          if(!s->base)return ERROR;
          s->top=s->base+s->stacksize;
          s->stacksize+=STACKINCREMENT;
}
*s->top++=e;
return OK;
}

//出栈
int popStack(SqStack *s,ElemType *e)
{
if(s->top==s->base)return ERROR;
--s->top;
*e=*s->top;
return OK;
}
int main()
{
    SqStack s;
    ElemType e;
    if(initStack(&s))
    {
        //补充代码：实现读入数据入栈和出栈
    while(scanf("%d",&e)==1)
              pushStack(&s,e);
    while(emptyStack(&s)==0)
    {
          popStack(&s,&e);
          printf("%d ",e);
    }
    }
    return 0;
}