NODE *p, *g, *h h null if(h=NULL)/如果是空链表 h=(NODE *)malloc(sizeof (NODE)) p p->number =1 //如果不是空链表 q=(NODE *)malloc(sizeof(NODE)) p->next =h: return h void Deal(NODE *h) NODE *p, *q while(p! =NULL & p->next!=p k=k+1; g->next p->next: printf(%d\t", p->number free(p)NODE *p,*q,*h; int i; i = N; h = NULL; p = NULL; while(i>0) { if(h==NULL) //如果是空链表 { h = (NODE *)malloc(sizeof(NODE)); p = h; p->number = i; } else //如果不是空链表 { q = (NODE *)malloc(sizeof(NODE)); q->number = i; p->next = q; p = q; } i--; } p->next = h; return h; } void Deal(NODE *h) { NODE *p,*q; int k; p = h; k=1; while(p!=NULL && p->next!=p) { q = p; p = p->next; k = k+1; if(k == M) { k = 0; q->next = p->next; printf("%d\t",p->number); free(p); p = q;