内容:数据结构第三章:栈的实现
参考书:数据结构严书,高一凡数据结构与算法
测试软件:Visual Studio 2017
c1.h:
#ifndef __C1_H
//#define __C1_H
//c1.h(头文件名)
#include <string.h> //字符串函数头文件
#include <ctype.h> //字符函数头文件
#include <malloc.h> //malloc()等
#include <limits.h> //INT_MAX等
#include <stdio.h> //标准输入输出头文件,包括EOF( = ^Z 或F6),NULL等
#include <stdlib.h> //atoi(), exit()
#include <io.h> //eof()
#include <math.h> //数学函数头文件,包括floor(), ceil(), abs()等
#include <sys/timeb.h> //ftime()
#include <stdarg.h> //提供宏va_start, va_arg, va_end,用于存取变长参数表
//函数结果状态代码。在严书第十页
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
//#define INFESIBLE -1
//#define OVERFLOW -2 因为在math.h中已定义OVERFLOW的值为3,故去掉此行
typedef int Status; //Status是函数的;类型其值是函数结果状态代码,如OK等
typedef int Boolean; //Boolean是布尔类型,其值是TRUE或FALSE,第7、8、9章用到
typedef int SElemType;
typedef SElemType ElemType;
#endif // !__C1_H
#pragma once
c3-1.h:
#ifndef C3-1_H
//#define C3-1_H
#include "c1.h"
#define STACK_INIT_SIZE 10
#define STACK_INCREMENT 2
#endif // !C#-1_H
//#pragma once
sunc2-2.h:
#ifndef FUNC2-2_H
//#define FUNC2-2_H
#include "c1.h"
Status equal(ElemType c1, ElemType c2) //判断是否相等
{
if (c1 == c2)
return TRUE;
else
return FALSE;
}
int comp(ElemType a, ElemType b)
{
if (a == b)
return 0;
else
return (a-b)/abs(a-b); //如1-2 / |1-2| = -1
}
void print(ElemType c)
{
printf(" %d ", c);
}
void print1(ElemType &c)
{
printf(" %d ", c);
}
void print2(ElemType c)
{
printf(" %c ", c);
}
#endif // !FUNC2-2_H
#pragma once
bo3-1.h:
#ifndef BO3-1_H
#include "c1.h"
#include "c3-1.h"
#include "func2-2.h"
void InitStack(SqStack &s)
{ //构造一个空栈
s.base = (SElemType *)malloc(sizeof(SElemType) * STACK_INIT_SIZE);
if (!s.base)
exit(OVERFLOW);
s.top = s.base; //栈顶指针指向栈底
s.stacksize = STACK_INIT_SIZE; //初始分配空间量
}
void DestroyStack(SqStack &s)
{
free(s.base);
s.top = s.base = NULL;
s.stacksize = 0;
}
void ClearStack(SqStack &s)
{
s.top = s.base;
}
int StackLength(SqStack s)
{
return s.top - s.base;
}
void Push(SqStack &s, SElemType e)
{ //在栈顶插入元素e
if (s.top - s.base == s.stacksize) //栈满
{
s.base = (SElemType *)realloc(s.base, (s.stacksize + STACK_INCREMENT) * sizeof(SElemType));
if (!s.base)
exit(OVERFLOW);
s.top = s.base + s.stacksize; //栈顶指针指向新的栈顶
s.stacksize += STACK_INCREMENT;
}
*(s.top)++ = e; //e入栈
}
void StackTraverse(SqStack s, void (*visit)(SElemType))
{
SElemType * p = s.base;
while (s.top > p)
visit(*p++);
printf("\n");
}
Status Pop(SqStack &s, SElemType &e)
{
if (s.top == s.base)
return ERROR;
e = * --s.top;
return OK;
}
Status StackEmpty(SqStack s)
{
if (s.base == s.top)
return TRUE;
else
return FALSE;
}
Status GetTop(SqStack s, SElemType &e)
{
if (s.top > s.base)
{
e = *(s.top-1);
return OK;
}
else
return ERROR;
}
#endif // !BO3-1_H
#pragma once
main3-1.cpp:
#include "c1.h"
struct SqStack
{
SElemType * base;
SElemType * top;
int stacksize;
};
#include "c3-1.h"
#include "bo3-1.h"
#include "func2-2.h"
int main(void)
{
int j;
SqStack s;
SElemType e;
InitStack(s); //初始化栈
for (j = 1; j <= 12; j++)
Push(s, j);
printf("栈中元素依次为:");
StackTraverse(s, print);
Pop(s, e);
printf("弹出的栈顶元素e = %d\n", e);
printf("栈空否?%d(1:空 0:否),", StackEmpty(s));
GetTop(s, e);
printf("栈顶元素e = %d, 栈的长度为%d\n", e, StackEmpty(s));
ClearStack(s);
printf("清空栈后,栈空否?%d(1:空 0:否),", StackEmpty(s));
DestroyStack(s);
printf("清空栈后,s.top = %u,s.base = %u,s.stacksize = %d\n", s.top, s.base, s.stacksize);
return 0;
}
**总结:**把结构体定义放在c3-1.h中会报错,emmmmm…