用C语言构建高效、清晰思路的嵌入式程序：猴子选大王问题解析

printf("input total num:");scanf("%d", &n);printf("from which num begin:");scanf("%d", &k);if(k > n || k == 0) {    printf("please input the right begin num");    return 1; }printf("input the out num:");scanf("%d", &m);if(m > n || m == 0) {     printf("please input the right del num");    return 2; }

typedef struct node {    int data;    struct node *next;} linklist;
/* 创建循环链表，头节点也存信息 */linklist *head = (linklist*)malloc(sizeof(linklist));linklist *p = head;p->data = 1;p->next = p;
/* 初始化循环链表 */for (int i = 2; i <= n; i++) {    linklist *s = (linklist*)malloc(sizeof(linklist));    s->data = i;    s->next = p->next;    p->next = s;    p = p->next;}

/* 找到第 k 个节点 */p = head;for (int i = 1; i <= k; i++) {    p = p->next;}

/* 保存节点总数 */int total = n;printf("\nthe out num:");linklist *q = head;

/* 只剩一个节点时停止循环 */while (total != 1) {    /* 报数过程，p指向要删除的节点 */    for (int i = 1; i < m; i++) {        p = p->next;    }
    /* 打印要删除的节点序号 */    printf("[%d] ", p->data);
    /* q 指向 p 节点的前驱 */    while (q->next != p) {        q = q->next;    }
    /* 删除 p 节点 */    q->next = p->next;
    /* 保存被删除节点指针 */    linklist *s = p;
    /* p 指向被删除节点的后继 */    p = p->next;
    /* 释放被删除的节点 */    free(s);
    /* 节点个数减一 */    total--;}
/* 打印最后剩下的节点序号 */printf("\n\nthe last num:[%d] \n\n", p->data);free(p);