数据结构-栈(stack)的操作

hxd们，头发还健在吗？我是快秃了！！！

堆栈就是存储变量依次加入到栈中，释放的时候按相反顺序进行释放，这种先进后出的行为会让堆栈在程序执行时不断增大和缩小。栈通常作为自动变亮的存储区域，动态变量调用堆中的存储单元，静态变量有相应的静态存储区，后两者的生命周期相当于与程序的生命同时存在（如果您不在程序运行中间将堆内存delete的话）。

代码来了！！！

#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 value);   //压栈，添加元素
void traverse(PSTACK pS);          //遍历栈
bool empty(PSTACK pS);             //  判断是否空栈
bool pop(PSTACK pS, int * value);  // 出栈一个元素并输出元素的值
void clear(PSTACK pS, int * val);  //清理栈并输出每个栈的元素值（从顶到底）

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

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

	if (pop(&S, &value))
	{
		printf("出栈成功！出栈元素是%d\n", value);		
	}
	else
	{
		printf("出栈失败！\n");
	}
	traverse(&S);

	clear(&S, &val);
	traverse(&S);
	
	return 0;
}

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

	return;
}

void push(PSTACK pS, int value)
{
	PNODE pNew = (PNODE)malloc(sizeof(NODE));
	if (NULL == pNew)
	{
		printf("动态内存分配失败！\n");
		exit(1);
	}
	pNew->data = value;
	pNew->pNext = pS->pTop;
	pS->pTop = pNew;

	return;
}

void traverse(PSTACK pS)
{
	if (empty(pS))
	{
		printf("空栈！\n");
	}
	else
	{
		PNODE p = pS->pTop;
		PNODE q = p->pNext;
		while (p != pS->pBottom)
		{
			printf("%d ", p->data);
			p = q;
			q = p->pNext;
		}
		putchar('\n');
	}

	return;
}

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

bool pop(PSTACK pS, int * value)
{
	if (empty(pS))
	{
		return false;
	}
	else
	{
		PNODE R = pS->pTop;
		pS->pTop = pS->pTop->pNext;
		*value = R->data;
		free(R);
		R = NULL;

		return true;
	}
}

void clear(PSTACK pS, int * val)
{
	PNODE T = pS->pTop->pNext;
	while (pS->pTop != pS->pBottom)
	{
		*val = pS->pTop->data;
		printf("出栈:%d\n", *val);
		free(pS->pTop);
		pS->pTop = T;
		T = pS->pTop->pNext;
	}

	return;
}

今天莫名其妙被遍历算法搞了心态！！！

开始定义了一个指向栈顶Top1的指针，然后输出顶部元素后指向栈顶下一个Top2，即下一个Top2变成了栈顶，当输出完整个栈的元素的时候，栈空了？？？我直接人傻了

归根结底还是技术不够精通！！1