重新完善
#include <stdio.h>
#include <stdlib.h>

typedef struct Node
{
    int password;
    int sequence;
    struct Node* next;
}Link;

Link* Creat(Link* head, int* sequence);
Link* Find(Link* head, int password);
Link* Delete(Link* head, Link* target);


int main()
{
    int sequence = 0;
    int password = 0;
    int* pSequence = &sequence;
    Link* pHead = NULL;
    Link* pTarget = NULL;

    pHead = Creat(pHead,pSequence);

    printf("Please input a password:");
    scanf("%d",&password);
    pTarget = Find(pHead,password);
    if (pTarget)
    {
        printf("%d->",pTarget->sequence);
        password = pTarget->password;
        pHead = Delete(pHead,pTarget);
    }

    while (pHead != NULL)
    {
        pTarget = Find(pHead,password);
        if (pTarget)
        {
            printf("%d->",pTarget->sequence);
            password = pTarget->password;
            pHead = Delete(pHead,pTarget);
        }
        else
        {
            free(pHead);
            break;
        }
    }

    return 0;
}


Link* Creat(Link* head, int* sequence)
{
    Link* pNewNode = NULL;
    Link* pIter = NULL;
    int password = 0;

    while (scanf("%d",&password) != EOF)
    {
        pNewNode = (Link*)malloc(sizeof(Link));
        pNewNode->password = password;
        pNewNode->next = NULL;

        if (head == NULL)
        {
            head = pNewNode;
        }
        else
        {
            for (pIter=head; pIter->next!=NULL; pIter=pIter->next)
            {
                continue;
            }

            *sequence = *sequence + 1;
            pIter->next = pNewNode;
            pIter->sequence = *sequence;
        }
    }

    pNewNode->next = head;

    return head;
}

Link* Find(Link* head, int password)
{

    Link* pIter = head;Link* pIter2=head;
    for (; pIter!= NULL&&pIter->password!=password; pIter=pIter->next)
        if (pIter->next==pIter2)
        {
            if (pIter->password==password)
            {
                return pIter;
            }
            return NULL;
        }
    return pIter;
}

Link* Delete(Link* head, Link* target)
{
    Link* pIter = NULL;

    for (pIter=head; pIter->next!=target; pIter=pIter->next)
    {
        continue;
    }

    if (target->next == target)
    {
        printf("%d\n",target->sequence);
        head=NULL;
    }
    else
    {
        pIter->next = target->next;
        head = target->next;
    }

    free(target);

    return head;
}

你的sequence是这样的顺序啊（从head开始）：1,2,3,4,0（最后一节点根本没有赋值啊）
你的delete已经改变了你 head,所以更得不到你所想要的结果。


我看不出来你的算法！！！

你的算法与“约瑟夫环”相差甚远！！！

http://www.

我delete完了以后，就赋给新的head了

我就是一初学者，这个问题第一次接触，见谅了

我的原题和你的有点不同，我的原题是：N个人围成一个环，每个人手里一个密码；第一个密码随机定，遍历到对应人之后，该人退出，他手中的密码作为新密码，从下一个人开始再次循环；依次循环直到全部出列

晕 啊这个程序有点麻烦的慢慢研究 顺便灌水一下 嘿嘿有时间肯定帮你看
现在是凌晨5点就不能帮你了

这个循环不一定能进行得下去啊，得有条件限制。否则不可能保证所有人出列！

这个是循环链表，所以我感觉应该可以循环下去，只是环中如果只剩下一个人的时候，我处理不好，结果是指针指飞了；
你说的限制条件不怎么明白