[编程入门]链表之报数问题-题解(C语言代码)

参考代码如下：
#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int seq;
    struct node *next;
}Node,*node;
node creat(int n)
{
    node p,q,h;
    int i=1,j=0;
    q = (node)malloc(sizeof(Node));
    q->next = q;
    p = q;
    q->seq = i;
    for(j=1;j<n;j++,i++)
    {
        h = (node)malloc(sizeof(Node));
        h->seq = i+1;
        h->next = q->next;
        q->next = h;
        q = h;
    }
    return p;
}
int main()
{
    node p,f,s;
    int n,i;
    scanf("%d",&n);
    f = creat(n);
    s = f->next;
    f = f->next;
    s = s->next;
    s = s->next;
    f->next = s;
    while(f != s)
    {
        for(i=0;i<2;i++)
        {
            f = f->next;
            s = s->next;
        }
        s = s->next;
        f->next = s;
    }
    printf("%d",s->seq);
}