约瑟夫环问题(c语言) by链表

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
typedef struct person{
    int num;
    struct person* next;
}P;
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    P* ph=(P*)malloc(sizeof(P));//建个头(不存数据) 
    ph->next = NULL;
    P* a = ph;
    for(int i=0; i<n; i++)
    {
        P* p=(P*)malloc(sizeof(P));
        p->num = i+1;
        a->next = p;//连接 
        a = p;
        if(i!=n-1)
        {
            p->next = NULL;
        } else //使之成环 
        {
            p->next = ph->next;
        }            
    }
    a = ph->next;//从此处开始在环里转圈圈  O(∩_∩)O 
    
    int N=n, M=m,i=0;
    P* pre = NULL;
    while(N--)
    {
        if(M==1){
            M=m;//初始化 
        }
        while(M != 1)//每隔 m-1 个节点输出一下 
        {
            pre = a;//记住a停留过的上一个节点 
            a = a->next;
            M--;
        }
        printf("%d ",a->num);
        //把该节点从环中抛弃 
        a = a->next;
        pre->next = a;    
    }
    return 0;
}