栈
首先先对栈做简单的认识:
栈作为一种数据结构,是一种只能在一端进行插入和删除操作的特殊线性表。它按照先进后出的原则存储数据,先进入的数据被压入栈底,最后的数据在栈顶,需要读数据的时候从栈顶开始弹出数据(最后一个数据被第一个读出来)。栈具有记忆作用,对栈的插入与删除操作中,不需要改变栈底指针。允许进行插入和删除操作的一端称为栈顶(top),另一端为栈底(bottom);栈底固定,而栈顶浮动;栈中元素个数为零时称为空栈。插入一般称为进栈(PUSH),删除则称为退栈(POP)。栈也称为后进先出表。
下面是实现顺序栈与链式栈的程序:
1.顺序栈
.h文件
#pragma once
#include<stddef.h>
typedef char SeqStackType;
typedef struct SeqStack
{
SeqStackType* data;
size_t size;
size_t capacity;//max_size 的代替品,data这段内存中能容纳的元素个数
}SeqStack;
void SeqStackInit(SeqStack* stack);//栈的初始化
void SeqStackDestroy(SeqStack* stack);//栈的销毁
void SeqStackResize(SeqStack* stack);//重新设置栈的大小
void SeqStackPush(SeqStack* stack,SeqStackType value);//入栈
void SeqStackPop(SeqStack* stack);//出栈
//返回两个信息:执行成功失败,栈顶元素的值是多少
int SeqStackTop(SeqStack* stack,SeqStackType* value);
.c文件
#include"seqstack.h"
#include <stdio.h>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
#define TEST_HEADER printf("\n==============================%s====================================\n",__FUNCTION__);
void SeqStackPrintChar(SeqStack* stack,const char* msg)
{
printf("[%s]\n",msg);
size_t i = 0;
for(;i < stack->size;++i)//循环打印栈中元素
{
printf("[%c] ",stack->data[i]) ;
}
printf("\n");
return;
}
初始化以及测试函数
void SeqStackInit(SeqStack* stack)
{
if(stack == NULL)
{
//非法输入
return;
}
stack->size = 0;//将栈的大小设置为0
stack->capacity = 1000;//将栈的最大容纳元素个数设置为1000
stack->data = (SeqStackType*)malloc(stack->capacity*sizeof(SeqStackType));
}
void TestInit()
{
TEST_HEADER;
SeqStack stack;
SeqStackInit(&stack);
printf("size expected : 0,actual %lu\n",stack.size);
printf("capacity expected : 1000,actual %lu\n" ,stack.capacity);
}
销毁栈
void SeqStackDestroy(SeqStack* stack)
{
if(stack == NULL)
{
//非法输入
return;
}
free(stack->data);
stack->size = 0;
stack->capacity = 0;
}
void TestDestroy()
{
TEST_HEADER;
SeqStack stack;
SeqStackInit(&stack);
SeqStackDestroy(&stack);
printf("size expected : 0,actual %lu\n",stack.size);
printf("capacity expected : 0,actual %lu\n" ,stack.capacity);
}
入栈
void SeqStackResize(SeqStack* stack)
{
if(stack == NULL)
{
//非法输入
return;
}
if(stack->size < stack->capacity)//如果栈的大小比最大容纳元素个数小不需要重置大小
{
return;
}
stack->capacity = stack->capacity * 2 + 1;//根据自己的喜好进行扩容
SeqStackType* new_ptr = (SeqStackType*)malloc(stack->capacity * sizeof(SeqStackType));
size_t i = 0;
for(;i <stack->size;++i )
{
new_ptr[i] = stack->data[i];//将原栈中元素放到新开辟的空间
}
free(stack->data);
stack->data = new_ptr;
return;
}
void SeqStackPush(SeqStack* stack,SeqStackType value)
{
if(stack == NULL)
{
//非法输入
return;
}
if(stack->size > stack->capacity)//如果栈的大小已经超出最大的容量,则新开辟空间
{
SeqStackResize(stack);
}
stack->data[stack->size++] = value;//否则直接把值赋给下一个元素,size++
return;
}
void TestPush()
{
TEST_HEADER;
SeqStack stack;
SeqStackInit(&stack);
SeqStackPush(&stack,'a');
SeqStackPush(&stack,'b');
SeqStackPush(&stack,'c');
SeqStackPush(&stack,'d');
SeqStackPrintChar(&stack,"入栈四个元素");
}
出栈
void SeqStackPop(SeqStack* stack)
{
if(stack == NULL)
{
//非法输入
return;
}
if(stack->size == 0)
{
return;
}
--stack->size;
return;
}
void TestPop()
{
TEST_HEADER;
SeqStack stack;
SeqStackInit(&stack);
SeqStackPush(&stack,'a');
SeqStackPush(&stack,'b');
SeqStackPush(&stack,'c');
SeqStackPush(&stack,'d');
SeqStackPop(&stack);
SeqStackPrintChar(&stack,"出栈一个元素");
SeqStackPop(&stack);
SeqStackPop(&stack);
SeqStackPrintChar(&stack,"出栈两个元素");
SeqStackPop(&stack);
SeqStackPop(&stack);
SeqStackPrintChar(&stack,"出栈两个元素");
}
取栈顶元素
int SeqStackTop(SeqStack* stack,SeqStackType* value)
{
if(stack == NULL || value == NULL)
{
//非法输入
return 0;
}
if(stack->size == 0)
{
//空栈
return 0;
}
*value = stack->data[stack->size-1];
return 1;
}
void TestTop()
{
TEST_HEADER;
SeqStack stack;
SeqStackInit(&stack);
SeqStackPush(&stack,'a');
SeqStackPush(&stack,'b');
SeqStackPush(&stack,'c');
SeqStackPush(&stack,'d');
SeqStackPrintChar(&stack,"入栈四个元素");
SeqStackType value;
int ret = SeqStackTop(&stack,&value);
printf("ret expected : 1,actual %d\n",ret);
printf("value expected : d,actual %c\n",value);
SeqStackPop(&stack);
SeqStackPop(&stack);
ret = SeqStackTop(&stack,&value);
printf("ret expected : 1,actual %d\n",ret);
printf("value expected : b,actual %c\n",value);
SeqStackPop(&stack);
SeqStackPop(&stack);
ret = SeqStackTop(&stack,&value);
printf("ret expected : 0,actual %d\n",ret);
}
2.链式栈
.h文件
#pragma once
typedef char LinkStackType;
typedef struct LinkNode
{
LinkStackType data;
struct LinkNode* next;
}LinkNode;
typedef struct LinkStack
{
LinkNode* head;
LinkNode* tail;
}LinkStack;
void LinkStackInit(LinkStack* s);//初始化
void LinkStackDestroy(LinkStack* s);//销毁栈
void LinkStackPush(LinkStack* s,LinkStackType value);//入栈
void LinkStackPop(LinkStack* s);//出栈
int LinkStackTop(LinkStack* s ,LinkStackType* value);//取栈顶元素
.c文件
#include"linkstack.h"
#include <stdio.h>
#include<stdlib.h>
void LinkStackInit(LinkStack* s)
{
if(s == NULL)
{
//非法输入
return;
}
s->head = NULL;//将头指针置空
s->tail = NULL;//将尾指针置空
return;
}
void LinkStackDestroy(LinkStack* s)
{
if(s == NULL)
{
//非法输入
return;
}
LinkNode* cur = s->head;
LinkNode* pre = cur;
while(cur!=NULL)
{
pre = cur;
cur = cur->next;
free(pre);
pre = NULL;
}
return;
}
LinkNode* CreateLinkStackNode(LinkStackType value)
{
LinkNode* tmp = (LinkNode*)malloc(sizeof(LinkNode));
if(!tmp)
{
//创建失败
return NULL;
}
tmp->data = value;
tmp->next = NULL;//将新建节点的next置空
return tmp;
}
void LinkStackPush(LinkStack* s,LinkStackType value)
{
if(s == NULL)
{
return;
}
LinkNode* cur = CreateLinkStackNode(value);//创建一个新的值为value的节点
cur->next = s->head;//将新创建的节点的next指向原栈的顶部
s->head = cur;//更新头指针的指向
return;
}
void DestroyLinkStackNode(LinkNode* to_delete)
{
if(to_delete == NULL)
{
return;
}
free(to_delete);
to_delete = NULL;
return;
}
void LinktackPop(LinkStack* s)
{
if(s == NULL)
{
return;
}
LinkNode* to_delete = s->head;//出栈出的是栈顶元素
s->head = s->head->next;//原头节点的next为新的头节点
DestroyLinkStackNode(to_delete);
return;
}
int LinkStackTop(LinkStack* s,LinkStackType* value)
{
if(s == NULL || value == NULL)
{
return 0;
}
if(s->head == NULL)
{
return 0;
}
*value = s->head->data;//将头节点的值赋给value
return 1;//有元素返回1
}
以下为测试代码:
#if 1
#define TEST_HEADER printf("\n=========================%s===================================\n",__FUNCTION__);
void TestStack()
{
TEST_HEADER;
LinkStack stack;
LinkStackInit(&stack);
//首先入栈四个元素
LinkStackPush(&stack,'a');
LinkStackPush(&stack,'b');
LinkStackPush(&stack,'c');
LinkStackPush(&stack,'d');
LinkStackType value;
int ret = LinkStackTop(&stack,&value);
//因为栈满足后进先出原则,所以第一个栈顶元素为d
printf("ret expected : 1,actual %d\n",ret);
printf("value expected : d,actual %c\n",value);
//出栈一个元素后栈顶元素变为c
LinktackPop(&stack);
ret = LinkStackTop(&stack,&value);
printf("ret expected : 1,actual %d\n",ret);
printf("value expected : c,actual %c\n",value);
LinktackPop(&stack);
ret = LinkStackTop(&stack,&value);
printf("ret expected : 1,actual %d\n",ret);
printf("value expected : b,actual %c\n",value);
LinktackPop(&stack);
ret = LinkStackTop(&stack,&value);
printf("ret expected : 1,actual %d\n",ret);
printf("value expected : a,actual %c\n",value);
LinktackPop(&stack);
ret = LinkStackTop(&stack,&value);
printf("ret expected : 0,actual %d\n",ret);
}
int main()
{
TestStack();
return 0;
}
#endif