|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 |
#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 pop(PSTACK ps, int *pval); bool empty(PSTACK ps); void traverse(PSTACK ps); void clear(PSTACK ps); void push(PSTACK ps,int val); 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); pop(&s,&val); printf("出栈的元素值是: %d\n",val); traverse(&s); clear(&s); 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; } } bool empty(PSTACK ps) { if(ps->pTop == ps->pBottom) return true; else return false; } void push(PSTACK ps,int val) { PNODE pNew = (PNODE)malloc(sizeof(NODE)); pNew->data = val; pNew->pNext = ps->pTop; ps->pTop = pNew; } void pop(PSTACK ps, int *pval) { if(empty(ps)) { return ; } else { PNODE r = ps->pTop; *pval = r->data; ps->pTop = r->pNext; free(r); r = NULL; return; } } void traverse(PSTACK ps) { PNODE p = ps->pTop; while(p != ps->pBottom) { printf("%d ",p->data); p = p->pNext; } printf("\n"); return; } 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->pBottom = ps->pTop; } } |
发表评论
难的是和自己保持联系~