OJ.zip_循环链表

#include<stdio.h> #include<stdlib.h> typedef struct Node { int data; struct Node *next; }Node; typedef struct Node *LinkList; int main() { int i, m, n; LinkList L, p, s, temp; scanf("%d,%d",&n,&m); if(m!=0) { s=(LinkList)malloc(sizeof(Node)); s->data=1; p=s; L=s; for(i=2; i<=n; i++) { s=(LinkList)malloc(sizeof(Node)); s->data=i; p->next=s; p=s; } s->next=L; p=L; while(n--) { for(i=1; i<m; i++) { p=p->next; } if(p->next==p) printf("%d",p->next->data); else printf("%d,",p->next->data); temp=p->next; p->next=temp->next; free(temp); p=p->next; } } else { for(i=1; i<n; i++) { printf("%d,",i); } printf("%d",n); } return 0; }