两种线性结构之一【栈】

定义：一种可以实现“先进后出”的存储结构

        栈类似于箱子

分类：

        静态栈   动态栈：核心是链表

算法：

        出栈  压栈

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>

typedef struct Node
{
	int data;
	struct Node* pNext;
}NODE, * PNODE;

typedef struct Stack
{
	PNODE pTop;
	PNODE pBottom;
}STACK, * PSTACK;

void init(PSTACK);
void push(PSTACK, int);
void traverse(PSTACK);
bool pop(PSTACK, int*);
bool empt(PSTACK);
void clear(PSTACK);

int main(void)
{
	STACK S;
	int val;

	init(&S);
	push(&S, 1);
	push(&S, 2);
	push(&S, 3);
	push(&S, 4);
	push(&S, 5);
	traverse(&S);
	clear(&S);
	if (pop(&S, &val)) //用引用的方式传递给形参，故而可以修改实参
	{
		printf("出栈成功，出栈元素是%d\n", val);
	}
	else
	{
		printf("出栈失败！\n");
	}
	traverse(&S);

	return 0;
}

void init(PSTACK pS)
{
	pS->pTop = (PNODE)malloc(sizeof(NODE));
	if (NULL == pS->pTop)
	{
		printf("动态内存分配失败！\n");
		exit(-1);
	}
	else
	{
		pS->pBottom = pS->pTop;
		pS->pTop->pNext = NULL;
	}
}

void push(PSTACK pS, int val)
{
	PNODE pNew = (PNODE)malloc(sizeof(NODE));
	pNew->data = val;
	pNew->pNext = pS->pTop;
	pS->pTop = pNew;
}

void traverse(PSTACK pS)
{
	PNODE p = pS->pTop;
	while (p != pS->pBottom)
	{
		printf("%d", p->data);
		p = p->pNext;
	}
	printf("\n");
}

bool empt(PSTACK pS)
{
	if (pS->pTop == pS->pBottom)
		return true;
	else
		return false;
}

bool pop(PSTACK pS, int*pVal)
{
	if (empt(pS))
	{
		return false;
	}
	else
	{
		PNODE p = pS->pTop;
		*pVal = p->data;
		pS->pTop = p->pNext;
		free(p);
		p = NULL;
		return true;
	}
}

//clear()清空
void clear(PSTACK pS)
{
	if (empt(pS))
	{
		return;
	}
	else
	{
		PNODE p = pS->pTop;
		PNODE q = NULL;

		while (p != pS->pBottom)
		{
			q=p->pNext;
			free(p);
			p = q;
		}
		pS->pTop = pS->pBottom;
	}
}

应用：

        函数调用：函数之间的调用是通过压栈出栈的形式进行信息传递的，栈中一般包括调用函数的信息和下一条语句的地址。

        中断

        表达式求值

        内存分配

        缓冲处理

        迷宫