第一次做約瑟夫環問題，歡迎大家來找茬~
如果做單迴圈連結串列時有點暈了，要畫圖要畫圖要畫圖，重要的事講三遍，因為真的是很好的方法。

#include<stdio.h>
#include<stdlib.h>

typedef struct link
{
    int data;
    struct link *next;
}Circle,*Circlepoint;

Circlepoint Create(Circlepoint head)
{
    int n,i,num,x;
    Circlepoint p;
    head=(Circlepoint)malloc
 
(sizeof(Circle));
    head->next=NULL;
    printf("輸入元素個數:\n");
    scanf("%d",&n);
    Circlepoint s,r=head;
    printf("輸入表元素:\n");
    for(i=0;i<n;i++)
    {
        scanf("%d",&num);
        s=(Circlepoint)malloc(sizeof(Circle));
        s->data=num;
        //printf("%d     %d\n",i,s->data);
 

        r->next=s;
        r=s;
    }
    r->next=head->next;
    printf("指定從哪個數字開始：");
    scanf("%d",&x);
    p=head->next;
    while(p->data!=x)
    {
        p=p->next;
    }
    head->next=p;//改變頭指標位置
    return head;
}

void show(Circlepoint head)
{
    Circlepoint p;
    p=head;
    for
 
(p=head->next;p->next!=head->next;p=p->next)
    {
        printf("%d\t",p->data);
    }
    printf("%d\t",p->data);
    printf("\n\n");

}


Circlepoint Delete_(Circlepoint head,int n)
{
        Circlepoint p,r;
        int i;
        p=head;
        while(p->next!=p) //迴圈連結串列中只剩下一個節點
        {   
            for(i=0;i<n-1;i++)
            {
                p=p->next;
            }
            r=p->next; //刪除節點語句1
            p->next=r->next;//刪除節點語句2，不要寫反啦
            printf("%d",r->data);
            head->next=p->next;
        }
        return head;

}

函式部分完畢。
拜了個拜~