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

#define NULL 0
#define LEN sizeof(struct student)

//定义节点结构
struct student
{
    char no[7];
    int score;
    struct student *next;
};

//create()函数：创建一个具有头结点的单链表
//返回值：返回单链表的头指针

struct student *create(void)
{
    struct student *head=NULL,*p1,*p2=NULL;
    int count=0;
    while(1)
    {
        p1=(struct student *)malloc(LEN);

        printf("编号%d：",count+1);
        scanf("%6s",p1->no);
        if(strcmp(p1->no,"000000")==0)
        {
            free(p1);
            break;
        }

        printf("成绩%d:",count+1);
        
        scanf("%d",&p1->score);
        count++;

        p1->next=NULL;

        if(count==1)
            head=p1;
        else
            p2->next=p1;
        p2=p1;
    }
    return(head);
}
void print(struct student *head)
{
    struct student *p;
    printf("学生们的成绩是：\n");
    p=head;
    while(p!=NULL)
    {
        printf("%s,%d\n",p->no,p->score);
        p=p->next;
    }
}
struct student *FindNode(struct student *head,int i)//依节点查找
{
    struct student *p=head;
    int j=1;
    while(p->next!=NULL&&i>j)
    {
        p=p->next;
        j++;
    }
    if(i==j)
        return p;
    else
        return NULL;
}
struct student *Find(struct student *head,char *key)//依值查找
{
    struct student *p=head;
    while(p!=NULL)
        if(strcmp(p->no,key)!=0)
            p=p->next;
        else
            break;
    return p;
}
void main()
{
    int *ch;
    struct student *pt;
    pt=create();


    print(pt);    
    scanf("%s",ch);
    
    pt=Find(pt,ch);
    printf("%s,%d\n",pt->no,pt->score);

}

//求解 ，运行的 时候，出现了错误
//是什么原因呢

主函数里面的*ch类型应该定义成char,,而且你写的*Find函数有问题,,输入学号查找不了,,应该是那个字符串指针传来传去的没按定义的用,,水平有限,,坐等大牛

创建链表函数最后要加p2->next=NULL;当年输入p1->no="00000"时，创建链表结束，此时p2为尾节点，它应指向为空，若不然，链表不知道如何结束

把主函数的ch类型改了，另外 pt=Find(pt,ch);当ch不存在于链表中的时候，返回的是NULL指针，这样你接下来打印是肯定错的，
if（pt==NULL） printf("不存在");
else
printf("%s,%d\n",pt->no,pt->score);

p1->next=NULL;

        if(count==1)
            head=p1;
        else
            p2->next=p1;
        p2=p1;
每次创建一个节点的时候，next指针都被给了NULL值，所以链表是知道结尾的

没有给ch开辟内存空间，导致错误
int ch[5];
这样定义就可以了

主函数里面的*ch类型应该定义成char

#include<stdio.h>
 #include<stdlib.h>
 #include<string.h>
 
#define NULL 0
 #define LEN sizeof(struct student)
 
//定义节点结构
 struct student
 {
     char no[7];
     int score;
     struct student *next;
 };
 
//create()函数：创建一个具有头结点的单链表
 //返回值：返回单链表的头指针
 
struct student *create(void)
 {
     struct student *head=NULL,*p1,*p2=NULL;
     int count=0;
     while(1)
     {
         p1=(struct student *)malloc(LEN);
 
        printf("编号%d：",count+1);
         scanf("%6s",p1->no);
         if(strcmp(p1->no,"000000")==0)           // 比较字符长度
         {
             free(p1);
             break;
         }
 
        printf("成绩%d:",count+1);
         
         scanf("%d",&p1->score);
         count++;
 
        p1->next=NULL;
 
        if(count==1)
             head=p1;
         else
             p2->next=p1;
         p2=p1;
     }
     return(head);
 }
 void print(struct student *head)
 {
     struct student *p;
     printf("学生们的成绩是：\n");
     p=head;
     while(p!=NULL)
     {
         printf("%s,%d\n",p->no,p->score);
         p=p->next;
     }
 }
 struct student *FindNode(struct student *head,int i)//依结点查找
 {
     struct student *p=head;
     int j=1;
     while(p->next!=NULL&&i>j)
     {
         p=p->next;
         j++;
     }
     if(i==j)
         return head;
     else
         return NULL;
 }
 struct student *Find(struct student *head,char *key)//依值查找
 {
     struct student *p=head;
     while(p!=NULL)
     {
         if(key != p->no && p->no !=NULL)     // 要找到相应的值，当然用strcmp比较长度是不能实现的，  
                                              //
             p=p->next;           
     }
     if(key == p->no)
         strcpy(p->no, key);
     
     return head;
 }
 void main()
 {
     char *ch;
     struct student *pt;
     pt=create();
 

    print(pt);
    printf("输入查找的值：");
    scanf("%s",&ch);            // scanf函数的使用
   
    pt=Find(pt,ch);
    printf("%s,%d\n",pt->no,pt->score);
 
}
 
唉，指针，内存很难掌握。但是更加要去用它。希望大家能继续努力找错更加多的错误