# 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; //PSTACK 等價于 struct STACK *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 Stackint val;init(&S); //目的是造出一個空棧push(&S, 1); //壓棧push(&S, 2);push(&S, 3);push(&S, 4);push(&S, 5);push(&S, 6);traverse(&S); //遍歷輸出 clear(&S);//traverse(&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; //pS->Bottom->pNext = NULL; } }void push(PSTACK pS, int val) {PNODE pNew = (PNODE)malloc(sizeof(NODE));pNew->data = val;pNew->pNext = pS->pTop; //pS->Top不能改成pS->BottompS->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;elsereturn false; }//把pS所指向的棧出棧一次，并把出棧的元素存入pVal形參所指向的變量中，如果出棧失敗，返回false,否則返回true 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;} }//clear清空 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.cnblogs.com/jiefangzhe/p/10856513.html

總結

以上是生活随笔為你收集整理的栈的相关操作的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。