void search(NODE *head)
{
    char name[20];
    int i,k=0,j=0;
    int n;
    int q=0;
    int ii;
    printf("请输入姓名关键字：");
    getchar();
    gets(name);
    puts("请稍候，正在查找...\n");
    n=strlen(name);
   
   
    while(head!=NULL)
    {
        for(i=0;head->name[i]!='\0';i++)
        {
            if(head->name[i]==name[k])
            {
                j++;
                if(j==n)
                {
                    printf("%3d号 %20s \n评委评分为：\n",head->num,head->name);
                    for(ii=0;ii<9;ii++)
                    {
                        printf("%6.2f  ",head->score[ii]);
                        
                           
                    }
                    printf("\n");
                    break;
                }
               
                if(head->name[i+1]!=name[++k])
                {
                    j=0;
                    k=0;
                }
               
            }
            
            
        }
        if(head->name[i]!=name[k])
            printf("无此选手信息！\n");
        head=head->next;
        j=0,k=0;
    }

   
   
    return;

}

void search(NODE *head)
{
    char name[20];
    int i,k=0,j=0;
    int n;
    int q=0;
    int ii;
    printf("请输入姓名关键字：");
    getchar();
    gets(name);   //输入要查找的名字
    puts("请稍候，正在查找...\n");
    n=strlen(name);
   
   
    while(head!=NULL)
    {
        for(i=0;head->name[i]!='\0';i++)//从结构体中寻找名name对应的名字。
        {
            if(head->name[i]==name[k])//找到名字
            {
                j++;
                if(j==n)              //找到n次该名字，因为每个裁判给该名字一个分数
                {
                    printf("%3d号 %20s \n评委评分为：\n",head->num,head->name);
                    for(ii=0;ii<9;ii++)//将每个裁判给的分加起来
                    {
                        printf("%6.2f  ",head->score[ii]);
                        
                           
                    }
                    printf("\n");
                    break;
                }
               
                if(head->name[i+1]!=name[++k])   //寻找名字，若后一位的字符不相符，则表明未找到。继续寻找
                {
                    j=0;
                    k=0;
                }
               
            }
            
            
        }
        if(head->name[i]!=name[k])
            printf("无此选手信息！\n");
        head=head->next;
        j=0,k=0;
    }

   
   
    return;

}

谢谢