c语言数据结构篇之栈（线性栈与链式栈）

线性栈

1.判空条件：S.top==-1;
2.满栈条件：S.top=maxn-1

#include<cstdio>
#include<stdlib.h>

#define maxn 1000

typedef struct node
{
	int date[maxn];
	int top;//类似于栈顶指针
}seqstack;

void stack_init(seqstack *S)//栈的初始化
{
	S->top = -1;
}

int stack_empty(seqstack S)//判断栈是否为空栈
{
	if (S.top == -1)
		return 0;
	else
		return 1;
}

void Push(seqstack* S, int value)//入栈
{
	if (S->top == maxn - 1)
	{
		printf_s("栈已满！\n");
		exit(0);
	}
	else
	{
		S->top++;
		S->date[S->top] = value;
	}
}

int Pop(seqstack* S)//出栈操作
{
	if (S->top == -1)
	{
		printf_s("空栈！\n");
		return 0;
	}
	else
	{
		int x = S->date[S->top];
		S->top--;
		return x;
	}
}

int stack_gettop(seqstack* S)//取栈顶元素
{
	if (S->top == -1)
	{
		printf_s("空栈！\n");
		return 0;
	}
	else
	{
		int x = S->date[S->top];
		return x;
	}
}

void stack_clear(seqstack* S)//清空栈
{
	S->top = -1;
}

int stack_length(seqstack* S)//求栈长
{
	return S->top;
}

void stack_show(seqstack* S)//显示栈中所有元素
{
	if (S->top == -1)
	{
		printf_s("空栈！\n");
		exit(0);
	}
	else
	{
		int key = S->top;
		while (S->top!=-1)
		{

			printf_s("%d\n", stack_gettop(S));
		}
	}
}

int main()
{
	seqstack* S;
	S = (seqstack*)malloc(sizeof(seqstack));
	stack_init(S);
	int n;
	scanf_s("%d", &n);
	for (int i = 0; i < n; i++)
	{
		int value;
		scanf_s("%d", &value);
		Push(S, value);
	}
	stack_show(S);
	return 0;
}

链式栈

1.判空条件：S.top==NULL;

#include<stdio.h>
#include<stdlib.h> //可以使用 malloc ,用<malloc.h>也可以
#define len sizeof(LStackNode) 

typedef struct node
{
	struct node* next;
	int data;
}LStackNode;

typedef struct
{
	struct node* top;//栈顶指针，只会指向栈顶元素
}Linke_stack;

Linke_stack* S;
void stack_init(Linke_stack* S)//栈的初始化
{
	S->top =NULL;//指向空
}

int stack_empty(Linke_stack S)//判断栈是否为空栈，空为真
{
	if (S.top == NULL)
		return 1;
	else
		return 0;
}

void Push(Linke_stack* S, int value)//入栈
{
	LStackNode* node;
	node = (LStackNode*)malloc(len);
	if (node == NULL)
	{
		printf_s("申请空间失败!\n");
		exit(0);
	}
	else
	{
		node->data = value;
		node->next = S->top;
		S->top = node;
	}
}

int Pop(Linke_stack* S)//出栈操作
{
	if ( S->top==NULL)
	{
		printf_s("空栈！\n");
		return 0;
	}
	else
	{
		int value = S->top->data;
		LStackNode* node;
		node = S->top;
		S->top = node->next;//指针下移栈顶
		free(node); //记得释放内存
		return value;//返回栈顶元素
	}
}

int stack_gettop(Linke_stack* S)//取栈顶元素
{
	if (S->top == NULL)
	{
		printf_s("空栈！\n");
		return 0;
	}
	else
	{
		int x = S->top->data;
		return x;
	}
}

void stack_clear(Linke_stack* S)//清空栈
{
	S->top = NULL;
}

int stack_length(Linke_stack S)//求栈长
{
	int count = 0;
	while (S.top != NULL)
	{
		count++;
		S.top = S.top->next;
	}
	return count;
}

//显示栈中所有元素,
void stack_show(Linke_stack S)//注意形参只能用单向传递，不能地址转递（即Linke_stack *S
{
	//Linke_stack* s = S;
	if (S.top == NULL)
	{
		printf_s("空栈！\n");
		exit(0);
	}
	else
	{
		while (S.top != NULL)
		{

			printf_s("%d\n", S.top->data);
			S.top= S.top->next;
		}
		//S->top = s->top;
	}
}

int main()
{
	Linke_stack* S;
	S = (Linke_stack*)malloc(len);
	stack_init(S);
	int n;
	scanf_s("%d", &n);
	for (int i = 0; i < n; i++)
	{
		int value;
		scanf_s("%d", &value);
		Push(S, value);
	}
	stack_show(*S);
	int m;
	printf_s("请输入要入栈的元素:");
	scanf_s("%d", &m);
	Push(S,m);
	stack_show(*S);


	Pop(S);
	stack_show(*S);

	return 0;
}