C数据结构循环链表实现约瑟夫环

#include<stdio.h>#include<conio.h>#define OK  1#define NULL 0typedef int status;typedef int  ElemType;typedef struct LNode{        ElemType data;        struct LNode *next;        }LNode,*LinkList;LinkList L;status CreateList_L(LinkList *L,int m){LNode *p,*q; int i; *L=(LinkList)malloc(sizeof(LNode)) ; q=*L; q->data=1; for(i=2;i<=m;i++) {p=(LinkList)malloc(sizeof(LNode));  p->data=i;  p->next=NULL;  q->next=p;  q=p; }  q->next=*L;  return OK;}status function(LinkList *L,int m,int n){LNode *p,*q;int i,j=1,k=1;p=*L;q=p;do{p=q->next;j++;if(j%n==0){printf("%3d",p->data);q->next=p->next;k++;free(p);}else q=p;}while(k<=m);return OK;}void main(){int m,n; clrscr(); gotoxy(5,8); printf("***************************************************/n"); gotoxy(5,9); printf("**** the list's length is :          ****/n"); gotoxy(35,9); scanf("%d",&m); gotoxy(5,10); printf("****the xunhuan's length is :         ****/n"); gotoxy(35,10); scanf("%d",&n); gotoxy(5,11); printf("***************************************************/n"); CreateList_L(&L, m); function(&L,m,n);}