在通过顺序表实现栈结构时,主要是利用对数组的尾部元素进行操作来体现栈的特性。这里宏定义了最大容量,对于栈的存储容量有所限制,其实也可以引入顺序表的扩容操作来进一步完善。
SeqStack.h
#pragma once
//数组取模拟栈的顺序存储
#define MAX_SIZE 1024
#define SEQSTACK_TRUE 1
#define SEQSTACK_FALSE 0
typedef struct SEQSTACK
{
void* data[MAX_SIZE];//通过宏给出了capacity
int size;
}SeqStack;
//初始化栈
SeqStack* Init_SeqStack();
//入栈
void Push_SeqStack(SeqStack* stack, void* data);
//返回栈顶元素
void* Top_SeqStack(SeqStack* stack);
//出栈
void Pop_SeqStack(SeqStack* stack);
//判断是否为空
int IsEmpty_SeqStack(SeqStack* stack);
//返回栈中元素个数
int Size_SeqStack(SeqStack* stack);
//销毁
void FreeSpace_SeqStack(SeqStack* stack);
//清空栈
void Clear_SeqStack(SeqStack* stack);
SeqStack.c
#include<stdio.h>
#include<stdlib.h>
#include"SeqStack.h"
//初始化栈
SeqStack* Init_SeqStack()
{
SeqStack* stack = (SeqStack*)malloc(sizeof(SeqStack));
for (int i = 0; i < MAX_SIZE; i++)//给定的void*数组,需要遍历来初始化
{
stack->data[i] = NULL;
}
stack->size = 0;
return stack;
}
//入栈
void Push_SeqStack(SeqStack* stack, void* data)
{
if (stack->size == MAX_SIZE)
{
return;
}
if (data == NULL)
{
return;
}
stack->data[stack->size] = data;
stack->size++;
}
//返回栈顶元素
void* Top_SeqStack(SeqStack* stack)
{
if(stack == NULL)
{
return NULL;
}
if (stack->size == 0)
{
return NULL;
}
return stack->data[stack->size-1];//size要减1,数组从0开始
}
//出栈
void Pop_SeqStack(SeqStack* stack)
{
if (stack == NULL)
{
return;
}
if (stack->size == 0)
{
return;
}
stack->data[stack->size - 1] = NULL;
stack->size--;
}
//判断是否为空
int IsEmpty_SeqStack(SeqStack* stack)
{
if (stack == NULL)
{
return -1;
}
if (stack->size == 0)
{
return SEQSTACK_TRUE;
}
return SEQSTACK_FALSE;
}
//返回栈中元素个数
int Size_SeqStack(SeqStack* stack)
{
if (stack == NULL)
{
return -1;
}
return stack->size;
}
//销毁
void FreeSpace_SeqStack(SeqStack* stack)
{
if (stack == NULL)
{
return;
}
free(stack);
}
//清空栈
void Clear_SeqStack(SeqStack* stack)
{
if (stack == NULL)
{
return;
}
for (int i = 0; i < stack->size; i++)
{
stack->data[i] = NULL;
}
stack->size = 0;
}
栈的顺序存储.c
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include "SeqStack.h"
typedef struct PERSON
{
char name[64];
int age;
}Person;
int main()
{
SeqStack* stack = Init_SeqStack();
//创建数据
Person p1 = { "aaa",10 };
Person p2 = { "bbb",20 };
Person p3 = { "ccc",30 };
Person p4 = { "ddd",40 };
Person p5 = { "eee",50 };
//数据入栈
Push_SeqStack(stack,&p1);
Push_SeqStack(stack, &p2);
Push_SeqStack(stack, &p3);
Push_SeqStack(stack, &p4);
Push_SeqStack(stack, &p5);
//输出
while (Size_SeqStack(stack) > 0)
{
//访问栈顶元素
Person* p = (Person*)Top_SeqStack(stack);//必须显式强转
printf("name:%s, age:%d\n",p->name,p->age);
//出栈
Pop_SeqStack(stack);
}
//释放内存
FreeSpace_SeqStack(stack);
system("pause");
return 0;
}
测试结果: