定義：一種可以實作“先進后出”的存盤結構
分類：
- 靜態堆疊
- 動態堆疊
演算法：
- 出堆疊
- 壓堆疊
代碼實作：
多敲，多敲，后期改進
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.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 pS);
int main(void)
{
STACK S; // STACK等價于 struct Stack
int val;
init(&S); // 目的是造出一個空堆疊
push(&S , 1); // 壓堆疊
push(&S , 8);
push(&S , 23);
push(&S , 26);
push(&S , 34);
push(&S , 45);
push(&S , 76);
push(&S , 88);
traverse(&S); // 遍歷輸出
if(pop(&S , &val))
{
printf("你洗掉的是%d\n", val );
traverse(&S);
printf("清空資料\n");
clear(&S);
traverse(&S);
}
else
{
printf("洗掉失敗\n");
}
}
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; // pS->pBottom->pNext = NULL
}
}
void push(PSTACK pS, int val)
{
PNODE pNew = (PNODE)malloc(sizeof(NODE));
pNew->data = https://www.cnblogs.com/mengd/p/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;
}
bool empty(PSTACK pS )
{
if (pS->pTop == pS->pBottom)
return true;
else
return false;
}
// 把pS所指向的堆疊出堆疊一次，并把出堆疊元素存下
bool pop(PSTACK pS , int *val)
{
if (empty(pS))
{
return false;
}
else
{
PNODE p = pS->pTop;
*val = p->data;
pS->pTop = p->pNext;
free(p);
p = 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;
}
}
應用：
- 函式呼叫
- 中斷
- 運算式求值
- 記憶體分配
- 緩沖處理
- 迷宮
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/208995.html
標籤：C
上一篇：C語言筆記 06_作用域&陣列