约瑟夫问题

#include <stdio.h>
#include <stdlib.h>
 
typedef int datatype;
 
typedef struct Node {
    datatype data;
    struct Node* next;
}Node,*Looplink;
 
Looplink createCircularLinkedList(int n) {
    Looplink head = NULL;
    Looplink prev = NULL;
    
    for (int i = 1; i <= n; i++) {
        Looplink newNode = (Looplink)malloc(sizeof(Node));
        newNode->data = i;
        
        if (head == NULL) {
            head = newNode;
        } else {
            prev->next = newNode;
        }
        
        prev = newNode;
    }
    
    prev->next = head; // 将最后一个节点的next指针指向头节点，形成循环
    
    return head;
}
 
//约瑟夫环问题
void josephusCircle(Looplink *head, int start, int step) {
    Looplink curr = *head;
    Looplink prev = NULL;
    
    // 找到起始位置的节点
    while (curr->data != start) {
        prev = curr;
        curr = curr->next;
    }
    
    // 开始循环删除节点，直到只剩下一个节点
    while (curr->next != curr) {
        // 找到要删除的节点
        for (int i = 1; i < step; i++) {
            prev = curr;
            curr = curr->next;
        }
        
        // 删除节点
        prev->next = curr->next;
        Looplink temp = curr;
        curr = curr->next;
        free(temp);
    }
    
    *head = curr; // 更新头节点
}
 
//销毁
void list_free(Looplink L)
{
    //判断逻辑
    if(NULL==L)
    {
        printf("销毁失败\n");
        return ;
    }
 
    //如果不为空，就将所有结点释放
    while(!list_empty(L))
    {
        list_delete_tail(L);
    }
 
    //将头结点释放
    free(L);
    L = NULL;
 
    printf("释放成功\n");
    return ;
}
 
int main() {
    int n, start, step;
    printf("请输入总人数：");
    scanf("%d", &n);
    printf("请输入起始位置：");
    scanf("%d", &start);
    printf("请输入步长：");
    scanf("%d", &step);
    
    Looplink head = createCircularLinkedList(n);
    josephusCircle(&head, start, step);
    
    printf("最后剩下的节点为：%d\n", head->data);
    free(head);
	head = NULL;
    return 0;
}