C语言堆栈详解
#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*); //出栈函数
void clear(PSTACK); //清空链表
int main(void)
{
STACK S;
int val; //记录出栈的数字
init(&S); //目的是为了创造一个空的栈;
push(&S, 3);
traverse(&S);
if (pop(&S, &val))
{
printf("出栈成功,出栈的元素是%d\n", val);
}
else
{
printf("出栈失败\n");
}
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;
return;
}
void traverse(PSTACK pS)
{
PNODE p = pS->pTop;
while (p != pS->pBottom)
{
printf("%d",p->data);
p = p->pNext;
}
printf("\n");
return;
}
//把pS所指向的栈出栈一次,并把出栈的元素存入pVal形参所指向的变量中,如果出栈失败返回false,否则返回true
bool empty(PSTACK pS)
{
if (pS->pTop == pS->pBottom)
return true;
else
reutn false;
}
bool pop(PSTACK pS, int* pVal)
{
if (empty(pS)) //pS本身存放的就是S的地址
{
return false;
}
else
{
PNODE r;
r = pS->pTop;
*pVal = r->data;
pS->pTop = r->pNext;
free(r);
r = NULL;
return true;
}
}
void clear(PSTACK pS)
{
if (empty(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;
}
}
本程序是参考的郝斌老师的视频讲解和结合自己的想法手动打出来的如有错误可能是部分的代码书写错误. 郝斌老师课程请搜索b站《郝斌C语言自学教程》