栈的实现
一、栈的定义
栈(stack):是限定仅在表位进行插入或者删除操作的线性表。即先进后出
表尾端成为栈顶(top)
表头端称为栈底(bottom)
二、栈的顺序存储结构
stacksize 用于指示栈大小
三、栈顶指针指向
非空栈中栈顶指针始终指向栈顶元素的下一个位置
四、栈的操作定义
//1、创建栈并初始化栈
void InitStack(pSqStack S);
//2、销毁栈S
void DestroyStack(pSqStack S);
//3、把S置为空栈
void ClearStack(pSqStack S);
//4、若栈S为空栈,则返回true,否则返回false
bool StackEmpty(pSqStack S);
//5、返回S的元素个数,即栈的长度
int StackLength(pSqStack S);
//6、获取栈顶元素
bool GetTop(pSqStack S, SElemType &e);
//7、压栈
void Push(pSqStack S, SElemType e);
//8、出栈
bool Pop(pSqStack S, SElemType &e);
//9、栈遍历
void StackTraverse(pSqStack S);
五、栈的操作实现
1、创建栈并初始化栈
void InitStack(pSqstack S)
{ // 构造一个空栈S
S->bottom = (SElemType *)malloc(STACK_INIT_SIZE * sizeof(SElemType));
if (S->bottom == NULL)// 存储分配失败
{
exit(-1);
}
S->top = S->bottom;
S->stacksize = STACK_INIT_SIZE;
}
2、销毁栈
void DestroyStack(pSqStack S)
{ // 销毁栈S,S不再存在
free(S->bottom);
S->bottom = NULL;
S->top = NULL;
S->stacksize = 0;
}
3、把S置为空栈
void ClearStack(pSqStack S)
{
S->top = S->bottom;
}
4、判断栈是否为空
//4、若栈S为空栈,则返回true,否则返回false
bool StackEmpty(pSqStack S)
{
if (S->top == S->bottom)
return true;
else
return false;
}
5、返回S的元素个数,即栈的长度
int StackLength(pSqStack S)
{
return S->top - S->bottom;
}
6、获取栈顶元素
bool GetTop(pSqStack S, SElemType &e)
{ // 若栈不空,则用e返回S的栈顶元素,并返回true;否则返回false
if (S->top > S->bottom)
{
e = *(S->top - 1);
return true;
}
else
return false;
}
7、压栈
void Push(pSqStack S, SElemType e)
{ // 插入元素e为新的栈顶元素
if (S->top - S->bottom >= S->stacksize) // 栈满,追加存储空间
{
S->bottom = (SElemType *)realloc(S->bottom, (S->stacksize + STACK_INCREMENT) * sizeof(SElemType));//扩充栈
if (S->bottom == NULL)
exit(-1); // 存储分配失败
S->top = S->bottom + S->stacksize;//栈顶指针为 新地址的首地址+原栈大小
S->stacksize += STACK_INCREMENT;//扩充后栈的大小
}
*(S->top)++ = e;//将数据e压入栈,栈顶指针加1 等价于*(S->top)= e;S->top=S->top+1;
}
8、出栈
bool Pop(pSqStack S, SElemType &e)
{ // 若栈不空,则删除S的栈顶元素,用e返回其值,并返回OK;否则返回ERROR
if (S->top == S->bottom)//栈为空
return false;
e = *--S->top;//栈不为空返回栈顶元素,将栈顶数据赋值给e出栈,栈顶指针减1 等价于S->top=S->top-1,e = *(S->top);
return true;
}
9、栈遍历
void StackTraverse(pSqStack S)
{ // 从栈底到栈顶依次遍历栈中每个元素
SElemType * p= S->bottom;
while (S->top > p)
{
printf(" %d",*p);
p++;
}
printf("\n");
}
最后给出完整代码
// 栈.cpp
//
#include <stdio.h>
#include<stdlib.h>
#include<malloc.h>
#define STACK_INIT_SIZE 10//存储空间初始分配量
#define STACK_INCREMENT 2//存储空间分配增量
typedef int SElemType;
typedef struct SqStack{//顺序栈
SElemType *bottom;//在栈构造之前和销毁之后,bottom的值为NULL
SElemType *top;//栈顶指针
int stacksize;//当前已分配的存储空间,以SElemtype大小为单位
}SqStack,*pSqStack;
//1、创建栈并初始化栈
void InitStack(pSqStack S);
//2、销毁栈S
void DestroyStack(pSqStack S);
//3、把S置为空栈
void ClearStack(pSqStack S);
//4、若栈S为空栈,则返回true,否则返回false
bool StackEmpty(pSqStack S);
//5、返回S的元素个数,即栈的长度
int StackLength(pSqStack S);
//6、获取栈顶元素
bool GetTop(pSqStack S, SElemType &e);
//7、压栈
void Push(pSqStack S, SElemType e);
//8、出栈
bool Pop(pSqStack S, SElemType &e);
//9、栈遍历
void StackTraverse(pSqStack S);
int main()
{
SqStack S ;
InitStack(&S);
printf("S.bottom = %p\n S.top = %p\n S.stacksize = %d\n",S.bottom,S.top,S.stacksize);
DestroyStack(&S);
printf("S.bottom = %p\n S.top = %p\n S.stacksize = %d\n", S.bottom, S.top, S.stacksize);
InitStack(&S);
if (StackEmpty(&S))
{
printf("栈为空栈\n");
}
else
{
printf("栈不为空栈\n");
}
for (int i = 0; i < 10; i++)
{
Push(&S, 2 * i);
}
printf("栈内的元素有:\n");
StackTraverse(&S);
SElemType e;
printf("栈的大小为%d\n", StackLength(&S));
int Length = StackLength(&S);
for (int j = 0; j < Length; j++)
{
Pop(&S, e);
printf("出栈第 %d 个元素值为 %d \n",j+1, e);
}
printf("栈的大小为%d\n", StackLength(&S));
return 0;
}
//1、创建栈并初始化栈
void InitStack(pSqStack S)
{ // 构造一个空栈S
S->bottom = (SElemType *)malloc(STACK_INIT_SIZE * sizeof(SElemType));
if (S->bottom == NULL)// 存储分配失败
{
exit(-1);
}
S->top = S->bottom;
S->stacksize = STACK_INIT_SIZE;
}
//2、销毁栈S
void DestroyStack(pSqStack S)
{ // 销毁栈S,S不再存在
free(S->bottom);
S->bottom = NULL;
S->top = NULL;
S->stacksize = 0;
}
//3、把S置为空栈
void ClearStack(pSqStack S)
{
S->top = S->bottom;
}
//4、若栈S为空栈,则返回true,否则返回false
bool StackEmpty(pSqStack S)
{
if (S->top == S->bottom)
return true;
else
return false;
}
//5、返回S的元素个数,即栈的长度
int StackLength(pSqStack S)
{
return S->top - S->bottom;
}
//6、获取栈顶元素
bool GetTop(pSqStack S, SElemType &e)
{ // 若栈不空,则用e返回S的栈顶元素,并返回true;否则返回false
if (S->top > S->bottom)
{
e = *(S->top - 1);
return true;
}
else
return false;
}
//7、压栈
void Push(pSqStack S, SElemType e)
{ // 插入元素e为新的栈顶元素
if (S->top - S->bottom >= S->stacksize) // 栈满,追加存储空间
{
S->bottom = (SElemType *)realloc(S->bottom, (S->stacksize + STACK_INCREMENT) * sizeof(SElemType));//扩充栈
if (S->bottom == NULL)
exit(-1); // 存储分配失败
S->top = S->bottom + S->stacksize;//栈顶指针为 新地址的首地址+原栈大小
S->stacksize += STACK_INCREMENT;//扩充后栈的大小
}
*(S->top)++ = e;//将数据e压入栈,栈顶指针加1 等价于*(S->top)= e;S->top=S->top+1;
}
//8、出栈
bool Pop(pSqStack S, SElemType &e)
{ // 若栈不空,则删除S的栈顶元素,用e返回其值,并返回OK;否则返回ERROR
if (S->top == S->bottom)//栈为空
return false;
e = *--S->top;//栈不为空返回栈顶元素,将栈顶数据赋值给e出栈,栈顶指针减1 等价于S->top=S->top-1,e = *(S->top);
return true;
}
//9、栈遍历
void StackTraverse(pSqStack S)
{ // 从栈底到栈顶依次遍历栈中每个元素
SElemType * p= S->bottom;
while (S->top > p)
{
printf(" %d",*p);
p++;
}
printf("\n");
}