约瑟夫问题

1.知识点：循环链表
2.题意：n个人进行编号，分别从1到n，排成一个圈，顺时针从1开始数到m，数到m的人被杀，剩下的人继续游戏，请输出最后一个人的编号
3.注意事项：注意删除节点的前后节点的指针域的指向变化

代码：

#include <stdio.h>
#include <stdlib.h>
struct peo
{
    int date;
    struct peo *next;
};//定义结构体
struct peo * num(int n)//定义顺序建循环链表函数, 注意返回值类型
{
    struct peo *head, *tail, *p;
    int i;
    p = (struct peo *)malloc(sizeof(struct peo));
    p -> date = 1;
    p -> next = NULL;
    head = p;
    tail = p;
    for(i = 2; i <= n; i++)
    {
        p = (struct peo *)malloc(sizeof(struct peo));
        p -> date = i;
        tail -> next = p;
        p -> next = NULL;
        tail = p;
        ///wrong answer:p = tail;
    }//顺序建链表
    tail -> next = head;//转化为循环链表
    return head;
}
int sur(struct peo * head, int n, int m)//进行约瑟夫问题, 注意返回值类型
{
    struct peo *q, *p;
    int count, a;
    count = 1;//根据题设条件灵活变通
    a = 0;
    q = head;
    while(a < n-1)//控制
    {
        p = q -> next;
        count ++;
        if(count % m == 0)
        {
            q -> next = p -> next;
            free(p);
            p = q -> next;
            a++;
        }//节点的删除问题
        else
            q = p;
    }
    return q -> date;//最后一个节点的数据域即为最优解
}
int main()
{
    int n, m;
    struct peo *head;
    scanf("%d %d", &n, &m);
    head = num(n);
    printf("%d\n", sur(head, n, m));
    return 0;
}