c语言"猜动物"游戏

最新推荐文章于 2021-05-24 22:53:26 发布

原创最新推荐文章于 2021-05-24 22:53:26 发布 · 1.6k 阅读

4 ·

CC 4.0 BY-SA版权

文章标签：

#语言 #c #branch #struct #null #游戏

本文介绍了一个基于二叉树结构的游戏程序实现，通过一系列的问题逐步猜测用户心中所想的动物。文章提供了完整的C语言源代码，并展示了如何通过递归进行二叉树节点的访问和更新。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

其实就是一个2叉树的访问操作。

#include <stdio.h> #include <string.h> #include <stdlib.h> #define MAX_STR 2048 typedef struct tag_Question Question; typedef struct tag_Question { char *ask; Question *yes; Question *no; }Question; typedef struct tag_QuestionNode QuestionNode; typedef struct tag_QuestionNode { Question question; QuestionNode *next; } QuestionNode; QuestionNode *head = NULL; Question *root; Question *lastBranch; Question *lastLeaf; Question* newQuestion(char *q) { QuestionNode *newNode = (QuestionNode*)malloc(sizeof(QuestionNode)); char *s = malloc(strlen(q)+1); strcpy(s, q); newNode->question.ask = s; newNode->question.no = newNode->question.yes = NULL; newNode->next = head; head = newNode; return &(newNode->question); } void destroyQuestions() { QuestionNode *p = head; while (p) { QuestionNode *next = p->next; free(p->question.ask); free(p); p = next; } } int anwswerIsYes() { char anwser[MAX_STR]; gets(anwser); return anwser[0] == 'y' || anwser[0] == 'Y'; } int question(Question *qst) { if (!qst) return 0; if (qst->ask[0] == '!') { printf("我猜是%s，我猜得对吗？", qst->ask+1); return anwswerIsYes(); } printf("%s", qst->ask); lastBranch = qst; lastLeaf = anwswerIsYes() ? qst->yes : qst->no; return question(lastLeaf); } void rememberNewAnimal(char *name) { char anwser[MAX_STR], qname[MAX_STR]; Question *q, *lfq; printf("请输入一个问题，可以把%s和%s区分开/n", lastLeaf->ask+1, name); gets(anwser); q = newQuestion(anwser); if (lastBranch->yes == lastLeaf) { lastBranch->yes = q; } else { lastBranch->no = q; } printf("对于%s，%s(Y/N)", name, q->ask); qname[0] = '!'; strcpy(qname+1, name); lfq = newQuestion(qname); if (anwswerIsYes()) { q->yes = lfq; q->no = lastLeaf; } else { q->yes = lastLeaf; q->no = lfq; } } #define N(x) base + x #define LEAF(s) {"!" s, NULL, NULL} #define BRANCH(s, a, b) {s, N(a), N(b)} int main() { Question base[] = { BRANCH("是哺乳动物吗？", 1, 4), BRANCH("比猫大吗？", 2, 3), LEAF("袋鼠"), LEAF("老鼠"), BRANCH("生活在水中吗？", 5, 6), LEAF("鳄鱼"), LEAF("知更鸟"), }; char anwser[MAX_STR]; root = base; printf("请在心里想好一种动物，让我来猜一猜/n"); for(;;) { if(question(root)) { printf("我猜对了！/n" "继续玩吗？" ); if (!anwswerIsYes()) break; } else { printf("我认输了，是什么？/n"); gets(anwser); rememberNewAnimal(anwser); printf("噢，我明白了/n" "退出游戏吗？"); if (anwswerIsYes()) break; } } destroyQuestions(); return 0; }