//Description 创建一个空的顺序栈，并实现栈的入栈、出栈、返回栈的长度、返回栈顶元素、栈的遍历等基本算法。请将下面的程序补充完整。
#include <malloc.h>
#include <stdio.h>
#define OK 1
#define ERROR 0
#define STACK_INIT_SIZE 100 // 存储空间初始分配量
#define STACKINCREMENT 10 // 存储空间分配增量
typedef int SElemType; // 定义栈元素类型
typedef int Status; // Status是函数的类型,其值是函数结果状态代码，如OK等
struct SqStack
{
SElemType *base; // 在栈构造之前和销毁之后，base的值为NULL //*base 会不会相当于一个底指针
SElemType *top; // 栈顶指针
int stacksize; // 当前已分配的存储空间，以元素为单位
}; // 顺序栈
Status InitStack(SqStack &S)
{
// 构造一个空栈S，该栈预定义大小为STACK_INIT_SIZE
// 请补全代码
S.base = new SElemType[STACK_INIT_SIZE]; //分配内存 S.base指针指着内存第一个地址 新内容 ， 最好不要用malloc，那个是链表用的
if (S.base == NULL)
return ERROR;
S.top = S.base; //让S.top指针也指着第一个
S.stacksize = STACK_INIT_SIZE;
return OK;
}
Status Push(SqStack &S, SElemType e)
{
// 在栈S中插入元素e为新的栈顶元素
// 请补全代码
if (S.stacksize <= S.top - S.base) //因为是顺序表地址是连续，头尾地址相减就可以判断
{
S.base = (SElemType *)realloc(S.base, sizeof(SElemType) * (STACKINCREMENT + STACK_INIT_SIZE)); //加空间,顺序表内存地址会改变 S,top指针要修改
if (S.base == NULL)
return ERROR;
else
{ S.top = S.base + S.stacksize;
//S.top =S.base + S.stacksize 以S.base为首地址 偏移 S.stacksize, 这时S.top指向新栈顶
S.top++; //压入top的后一个 *S.top++ = e 等价于 S.top++； *S.top=e;
*S.top = e;
return OK;
}
}
else
{
S.top++; //压入top的后一个 *S.top++ = e 等价于 S.top++； *S.top=e;
*S.top = e;
return OK;
}
}
Status Pop(SqStack &S, SElemType &e) //顺序表不用free 因为他们是连续内存不能free
{
// 若栈不空，则删除S的栈顶元素，用e返回其值，并返回OK；否则返回ERROR
// 请补全代码
if (S.base == S.top)
return ERROR;
e = *S.top; //接收出栈的值
S.top=S.top-1; //top指针向头方向移动1个单位
return OK;
}
Status GetTop(SqStack S, SElemType &e)
{
// 若栈不空，则用e返回S的栈顶元素，并返回OK；否则返回ERROR
// 请补全代码
if (S.base == S.top)
return ERROR;
e = *S.top;
return OK;
}
int StackLength(SqStack S)
{
// 返回栈S的元素个数
// 请补全代码
return (S.top - S.base);
}
Status StackTraverse(SqStack S)
{
// 从栈顶到栈底依次输出栈中的每个元素
SElemType *p = (SElemType *)malloc(sizeof(SElemType));
p = S.top; //请填空
if (S.top == S.base)
printf("The Stack is Empty!"); //请填空
else
{
printf("The Stack is: ");
//p--;
while (p != S.base) //请填空 //这里我屏蔽了那个p--想不出来那个为什么要这样做？
{
printf("%d ", *p);
p--; //请填空
}
}
printf("\n");
return OK;
}
int main()
{
int a;
SqStack S;
SElemType x, e;
if (InitStack(S) == OK) // 判断顺序表是否创建成功，请填空
{
printf("A Stack Has Created.\n");
}
while (1)
{
printf("1:Push \n2:Pop \n3:Get the Top \n4:Return the Length of the Stack\n5:Load the Stack\n0:Exit\nPlease choose:\n");
scanf("%d", &a);
switch (a)
{
case 1:
scanf("%d", &x);
if (Push(S, x)==ERROR)
printf("Push Error!\n"); // 判断Push是否合法，请填空
else
printf("The Element %d is Successfully Pushed!\n", x);
break;
case 2:
if (Pop(S, e)==ERROR)
printf("Pop Error!\n"); // 判断Pop是否合法，请填空
else
printf("The Element %d is Successfully Poped!\n", e);
break;
case 3:
if (GetTop(S, e)==ERROR)
printf("Get Top Error!\n"); // 判断Get Top是否合法，请填空
else
printf("The Top Element is %d!\n", e);
break;
case 4:
printf("The Length of the Stack is %d!\n", StackLength(S)); //请填空
break;
case 5:
StackTraverse(S); //请填空
break;
case 0:
return 1;
}
}
}
/*
输入格式
测试样例格式说明：
根据菜单操作：
1、输入1，表示要实现Push操作，紧跟着输入要Push的元素
2、输入2，表示要实现Pop操作
3、输入3，返回栈顶元素
4、输入4，返回栈的元素个数
5、输入5，表示从栈顶到栈底输出栈的所有元素
6、输入0，表示程序结束
输入样例
1
2
1
4
1
6
5
3
4
2
5
2
2
2
0
输出样例
A Stack Has Created.
1:Push
2:Pop
3:Get the Top
4:Return the Length of the Stack
5:Load the Stack
0:Exit
Please choose:
The Element 2 is Successfully Pushed!
1:Push
2:Pop
3:Get the Top
4:Return the Length of the Stack
5:Load the Stack
0:Exit
Please choose:
The Element 4 is Successfully Pushed!
1:Push
2:Pop
3:Get the Top
4:Return the Length of the Stack
5:Load the Stack
0:Exit
Please choose:
The Element 6 is Successfully Pushed!
1:Push
2:Pop
3:Get the Top
4:Return the Length of the Stack
5:Load the Stack
0:Exit
Please choose:
The Stack is: 6 4 2
1:Push
2:Pop
3:Get the Top
4:Return the Length of the Stack
5:Load the Stack
0:Exit
Please choose:
The Top Element is 6!
1:Push
2:Pop
3:Get the Top
4:Return the Length of the Stack
5:Load the Stack
0:Exit
Please choose:
The Length of the Stack is 3!
1:Push
2:Pop
3:Get the Top
4:Return the Length of the Stack
5:Load the Stack
0:Exit
Please choose:
The Element 6 is Successfully Poped!
1:Push
2:Pop
3:Get the Top
4:Return the Length of the Stack
5:Load the Stack
0:Exit
Please choose:
The Stack is: 4 2
1:Push
2:Pop
3:Get the Top
4:Return the Length of the Stack
5:Load the Stack
0:Exit
Please choose:
The Element 4 is Successfully Poped!
1:Push
2:Pop
3:Get the Top
4:Return the Length of the Stack
5:Load the Stack
0:Exit
Please choose:
The Element 2 is Successfully Poped!
1:Push
2:Pop
3:Get the Top
4:Return the Length of the Stack
5:Load the Stack
0:Exit
Please choose:
Pop Error!
1:Push
2:Pop
3:Get the Top
4:Return the Length of the Stack
5:Load the Stack
0:Exit
Please choose:
*/
1411
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
