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 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
| #include <stdio.h> #include <stdlib.h>
#define MAX_SIZE 100
typedef int tElem; typedef enum Status { ok = 1,Error = 0 } Status; typedef struct Stack { tElem data[MAX_SIZE]; int base; int top; int length; } Stack,*pStack;
pStack InitStack(pStack Sta) { if(Sta == NULL) { Sta = (pStack) malloc(sizeof(Stack)); } Sta->base = 0; Sta->top = 0; Sta->length = 0; return Sta; }
int getPosition(pStack Sta,tElem e) { int i = -1; int j = Sta->base; while (j < Sta->length) { if(Sta->data[j] == e) i = j; j++; } return i; }
pStack intoStack(pStack Sta,tElem e) { if(Sta->length >= MAX_SIZE) { printf("空间不足!\n"); return Sta; }
Sta->data[Sta->top] = e; Sta->top++; Sta->length++; printf("元素 %d 入栈成功!\n",e); return Sta; }
pStack outStack(pStack Sta,tElem e) { int position = getPosition(Sta,e); if(position == -1) { printf("元素 %d 不在栈中!\n",e); } else if(++position != Sta->top) { printf("元素 %d 不是最后一个入栈的元素,无法出栈!\n",e); } else { Sta->top--; Sta->length--; Sta->data[Sta->top] = 0; printf("元素 %d 出栈成功!\n",e); } return Sta; }
void printStack(pStack Sta) { if(Sta->length == 0) { printf("空栈!\n"); } else { int i = Sta->base; while (i < Sta->length) { printf("栈的第 %d 个元素是:%d\n",i,Sta->data[i]); i++; } } }
pStack clearStack(pStack Sta) { int i = Sta->base; while (i < Sta->top) { Sta->data[i] = 0; i++; } Sta->length = 0; Sta->top = 0; return Sta; }
pStack destroyStack(pStack Sta) { clearStack(Sta); printf("\n清空栈后,栈的长度为:%d\n",Sta->length);
free(Sta); printf("\n摧毁成功!\n"); }
int main() { pStack stack = NULL; stack = InitStack(stack);
printf("\n-----开始入栈-----\n"); stack = intoStack(stack,10); stack = intoStack(stack,20); stack = intoStack(stack,30); stack = intoStack(stack,40); stack = intoStack(stack,50);
printf("\n-----入栈后-----\n"); printStack(stack);
printf("\n-----开始出栈-----\n"); stack = outStack(stack,50); stack = outStack(stack,40); stack = outStack(stack,30);
printf("\n-----出栈后-----\n"); printStack(stack);
destroyStack(stack);
return 0; }
|