c语言猴子选大王链表
时间: 2023-12-07 14:39:39 浏览: 77
以下是使用C语言链表实现猴子选大王的代码:
```c
#include <stdio.h>
#include <stdlib.h>
typedef struct node {
int num;
struct node *next;
} Node;
Node *create_list(int n) {
Node *head = NULL, *tail = NULL;
for (int i = 1; i <= n; i++) {
Node *new_node = (Node *)malloc(sizeof(Node));
new_node->num = i;
new_node->next = NULL;
if (head == NULL) {
head = new_node;
tail = new_node;
} else {
tail->next = new_node;
tail = new_node;
}
}
tail->next = head;
return head;
}
int monkey_king(Node *head, int m) {
Node *p = head, *q = NULL;
while (p->next != p) {
for (int i = 1; i < m; i++) {
q = p;
p = p->next;
}
q->next = p->next;
printf("%d ", p->num);
free(p); p = q->next;
}
printf("\n");
return p->num;
}
int main() {
int n, m;
printf("请输入猴子的数量n和报数的数字m:");
scanf("%d %d", &n, &m);
Node *head = create_list(n); int king = monkey_king(head, m);
printf("大王的编号是:%d\n", king);
return 0;
}
```