1.1.编写一个程序,实现顺序栈的各种基本运算,并在此基础上设计一个主程序完成如下功能:
(1)初始化栈s;
(2)判断栈s是否为空;
(3)依次进栈元素-1,2,10,-3,5;
(4)判断栈s是否为空;
(5)输出栈长度;
(6)输出从栈顶到栈底的元素;
(7)输出出栈序列;
(1)初始化栈s;
(2)判断栈s是否为空;
(3)依次进栈元素-1,2,10,-3,5;
(4)判断栈s是否为空;
(5)输出栈长度;
(6)输出从栈顶到栈底的元素;
(7)输出出栈序列;
(8)判断栈s是否为空。
我的代码如下:
#include "c1.h"
#define MaxSize 100
typedef int ElemType;
typedef struct
{
ElemType data[MaxSize];
int top;
} Stack;
Status InitStack(Stack *&s) //初始化栈
{
s = (Stack *)malloc(sizeof(Stack));
s->top = -1;
return OK;
}
Status LengthStack(Stack *s)
{
return(s->top);
}
Status StackEmpty(Stack *s) //判断空栈
{
if (s->top == -1)return 1;
else return 0;
}
Status Push(Stack *&s, ElemType e) //入栈
{
if (s->top == MaxSize - 1)
return ERROR;
s->top++;
s->data[s->top] = e;
return OK;
}
Status StackTraverse(Stack s, Status(*visit)(ElemType)) //遍历栈
{
while (s.top != -1){
visit(s.data[s.top]);
s.top--;
}
return OK;
}
Status Visit(ElemType e){ //访问元素
printf("%d ", e);
return OK;
}
Status Pop(Stack *&s, ElemType &e) //出栈
{
if (s->top == -1)
return ERROR;
e = s->data[s->top];
s->top--;
return OK;
}
void main()
{
Stack *s;
int r, i;
int e;
InitStack(s);
printf("初始化成功!\n\n");
r = StackEmpty(s);
if (r == 1)
printf("此顺序栈为空栈\n\n");
else
printf("此顺序栈不为空栈\n\n");
Push(s, -1);
Push(s, 2);
Push(s, 10);
Push(s, -3);
Push(s, 5);
printf("-1,2,10,-3,5顺序进栈成功!\n\n");
r = StackEmpty(s);
if (r == 1)
printf("此顺序栈为空栈\n\n");
else
printf("此顺序栈不为空栈\n\n");
r = LengthStack(s);
r++;
printf("此顺序栈的长度为%d\n\n", r);
printf("从栈顶到栈底的元素顺序为:");
StackTraverse(*s,Visit);
printf("\n\n");
printf("出栈顺序为:");
for (i = 0; i <= r; i++)
{
Pop(s, e);
printf("%d ", e);
}
printf("\n\n");
r = StackEmpty(s);
if (r == 1)
printf("此顺序栈为空栈\n\n");
else
printf("此顺序栈不为空栈\n\n");
}
2.编写一个程序,实现链栈的各种基本运算,并在此基础上设计一个主程序完成如下功能:
(1)初始化栈s;
(2)判断栈s是否为空;
(3)依次进栈元素10,-2,10,-3,15,12;
(4)判断栈s是否为空&#x