#include <stdio.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);int pop(PSTACK, int *);void clear(PSTACK);int empty(PSTACK);int main(){STACK S;int 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);if (pop(&S, &val)){printf("出栈成功,出栈的元素是%d\n", val);}else{printf("出栈失败!\n");}traverse(&S);return 0;}/*清空栈*/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;}}/*创建空栈*/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;}/*检查是否为空栈*/int empty(PSTACK pS){if (pS->pTop == pS->pBottom)return 1;elsereturn 0;}/*出栈*/int pop(PSTACK pS, int *val){if (empty(pS)){return 0;}else{PNODE r = pS->pTop;*val = r->data;pS->pTop = r->pNext;free(r);r = NULL;return 1;}}
0 0