C语言实现链栈和顺序栈
栈是一种线性表,所以栈也有线性表的两种存储结构(顺序存储结构和链式存储结构)。
栈的顺序存储结构称为链栈,链式存储结构称为链栈。
顺序栈
利用一组地址连续的存储单元依次存放栈底到栈顶的数据元素,栈底位置固定不变,栈顶位置随着入栈和出栈操作而变化。
链栈
链栈是一种特殊的线性链表,和所有链表一样,是动态存储结构,无需预先分配存储空间。
common.h
#ifndef _COMMON_H_
#define _COMMON_H_
#include<stdio.h>
#include<assert.h>
#include<stdbool.h>
#include<stdlib.h>
#define ElemType int
void Swap(ElemType *a, ElemType *b)
{
ElemType tmp = *a;
*a = *b;
*b = tmp;
}
#endif /* _COMMON_H_ */
stack.h
#ifndef _STACK_H_
#define _STACK_H_
#include"common.h"
#define SEQ_STACK_DEFAULT_SIZE 8
#define SEQ_STACK_INC_SIZE 3
//顺序栈
typedef struct SeqStack
{
ElemType *base;
size_t capacity;
int top;
}SeqStack;
void SeqStackInit(SeqStack *pst);
bool SeqStackIsFull(SeqStack *pst);
bool SeqStackIsEmpty(SeqStack *pst);
void SeqStackPush(SeqStack *pst, ElemType x);
void SeqStackPop(SeqStack *pst);
ElemType SeqStackTop(SeqStack *pst); // SeqStackPeek();
void SeqStackPrint(SeqStack *pst);
void SeqStackDestroy(SeqStack *pst);
void SeqStackInit(SeqStack *pst)
{
pst->base = (ElemType*)malloc(sizeof(ElemType)*SEQ_STACK_DEFAULT_SIZE);
assert(pst->base != NULL);
pst->capacity = SEQ_STACK_DEFAULT_SIZE;
pst->top = 0;
}
bool SeqStackIsFull(SeqStack *pst)
{
assert(pst != NULL);
return pst->top >= pst->capacity;
}
bool SeqStackIsEmpty(SeqStack *pst)
{
assert(pst != NULL);
return pst->top == 0;
}
void SeqStackPush(SeqStack *pst, ElemType x)
{
assert(pst != NULL);
if (SeqStackIsFull(pst))
{
printf("栈空间已满,%d 不能入栈.\n", x);
return;
}
pst->base[pst->top++] = x;
}
void SeqStackPop(SeqStack *pst)
{
assert(pst != NULL);
if (SeqStackIsEmpty(pst))
{
printf("栈已空,不能出栈.\n");
return;
}
pst->top--;
}
ElemType SeqStackTop(SeqStack *pst)
{
assert(pst != NULL);
if (SeqStackIsEmpty(pst))
{
printf("栈已空,不能取栈顶元素.\n");
return;
}
return pst->base[pst->top - 1];
}
void SeqStackPrint(SeqStack *pst)
{
assert(pst != NULL);
for (int i = pst->top - 1; i >= 0; --i)
printf("%d\n", pst->base[i]);
printf("\n");
}
void SeqStackDestroy(SeqStack *pst)
{
assert(pst != NULL);
free(pst->base);
pst->base = NULL;
pst->capacity = pst->top = 0;
}
///
//链栈
typedef struct LinkStackNode
{
ElemType data;
struct LinkStackNode *link; //next
}LinkStackNode;
typedef struct LinkStack
{
LinkStackNode *top;
}LinkStack;
void LinkStackInit(LinkStack *pst);
void LinkStackPush(LinkStack *pst, ElemType x);
void LinkStackPop(LinkStack *pst);
ElemType LinkStackTop(LinkStack *pst);
void LinkStackPrint(LinkStack *pst);
void LinkStackDestroy(LinkStack *pst);
void LinkStackInit(LinkStack *pst)
{
assert(pst != NULL);
pst->top = NULL;
}
void LinkStackPush(LinkStack *pst, ElemType x)
{
assert(pst != NULL);
LinkStackNode *node = (LinkStackNode*)malloc(sizeof(LinkStackNode));
assert(node != NULL);
node->data = x;
node->link = pst->top;
pst->top = node;
}
void LinkStackPop(LinkStack *pst)
{
assert(pst != NULL);
LinkStackNode *p = pst->top;
pst->top = p->link;
free(p);
}
ElemType LinkStackTop(LinkStack *pst)
{
assert(pst != NULL);
if (pst->top == NULL)
{
printf("栈已空,不能出栈.\n");
return;
}
return pst->top->data;
}
void LinkStackPrint(LinkStack *pst)
{
assert(pst != NULL);
LinkStackNode *p = pst->top;
while (p != NULL)
{
printf("%d\n", p->data);
p = p->link;
}
printf("\n");
}
void LinkStackDestroy(LinkStack *pst)
{
assert(pst != NULL);
while (pst->top != NULL)
{
LinkStackNode *p = pst->top;
pst->top = p->link;
free(p);
}
}
#endif /* _STACK_H_ */
seqstackmain.c
#define _CRT_SECURE_NO_WARNINGS 1
#include "stack.h"
void main()
{
SeqStack st;
SeqStackInit(&st);
SeqStackPush(&st, 1);
SeqStackPush(&st, 2);
SeqStackPush(&st, 3);
SeqStackPush(&st, 4);
SeqStackPush(&st, 5);
SeqStackPush(&st, 6);
SeqStackPush(&st, 7);
SeqStackPush(&st, 8);
SeqStackPush(&st, 9);
SeqStackPrint(&st);
ElemType val = SeqStackTop(&st);
SeqStackPop(&st);
printf("%d 出栈.\n", val);
val = SeqStackTop(&st);
SeqStackPop(&st);
printf("%d 出栈.\n", val);
SeqStackPrint(&st);
SeqStackDestroy(&st);
system("pause");
}
linkstackmain.h
#define _CRT_SECURE_NO_WARNINGS 1
#include "stack.h"
void main()
{
LinkStack st;
LinkStackInit(&st);
LinkStackPush(&st, 1);
LinkStackPush(&st, 2);
LinkStackPush(&st, 3);
LinkStackPush(&st, 4);
LinkStackPush(&st, 5);
LinkStackPrint(&st);
ElemType val = LinkStackTop(&st);
LinkStackPop(&st);//出栈5
printf("%d 出栈.\n", val);
LinkStackPrint(&st);
LinkStackDestroy(&st);
system("pause");
}