数据结构C语言实现顺序栈模板

C语言顺序栈模板

#include <stdio.h>
#include <stdlib.h>
/************************************************
 * C语言顺序栈模板
 * 
 * 1.InitStack() 初始化顺序栈:动态分配一块内存将栈顶
 * 指针和栈顶指针都指向该内存.
 * 
 * 2.DestoryStack(Stack *stack) 销毁顺序栈:释放动态
 * 分配的内存并将栈顶指针和栈顶指针指向空.
 * 
 * 3.StackIsEmpty(Stack *stack) 判断顺序栈是否为空:
 * 为空返回TREU不为空返回FALSE.
 * 
 * 4.GetTop(Stack *stack) 获取栈顶元素:获取栈顶指针
 * 指向的元素.
 * 
 * 5.PushStack(Stack *stack, ElemType elem) 入栈.
 * 
 * 6.PopStack(Stack *stack) 出栈.
 * 
 * 7.DispalyStack(Stack *stack) 输出栈元素
 * 
 * 作者:西瓜小羽毛
 * 日期:2020/7/22
 ************************************************/
#define TRUE 1
#define FALSE 0
#define SIZE 20
#define INCREASE_SIZE 5
typedef bool BOOL;
typedef int ElemType;
typedef struct Stack
{
    ElemType *base; //栈底指针
    ElemType *top;  //栈顶指针
    int stackSize;  //当前已分配空间大小
} Stack;
/* 初始化顺序栈 */
Stack InitStack()
{
    Stack stack;
    stack.base = (ElemType *)malloc(SIZE * sizeof(ElemType));
    if (stack.base == NULL)
    {
        exit(0);
    }
    /* 将顺序栈设置为空 */
    stack.top = stack.base;
    stack.stackSize = SIZE;
    return stack;
}
/* 销毁顺序栈 */
void DestoryStack(Stack *stack)
{
    if (stack->base == NULL)
    {
        printf("未初始化顺序栈\n");
        return;
    }
    free(stack->base);
    stack->top = stack->base = NULL;
    stack->stackSize = 0;
}
/* 判断顺序栈是否为空 */
BOOL StackIsEmpty(Stack *stack)
{
    if (stack->base == NULL)
    {
        printf("未初始化顺序栈\n");
        return FALSE;
    }
    if (stack->base == stack->top)
    {
        return FALSE;
    }
    else
    {
        return TRUE;
    }
}
/* 获取栈顶元素 */
ElemType GetTop(Stack *stack)
{
    ElemType data = 0;
    if (stack->base == NULL)
    {
        printf("未初始化顺序栈\n");
        return data;
    }
    if (stack->base == stack->top)
    {
        return data;
    }
    data = *(stack->top - 1);
    return data;
}
/* 入栈 */
void PushStack(Stack *stack, ElemType elem)
{
    if (stack->base == NULL)
    {
        printf("未初始化顺序栈\n");
        return;
    }
    if (stack->top - stack->base >= stack->stackSize)
    {
        stack->base = (ElemType *)realloc(stack->base, INCREASE_SIZE * sizeof(ElemType));
        if (stack->base == NULL)
        {
            exit(0);
        }
        stack->top = stack->base + stack->stackSize;
        stack->stackSize += INCREASE_SIZE;
    }
    *stack->top++ = elem;
}
/* 出栈 */
ElemType PopStack(Stack *stack)
{
    ElemType data = 0;
    if (stack->base == NULL)
    {
        printf("未初始化栈\n");
        return data;
    }
    if (stack->base == stack->top)
    {
        return 0;
    }
    data = *(--stack->top);
    return data;
}
/* 输出顺序栈元素 */
void DispalyStack(Stack *stack)
{
    if (stack->base == NULL)
    {
        printf("未初始化栈\n");
        return;
    }
    ElemType *p = stack->base;
    while (p != stack->top)
    {
        printf("%d ", *p++);
    }
    printf("\n");
}

测试代码

#include "SequenceStack.h"
int main()
{
    /* 顺序栈测试代码 */
    Stack stack = InitStack();
    for (int i = 0; i < 11; i++)
    {
        PushStack(&stack, i);
    }
    printf("出栈元素:%d\n", PopStack(&stack));
    printf("栈顶元素:%d\n", GetTop(&stack));
    printf("操作之后:%d\n", StackIsEmpty(&stack));
    printf("输出栈元素:");
    DispalyStack(&stack);
    DestoryStack(&stack);
    DispalyStack(&stack);
}

输出结果

出栈元素:10
栈顶元素:9
操作之后:1
输出栈元素:0 1 2 3 4 5 6 7 8 9
未初始化栈