用c语言实现链表瑟夫环

要实现链表的约瑟夫环，可以按照以下步骤进行：

1. 定义链表节点的结构体：

struct Node {
    int data;           // 节点数据
    struct Node* next;  // 指向下一个节点的指针
};

2. 创建链表并初始化：

struct Node* createList(int n) {
    struct Node* head = NULL;
    struct Node* curr = NULL;

    for (int i = 1; i <= n; i++) {
        struct Node* node = (struct Node*)malloc(sizeof(struct Node));
        node->data = i;
        node->next = NULL;

        if (head == NULL) {
            head = node;
            curr = node;
        } else {
            curr->next = node;
            curr = node;
        }
    }

    curr->next = head;  // 链表成环

    return head;
}

3. 实现约瑟夫环算法：

void josephusCircle(struct Node** head, int m, int k) {
    struct Node* curr = *head;

    // 找到起始节点
    while (--m) {
        curr = curr->next;
    }

    // 模拟删除k个节点，直到链表只剩下一个节点
    while (curr->next != curr) {
        for (int i = 1; i < k; i++) {
            curr = curr->next;
        }

        struct Node* temp = curr->next;
        curr->next = temp->next;
        free(temp);
    }

    *head = curr;  // 更新链表头节点
}

4. 测试代码：

#include <stdio.h>
#include <stdlib.h>

int main() {
    int n, m, k;
    printf("请输入总人数n：");
    scanf("%d", &n);
    printf("请输入起始报数位置m：");
    scanf("%d", &m);
    printf("请输入报数间隔k：");
    scanf("%d", &k);

    struct Node* head = createList(n);
    josephusCircle(&head, m, k);

    printf("最后留下的节点编号：%d\n", head->data);

    // 释放链表内存
    struct Node* curr = head->next;
    head->next = NULL;

    while (curr != NULL) {
        struct Node* temp = curr;
        curr = curr->next;
        free(temp);
    }

    return 0;
}

注意：以上代码仅提供了链表实现约瑟夫环的基本思路，未包含错误处理和边界情况的处理，请根据实际需求进行适当修改。