C - 数据结构 - 线性表 - 练习7.docxVIP

原文：/2354544626/blog/1330497855/2354544626/blog/1330497855作者：云艾曦用一个循环单向链表实现约瑟夫问题。输入n,m，n表示人数，编号为1-n，m表示每次去掉第m个人。输出最后那个人的编号。输入文件(test.in):7 20输出文件(test.out):4参考代码//list_7.c#include stdio.htypedef struct L{int id;struct L *next;}node,*list;void create(list *L,int n){int i;*L = NULL;node *p = *L,*q; for(i = 1;i = n;++ i){node *newnode = (node *)malloc(sizeof(node));newnode-id = i;newnode-next = *L;if(NULL == p){p = newnode;p-next = newnode;*L = p;}else{p-next = newnode;p = p-next;p-next = *L;}}}void move(list *l,int m,int n){int i = 1,mm = m;node *p = *l,*q,*r = *l;while(*l != r-next){r = r-next;}