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 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458
| #include <stdio.h> #include <stdlib.h> #include <string.h>
typedef struct node { int num; char type; struct node *next; } Node;
typedef struct queue { Node *front; Node *rear; } Queue;
typedef struct window { int id; int status; char type; } Window;
void initQueue(Queue *q) { q->front = NULL; q->rear = NULL; }
int isEmpty(Queue *q) { return q->front == NULL; }
void enqueue(Queue *q, int num, char type) { Node *newNode = (Node *)malloc(sizeof(Node)); newNode->num = num; newNode->type = type; newNode->next = NULL; if (isEmpty(q)) { q->front = newNode; q->rear = newNode; } else { q->rear->next = newNode; q->rear = newNode; } }
int dequeue(Queue *q, char type) { if (isEmpty(q)) { return -1; } else { Node *p = q->front; Node *prev = NULL; while (p != NULL) { if (p->type == type) { break; } prev = p; p = p->next; }
if (p == NULL) { return -1; } else { int num = p->num; if (prev == NULL) { q->front = q->front->next; } else { prev->next = p->next; }
if (p == q->rear) { q->rear = prev; }
free(p); return num; } } }
void printQueue(Queue *q) { if (isEmpty(q)) { printf("当前没有人排队\n"); } else { printf("当前排队的人有:\n"); Node *p = q->front; while (p != NULL) { printf("%d(%c) ", p->num, p->type); p = p->next; } printf("\n"); } }
void initWindow(Window *w, int n) { for (int i = 0; i < n; i++) { w[i].id = i + 1; w[i].status = 0; w[i].type = 'A' + i; } }
void printWindow(Window *w, int n, Queue *q);
void printWindow(Window *w, int n, Queue *q) { printf("当前窗口的情况如下:\n"); for (int i = 0; i < n; i++) { printf("窗口%d(%c):", w[i].id, w[i].type); switch (w[i].status) { case 0: printf("空闲"); break; case 1: printf("忙碌"); break; case -1: printf("暂停"); break; default: printf("未知"); break; } int count = 0; Node *p = q->front; while (p != NULL) { if (p->type == w[i].type) { count++; } p = p->next; } printf(",前面还有%d人排队\n", count); } }
int addWindow(Window *w, int *n) { if (*n >= 10) { return -1; } else { (*n)++; w[*n - 1].id = *n; char type; printf("请输入您要增加的窗口类别A表示个人现金业务,B表示个人其他业务,C表示对公现金业务,D表示对公其他业务:\n"); scanf(" %c", &type); while (type != 'A' && type != 'B' && type != 'C' && type != 'D') { printf("无效的窗口类别,请重新输入!\n"); scanf(" %c", &type); } w[*n - 1].type = type; w[*n - 1].status = 0; return w[*n - 1].id; } }
int deleteWindow(Window *w, int *n) { if (*n <= 4) { return -1; } else { int id = w[*n - 1].id; (*n)--; return id; } }
int pauseWindow(Window *w, int n, int id) { if (id < 1 || id > n) { return -1; } else { w[id - 1].status = -1; return id; } }
int resumeWindow(Window *w, int n, int id) { if (id < 1 || id > n) { return -1; } else { w[id - 1].status = 0; return id; } }
int takeNumber(Queue *q, int *count) { if (*count >= 100) { return -1; } else { (*count)++; char type; printf("请输入您要办理的业务类型(A/B/C/D):\n"); scanf(" %c", &type); while (type != 'A' && type != 'B' && type != 'C' && type != 'D') { printf("无效的业务类型,请重新输入!\n"); scanf(" %c", &type); } enqueue(q, *count, type); return *count; } }
void finishService(Queue *q, Window *w, int n, int *num, int *id) { if (isEmpty(q)) { *num = -1; *id = 0; return; } for (int i = 0; i < n; i++) { if ((w[i].status == 0 || w[i].status == 1) && w[i].type == q->front->type) { w[i].status = 1; *num = dequeue(q, w[i].type); *id = w[i].id; return; } } *num = -1; *id = 0; return; }
void clearScreen() { system("cls"); printf("清屏成功!!!!!!!!!!!!"); }
void printHelp() { printf("欢迎来到罗氏银行!!!\n\n"); printf("**********************************************\n"); printf(" 窗口排队管理系统 \n"); printf("**********************************************\n"); printf("1.窗口状态\n2.窗口新增\n3.窗口删除\n4.窗口业务暂停\n5.窗口业务恢复\n\n6.取号排队\n7.办结离队\n\n8.清屏\n9.帮助\n0.退出\n"); }
int main() { Queue q; initQueue(&q);
Window w[10]; int n = 4; initWindow(w, n);
int count = 0;
int choice;
printHelp();
while (1) { printf("\n请输入序号(0-9)选择哪种罗氏银行高贵服务:\n"); scanf("%d", &choice);
switch (choice) { case 1: printWindow(w, n, &q); break; case 2: { int id = addWindow(w, &n); if (id == -1) { printf("无法增加更多的窗口了!\n"); } else { printf("成功增加了一个新的窗口,编号为%d\n", id); } break; } case 3: { int id = deleteWindow(w, &n); if (id == -1) { printf("无法删除更多的窗口了!\n"); } else { printf("成功删除了一个窗口,编号为%d\n", id); } break; } case 4: { int id; printf("请输入您要暂停的窗口编号:\n"); scanf("%d", &id); int result = pauseWindow(w, n, id); if (result == -1) { printf("无效的窗口编号!\n"); } else { printf("成功暂停了窗口%d\n", result); } break; } case 5: { int id; printf("请输入您要恢复的窗口编号:\n"); scanf("%d", &id); int result = resumeWindow(w, n, id); if (result == -1) { printf("无效的窗口编号!\n"); } else { printf("成功恢复了窗口%d\n", result); } break; } case 6: { int num = takeNumber(&q, &count); if (num == -1) { printf("无法再取号了!\n"); } else { printf("您的排队号码是%d,请耐心等待\n", num); } break; } case 7: { int num, id; finishService(&q, w, n, &num, &id); if (num == -1 && id == 0) { printf("当前没有人可以办结离队!\n"); } else { printf("排队号码%d请到窗口%d办理业务\n", num, id); } break; } case 8: clearScreen(); break; case 9: printHelp(); break; case 0: printf("感谢您使用本系统,再见!\n"); return 0; default: printf("无效的功能编号,请重新输入!\n"); break; } }
return 0; }
|