栈的基本操作
头文件 (demo.h)
#include<iostream>
#include<string.h>
#include<stdlib.h>
#include<malloc.h>
using namespace std;
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
typedef int ElemType;
typedef int Status;
源文件 (main.cppp)
#include "demo.h"
typedef struct
{
ElemType *base; //栈底指针
ElemType *top; //栈顶指针
int stacksize; //当前已经分配的存储空间,以元素为单位
}SqStack;
//构造一个空栈
Status InitStack(SqStack &S)
{
S.base = (ElemType*)malloc(STACK_INIT_SIZE*sizeof(ElemType)); //申请栈的空间
if (!S.base)
exit(OVERFLOW);//存储分配失败
S.top = S.base; //栈的头尾指针指向同一个内存空间
S.stacksize = STACK_INIT_SIZE;
return OK;
}
//销毁栈
Status DestroyStack(SqStack &S)
{
S.top = NULL; //让栈顶的指针指向空
S.stacksize = 0; //分配的存储空间为0
free(S.base); //释放申请栈的空间
return OK;
}
//清空栈
Status ClearStack(SqStack &S)
{
S.top = S.base;
return OK;
}
//判断栈是否为空
Status StackEmpty(SqStack S)
{
if (S.top == S.base)
return ERROR;
else
return TRUE;
}
//求栈的长度
Status StackLength(SqStack S)
{
if (S.top == S.base)
return FALSE;
else
return (S.top - S.base);//也可以直接返回S.top - S.base
}
//求栈顶的元素
Status GetTop(SqStack S, ElemType &e)
{
if (S.top == S.base)
return FALSE;
else
e = *(S.top - 1);
return e;
}
//栈顶插入元素
Status Push(SqStack &S, ElemType &e)
{
if (S.top - S.base >= STACK_INIT_SIZE)
{
S.base = (ElemType *)realloc(S.base, (S.stacksize + STACKINCREMENT) * sizeof(ElemType));
if (!S.base)
{
return false;
}
S.top = S.base + STACK_INIT_SIZE;//栈底地址可能改变,重新定位栈顶元素
S.stacksize = S.stacksize + STACKINCREMENT;
}
*S.top = e;
S.top++;
return OK;
}
//删除栈顶元素
Status Pop(SqStack &S, ElemType &e)
{
if (S.top == S.base)
return ERROR;
else
{
S.top--;
e = *S.top;//说明:此处容易使人迷惑,实际上此元素并没真正删除,仍在S.top中,但是如果插入元素,就会被更新,就像是删除了一样
return e;
}
}
//遍历栈
Status StackTraverse(SqStack S)
{
if (S.base == NULL)
return ERROR;
if (S.top == S.base)
cout << "栈中没有元素" << endl;
ElemType *p;
p = S.top;
while (p > S.base)
{
p--;
cout << *p << " ";
}
return OK;
}
int main()
{
SqStack S;
cout << "构造一个空栈……" << endl;
InitStack(S);
int i,n ;
cout << "输入栈的长度:" << endl;
cin >> n;
for (i = 1; i <= n; i++)
{
cout << "输入栈的第" << i << "个元素" << endl;
++S.top; //让栈顶的指针上移动一位
cin >> *(S.top-1); //对栈顶指向的下一位进行赋值
}
/*
cout << "……本栈是空栈吗??……" << endl;
if (StackEmpty(S) == 1)
cout << "NO !!!" << endl;
else
cout << "YES !!!" << endl;
cout << "……求出栈的长度……" << endl;
int m;
m = StackLength(S);
cout << "栈的长度是:" << endl;
cout << m << endl;
cout << "遍历输出栈中的所有元素:" << endl;
StackTraverse(S);
cout << endl;
cout << "……输出栈顶元素……" << endl;
int e;
e = GetTop(S, e);
cout << "栈顶元素是:" << endl;
cout << e << endl;
cout << "……栈顶插入元素……" << endl;
cout << "请输入要插入的元素的数值:" << endl;
cin >> e;
Push(S,e);
cout << "现在栈中的元素是:" << endl;
StackTraverse(S);
cout << endl;
cout << "……栈顶删除元素……" << endl;
e = Pop(S,e);
cout << "被删除的元素是:" << endl;
cout << e << endl;
cout << "现在栈中的元素是:" << endl;
StackTraverse(S);
cout << endl;
cout << "……清空栈……" << endl;
ClearStack(S);
cout << "现在栈中的元素是:" << endl;
StackTraverse(S);
cout << "……销毁栈……" << endl;
if(DestroyStack(S)==1)
cout << "销毁栈成功" << endl;
else
cout << "销毁栈失败" << endl;
cout << "恭喜您成功完成所有的功能" << endl;
return 0;
*/
}