數據結構筆記之棧

線性結構的兩種常見應用之一 棧
定義
一種可以實現“先進後出”的存儲結構
棧類似於箱子
分類
靜態棧
動態棧
算法
出棧
壓棧
應用
函數調用
中斷
表達式求值
內存分配
緩衝處理

迷宮

實例

#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 pS);
void push(PSTACK pS,int val);
void traverse(PSTACK pS);
bool pop(PSTACK pS, int * pVal);
void clear(PSTACK pS);
bool empty(PSTACK pS);
int main()
{
	STACK S;    //申請一個內存空間
	int val;

	init(&S);
	push(&S, 1);	///壓棧
	push(&S, 2);
	push(&S, 3);
	push(&S, 4);
	push(&S, 5);
	traverse(&S);

	if( pop(&S, &val) )
	{
		printf("出棧成功，出棧元素爲%d\n", val);
	}
	else
		printf("出棧失敗");
	traverse(&S);

	clear(&S);
	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;	//指向pTop
	pS->pTop = pNew;

	return;
}

void traverse(PSTACK pS)
{
	PNODE p = pS->pTop;

	while(p != pS->pBottom)
	{
		printf("%d ", p->data);
		//printf("1 ");
		p = p->pNext;
	}
	printf("\n");

	return;
}

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

//出棧
bool pop(PSTACK pS, int * pVal)
{
	

	if(empty(pS))		//pS本身存放的S的地址
	{
		return false;
	}
	else
	{  
		PNODE r = pS->pTop;
		*pVal = r->data;
		pS->pTop = r->pNext;
		free(r);
		r = NULL;
		return true;
	}
}

void clear(PSTACK pS)
{
	if(empty(pS))		//pS本身存放的S的地址
	{
		return;
	}
	else
	{
		PNODE p = pS->pTop;
		PNODE q = p->pNext;
		while( p != pS->pBottom)
		{
			q = p->pNext;
			free(p);
			p = q;
		}
		pS->pTop = pS->pBottom;
	}
}