栈的顺序存储实现2

栈的头文件：

#pragma once
#include<stdlib.h>
#include<stdio.h>

//数组模拟栈
#define MAX_SIZE 1024

typedef struct SEQSTACK
{
    void* data[MAX_SIZE];
    int size;
}SeqStack;

//初始化栈
SeqStack* Init_SeqStack();
//入栈
void Push_SeqStack(SeqStack* stack, void* data);
//出栈
void Pop_SeqStack(SeqStack* stack);
//返回栈顶元素
void* Top_SeqStack(SeqStack* stack);
//判断是否为空
bool IsEmpty(SeqStack* stack);
//清空栈
void Clear_SeqStack(SeqStack* stack);
//销毁栈
void Free_SeqStack(SeqStack* stack);

栈的实现：

#include "栈的顺序存储.h"
//初始化栈
SeqStack* Init_SeqStack()
{
    SeqStack* stack = (SeqStack*)malloc(sizeof(SeqStack));
    if (stack == NULL)
    {
        exit(1);
    }

    stack->size = 0;
    for (int i = 0; i < MAX_SIZE; ++i)
    {
        stack->data[i] = NULL;
    }

    return stack;
}
//入栈
void Push_SeqStack(SeqStack* stack, void* data)
{
    if (stack == NULL)
    {
        exit(1);
    }

    if (stack->size == MAX_SIZE)
    {
        exit(1);
    }

    if (data == NULL)
    {
        exit(1);
    }

    stack->data[stack->size] = data;
    stack->size++;
}
//出栈
void Pop_SeqStack(SeqStack* stack)
{
    if (stack == NULL)
    {
        exit(1);
    }

    if (stack->size == 0)
    {
        exit(1);
    }

    stack->size--;
}
//返回栈顶元素
void* Top_SeqStack(SeqStack* stack)
{
    if (stack == NULL)
    {
        exit(1);
    }

    if (stack->size == 0)
    {
        exit(1);
    }

    return stack->data[stack->size - 1];
}
//判断是否为空
bool IsEmpty(SeqStack* stack)
{
    if (stack == NULL)
    {
        exit(1);
    }

    return stack->size == 0;
}
//清空栈
void Clear_SeqStack(SeqStack* stack)
{
    if (stack == NULL)
    {
        exit(1);
    }

    stack->size = 0;
}
//销毁栈
void Free_SeqStack(SeqStack* stack)
{
    if (stack == NULL)
    {
        exit(1);
    }

    while (stack->size != 0)
    {
        Pop_SeqStack(stack);
        stack->size--;
    }

    free(stack);
}

栈的测试：

#include"栈的顺序存储.h"
#include<string.h>
#include<stdlib.h>
#include<stdio.h>

#define M 8
#define N 3
//数据元素结构体
typedef struct PERSON
{
    char name[64];
    int age;
}Person;

int main(int argc, const char* argv[])
{
    //创建循环链表
    SeqStack* stack = Init_SeqStack();

    //创建数据
    Person p1 = { "aas",40 };
    Person p2 = { "bbb",50 };
    Person p3 = { "ccc",60 };
    Person p4 = { "ddd",70 };
    Person p5 = { "eee",80 };
    //是否为空
    printf("");
    //入栈
    Push_SeqStack(stack, &p1);
    Push_SeqStack(stack, &p2);
    Push_SeqStack(stack, &p3);
    Push_SeqStack(stack, &p4);
    Push_SeqStack(stack, &p5);

    //出栈
    Person* tmp = (Person*)Top_SeqStack(stack);
    printf("name %s age %d
", tmp->name, tmp->age);

    //删除
    Pop_SeqStack(stack);

    //出栈
    Person* tmp1 = (Person*)Top_SeqStack(stack);
    printf("name %s age %d
", tmp1->name, tmp1->age);

    //判断是否为空
    bool ret = IsEmpty(stack);
    printf("判断是否为空:%d
", ret);
    //清空栈
    Clear_SeqStack(stack);


    //判断是否为空
    ret = IsEmpty(stack);
    printf("判断是否为空:%d
", ret);
    
    //释放
    Free_SeqStack(stack);
    system("pause");
    return 0;
}

测试结果：