线性表：顺序栈算法实现

爱被打了一巴掌 2022-05-31 12:39 210阅读 0赞

# 顺序栈介绍 #

**顺序栈就是用顺序存储结构构成的后进先出这样结构的栈**。**一般我们用数组来进行模拟**。为了让后顺序栈更通用呢，我们还是在**数据类型上使用void\*，我们只负责维护用户提供的数据的地址就行了，不负责用户数据的维护**。对外提供的SeqStack 类型 是void\*类型，可以用来隐藏我们栈内具体实现细节。

# 顺序栈代码 #

## SeqStack.h头文件 ##

#pragma once
    #ifndef __SEQSTACK_H__
    #define __SEQSTACK_H__
    #define MAXSIZE 1024
    typedef enum { FALSE, TRUE } Boolean;
    typedef struct SStack
    {
    	void* data[MAXSIZE];
    	int size;
    }SStack;
    typedef void* SeqStack;
    
    //初始化
    SeqStack Init_SeqStack();
    //压栈
    void Push_SeqStack(SeqStack stack, void* data);
    //弹栈
    void* Pop_SeqStack(SeqStack stack);
    //获取栈顶
    void* Top_SeqStack(SeqStack stack);
    //是否为空栈
    //1 是空，0 非空
    int IsEmpty_SeqStack(SeqStack stack);
    //栈元素个数
    int Size_SeqStack(SeqStack stack);
    //销毁 栈
    void Destroy_SeqStack(SeqStack stack);
    
    #endif // !__SEQSTACK_H__

## SeqStack.c实现文件 ##

#define _CRT_SECURE_NO_WARNINGS
    #include <stdio.h>
    #include <stdlib.h>
    #include <string.h>
    #include "SeqStack.h"
    
    //初始化
    SeqStack Init_SeqStack()
    {
    	SStack* stack = (SStack*)malloc(sizeof(SStack));
    	stack->size = 0;
    	memset(stack->data, 0, MAXSIZE);
    	return stack;
    }
    //压栈
    void Push_SeqStack(SeqStack stack, void* data)
    {
    	if (NULL == stack || NULL == data)
    	{
    		return;
    	}
    	SStack* myStack = (SStack*)stack;
    	myStack->data[myStack->size] = data;
    	myStack->size++;
    }
    //弹栈
    void* Pop_SeqStack(SeqStack stack)
    {
    	SStack* myStack = (SStack*)stack;
    	if (NULL == stack || 0 == myStack->size)
    	{
    		return NULL;
    	}
    	void* data = myStack->data[myStack->size - 1];
    	myStack->size--;
    	return data;
    }
    //获取栈顶
    void* Top_SeqStack(SeqStack stack)
    {
    	SStack* myStack = (SStack*)stack;
    	if (NULL == stack || 0 == myStack->size)
    	{
    		return NULL;
    	}
    	void* data = myStack->data[myStack->size - 1];
    	return data;
    }
    //是否为空栈
    //1 是空，0 非空
    int IsEmpty_SeqStack(SeqStack stack)
    {
    	SStack* myStack = (SStack*)stack;
    	if (NULL == stack || myStack->size == 0)
    	{
    		return 1;
    	}
    	return 0;
    }
    //栈元素个数
    int Size_SeqStack(SeqStack stack)
    {
    	SStack* myStack = (SStack*)stack;
    	if (NULL == stack)
    	{
    		return 0;
    	}
    	return myStack->size;
    }
    //销毁 栈
    void Destroy_SeqStack(SeqStack stack)
    {
    	SStack* myStack = (SStack*)stack;
    	if (myStack != NULL)
    	{
    		free(myStack);
    	}
    }

## Main.c测试文件 ##

#define _CRT_SECURE_NO_WARNINGS
    #include <stdio.h>
    #include <stdlib.h>
    #include "SeqStack.h"
    //测试 数据
    typedef struct Person
    {
    	char name[64];
    	int age;
    }Person;
    
    int main(int argc, char *argv[])
    {
    	Person p1 = { "Lily",11 };
    	Person p2 = { "Laymond",21 };
    	Person p3 = { "John",31 };
    	Person p4 = { "Leo",41 };
    	Person p5 = { "Zeo",51 };
    	SeqStack stack = Init_SeqStack();
    	Push_SeqStack(stack, &p1);
    	Push_SeqStack(stack, &p2);
    	Push_SeqStack(stack, &p3);
    	Push_SeqStack(stack, &p4);
    	Push_SeqStack(stack, &p5);
    	printf("栈顶元素:name=%s,age=%d\n", ((Person*)Top_SeqStack(stack))->name , ((Person*)Top_SeqStack(stack))->age);
    	printf("栈的元素个数:%d\n", Size_SeqStack(stack));
    	Person* p = NULL;
    	while (!IsEmpty_SeqStack(stack))
    	{
    		p = Pop_SeqStack(stack);
    		printf("name=%s,age=%d\n", p->name, p->age);
    	}
    	printf("栈的元素个数:%d\n", Size_SeqStack(stack));
    	Destroy_SeqStack(stack);
    	return 0;
    }

# 代码运行检测 #

![20180225002156609][]

[20180225002156609]: /images/20220531/6b56e70cdbce43caab62802e18e3ec9c.png