1.数据类型定义
在代码中为了清楚的表示一些错误和函数运行状态,我们预先定义一些变量来表示这些状态。在head.h头文件中有如下定义:
//定义数据结构中要用到的一些变量和类型
#ifndef HEAD_H
#define HEAD_H
#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2 //分配内存出错
typedef int Status; //函数返回值类型
typedef int ElemType; //用户定义的数据类型
#endif
- 1.
- 2.
- 3.
- 4.
- 5.
- 6.
- 7.
- 8.
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
- 15.
- 16.
- 17.
- 18.
- 19.
2.栈数据结构定义:
3.栈线性结构实现:
LinearStack.h中实现栈的代码如下:
#ifndef LINEAR_STACK
#define LINEAR_STACK
#include "head.h"
#define STACK_INIT_SIZE 100
#define STACK_INCREMENT 10
typedef struct Stack{
ElemType *base; //栈底
ElemType *top; //栈顶
int size; //栈大小
}Stack,*pStack;
//初始化栈
Status InitStack(pStack &S){
S=(pStack)malloc(sizeof(Stack));
ElemType* p=(ElemType*)malloc(STACK_INIT_SIZE*sizeof(ElemType));
if(!p) return OVERFLOW;
S->base=p;
S->top=p;
S->size=STACK_INIT_SIZE;
return OK;
}
Status freeStack(pStack &S){
free(S);
S=NULL;
return OK;
}
//销毁栈
Status DestroyStack(pStack &S){
free(S->base);
S->base=NULL;
S->top=NULL;
freeStack(S);
return OK;
}
//清空栈
Status ClearStack(pStack &S){
S->top=S->base;
return OK;
}
//栈是否为空
Status StaciEmpty(pStack S){
return S->top==S->base;
}
//栈长度
int StackLength(pStack S){
return S->top-S->base;
}
//得到栈顶数据级e
Status GetTop(pStack S,ElemType &e){
e=*(S->top-1);
return OK;
}
//入栈
Status Push(pStack &S,ElemType e){
if(StackLength(S)>=S->size)
S->base=(ElemType*)realloc(S->base,(S->size+STACK_INCREMENT)*sizeof(ElemType));
if(!S->base) return OVERFLOW;
S->top=S->base+StackLength(S);
S->size+=STACK_INCREMENT;
*S->top++=e;
return OK;
}
//出栈
Status Pop(pStack &S,ElemType &e){
if(StackLength(S)<1) return ERROR;
e=*--S->top;
return OK;
}
Status print(ElemType e){
printf("%d\n",e);
return OK;
}
//用vistit遍历栈
Status StackTraverse(pStack S,Status(*visit)(ElemType)){
while (S->top>S->base)
(*visit)(*--S->top);
return OK;
}
Status printStack(pStack S){
StackTraverse(S,print);
return OK;
}
#endif
- 1.
- 2.
- 3.
- 4.
- 5.
- 6.
- 7.
- 8.
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
- 15.
- 16.
- 17.
- 18.
- 19.
- 20.
- 21.
- 22.
- 23.
- 24.
- 25.
- 26.
- 27.
- 28.
- 29.
- 30.
- 31.
- 32.
- 33.
- 34.
- 35.
- 36.
- 37.
- 38.
- 39.
- 40.
- 41.
- 42.
- 43.
- 44.
- 45.
- 46.
- 47.
- 48.
- 49.
- 50.
- 51.
- 52.
- 53.
- 54.
- 55.
- 56.
- 57.
- 58.
- 59.
- 60.
- 61.
- 62.
- 63.
- 64.
- 65.
- 66.
- 67.
- 68.
- 69.
- 70.
- 71.
- 72.
- 73.
- 74.
- 75.
- 76.
- 77.
- 78.
- 79.
- 80.
- 81.
- 82.
- 83.
- 84.
- 85.
- 86.
- 87.
- 88.
- 89.
- 90.
- 91.
4.测试
5.测试结果