顺序栈以及两栈共享空间（C语言版）

最新推荐文章于 2023-09-11 06:45:00 发布

weixin_41778615

最新推荐文章于 2023-09-11 06:45:00 发布

阅读量283

点赞数

CC 4.0 BY-SA版权

文章标签：顺序栈以及两栈共享空间数据结构 C语言

本文链接：https://blog.youkuaiyun.com/weixin_41778615/article/details/89362194

本文详细介绍了两种栈的实现方式：顺序栈和双栈共享空间。顺序栈使用固定大小的数组存储元素，提供了初始化、压栈、弹栈和打印栈的操作。双栈共享空间则在同一数组中同时维护两个栈，通过不同的顶部指针实现，避免了空间浪费，同样支持基本的栈操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

/*01 顺序栈的存储结构*/

Sqstack.h

#define OK 1

#define ERROR 0

#define MAXSIZE 100

typedef int ElemType;

typedef int Status;

typedef struct

{

ElemType data[MAXSIZE];

int top;

}Sqstack;

Status InitStack(Sqstack *S);/*初始化顺序栈*/

Status Push(Sqstack *S, ElemType e);/*压栈*/

Status Pop(Sqstack *S, ElemType *e);/*弹栈*/

void PrintStack(Sqstack s);/*打印栈中元素*/

Sqstack.c

Status InitStack(Sqstack *S)

{

S->top = -1;

return OK;

}

Status Push(Sqstack *S, ElemType e)

{

if(S->top == MAXSIZE-1)

{

return ERROR;

}

S->top++;

S->data[S->top] = e;

return OK;

}

Status Pop(Sqstack *S, ElemType *e)

{

if(S->top == -1)

{

return ERROR;

}

*e = S->data[S->top];

S->top--;

return OK;

}

void PrintStack(Sqstack s)

{

while(s->top != -1)

{

printf("%d ", s->data[s->top]);

s->top--;

}

printf("\n");

}

/*02 两栈共享空间存储结构*/

SqDoubleStack.h

#define OK 1

#define ERROR 0

#define MAXSIZE 100

typedef int ElemType;

typedef int Status;

typedef struct

{

ElemType data[MAXSIZE ];

int top1;

int top2;

}SqDoubleStack;

SqDoubleStack.c

Status InitStack(SqDoubleStack *S)

{

S->top1 = -1;

S->top2 = MAXSIZE ;

return OK;

}

Status Push(SqDoubleStack *S, ElemType e, int stackNumber)

{

if(S->top1 + 1 == S->top2)

{

return ERROR;

}

if(1 == stackNumber)

{

S->top1++;

S->data[S->top1] = e;

}

else if(2 == stackNumber)

{

S->top2--;

S->data[S->top2] = e;

}

else;

return OK;

}

Status Pop(SqDoubleStack *S, ElemType *e, int stackNumber)

{

if(1 == stackNumber )

{

if(S->top1 == -1)

{

return ERROR;

}

else

{

*e = S->data[S->top1];

S->top1--;

}

else if(2 == stackNumber )

{

if(S->top2 == MAXSIZE )

{

return ERROR;

}

else

{

*e = S->data[S->top2];

S->top2++;

}

else;

}

void PrintStack(SqDoubleStack s, int stackNumber)

{

if(stackNumber == 1)

{

while(s.top1 != -1)

{

printf("%d ", s.data[s.top1]);

s.top1--;

}

printf("\n");

}

else if(stackNumber == 2)

{

while(s.top2 != MAXSIZE)

{

printf("%d ", s.data[s.top2]);

s.top2++;

}

printf("\n");

}

else;

}