1

略

#include #include #include typedef struct Lnode{ int xh; char xm[100]; int cj; struct Lnode *next; }Lnode,*LinkList; void creat(LinkList &L){ L=(LinkList)malloc(sizeof(Lnode)); L->next=NULL; LinkList s,r=L; for(int i=1;i<=3;i++){ s=(LinkList)malloc(sizeof(Lnode)); s->xh=i; strcpy(s->xm,"student"); s->cj=90+i; r->next=s; r=s; } r->next=NULL; } void printL(LinkList L){ LinkList s; s=L->next; printf("%5d%10s%5d",s->xh,s->xm,s->cj); s=s->next; } main(){ LinkList L; creat(L); printL(L); }

1

fffff

typdef struct student {       // 结构体

     int num;

     char  name[30];

      float grade;

     struct student  *next;

}Stu;

void create( Stu *head) {

        Stu *p1, *p2;

        p1= (Stu*)malloc(struct student);

        p2 = (Stu*)malloc(struct student);

        head->next = p1;

        p1->next = p2;

}

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct Lnode{
    int xh;
    char xm[100];
    int cj;
    struct Lnode *next;
}Lnode,*LinkList;
void creat(LinkList &L){
    L=(LinkList)malloc(sizeof(Lnode));
    L->next=NULL;
    LinkList s,r=L;
    for(int i=1;i<=3;i++){
        s=(LinkList)malloc(sizeof(Lnode));
        s->xh=i;
        strcpy(s->xm,"student");
        s->cj=90+i;
        r->next=s;
        r=s;
    }
    r->next=NULL;

}
void printL(LinkList L){
    LinkList s;
    s=L->next;
    printf("%5d%10s%5d",s->xh,s->xm,s->cj);
    s=s->next;
}
main(){
    LinkList L;
    creat(L);
    printL(L);
}
 

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

// 定义学生结构体
struct Student {
    int id;             // 学号
    char name[50];      // 姓名
    float score;        // 成绩
    struct Student *next;  // 指向下一个节点的指针
};

// 创建链表的函数
struct Student* creat() {
    // 分配三个节点
    struct Student *head, *second, *third;

    // 创建第一个节点
    head = (struct Student*)malloc(sizeof(struct Student));
    head->id = 1;
    strcpy(head->name, "Alice");
    head->score = 90.5;
    
    // 创建第二个节点
    second = (struct Student*)malloc(sizeof(struct Student));
    second->id = 2;
    strcpy(second->name, "Bob");
    second->score = 85.0;
    head->next = second;

    // 创建第三个节点
    third = (struct Student*)malloc(sizeof(struct Student));
    third->id = 3;
    strcpy(third->name, "Charlie");
    third->score = 92.3;
    second->next = third;

    // 第三个节点指向NULL，表示链表结束
    third->next = NULL;

    return head;  // 返回链表头指针
}

// 输出第一个学生数据的函数
void printFirstStudent(struct Student *head) {
    if (head != NULL) {
        printf("第一个学生信息:\n");
        printf("学号: %d\n", head->id);
        printf("姓名: %s\n", head->name);
        printf("成绩: %.2f\n", head->score);
    } else {
        printf("链表为空！\n");
    }
}

int main() {
    struct Student *head;
    
    // 创建链表
    head = creat();

    // 输出第一个学生的数据
    printFirstStudent(head);

    // 释放链表内存
    struct Student *temp;
    while (head != NULL) {
        temp = head;
        head = head->next;
        free(temp);
    }

    return 0;
}
 

struct student *p1,*p2; n=0; p1=p2=(struct student *)malloc(LEN); ————————2分 scanf(“%ld,%f”,&p1->num,&p1->score); head=NULL; while(p1->num!=0) { n=n+1; if (n==1) head=p1; else p2->next=p1; p2=p1; p1=(struct student *)malloc(LEN); scanf(“%ld,%f”,&p1->num,&p2->score); ————————3分 } p2->next=NULL; return(head); } void main( ) { struct student *pt; pt=creat( ); printf(“\nnum:%ld\nscore:%5.1f\n”,pt->num,pt->score); ————————2分 }

include void creat() { struct Stu { int num; char name[10]; float score; struct Stu* next; } a = {2000," zhangsan",90.0}, b = {2001,"lisi",85.0}, c = {2002,"wangwu",70.0}; struct Stu* head, * p; head = &a; a.next = &b; b.next = &c; c.next = NULL; printf("%d %s %f", head->num, head->name, head->score); } int main() { creat();

#include “stdio.h”

#include “malloc.h”

#define NULL 0

#define LEN sizeof(struct student)

struct student

{

   long num;

   float score;

   struct student *next;                            ————————3分

} ;

int n;

struct student *creat(void)

{

   struct student * head;

   struct student *p1,*p2;

   n=0;

   p1=p2=(struct student *)malloc(LEN);          ————————2分

   scanf(“%ld,%f”,&p1->num,&p1->score);

   head=NULL;

   while(p1->num!=0)

    {

     n=n+1;

     if (n==1) head=p1;

     else p2->next=p1;

     p2=p1;

     p1=(struct student *)malloc(LEN);

     scanf(“%ld,%f”,&p1->num,&p2->score);         ————————3分

    }

   p2->next=NULL;

   return(head);

}

void main( )

{

   struct student *pt;

   pt=creat( );

   printf(“\nnum:%ld\nscore:%5.1f\n”,pt->num,pt->score);   ————————2分

}

struct Node {
    int num;
    char name[3]; // 修改为 char 数组，以存储字符串
    float score;
    struct Node* next;
};

struct Node* create() {
    struct Node* list = (struct Node*)malloc(sizeof(struct Node));
    list->next = NULL;
    return list;
}

struct Node* createNode(int num, const char name[], float score) { // 修改参数类型为 const char[]
    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
    newNode->num = num;
    strncpy_s(newNode->name, sizeof(newNode->name) ,name, sizeof(newNode->name)-1); // 确保不会越界
    newNode->name[sizeof(newNode->name) - 1] = '\0'; // 确保字符串以 '\0' 结束
    newNode->score = score;
    newNode->next = NULL;
    return newNode;
}

void insertNode(struct Node* list, int num, const char name[], float score) {
    struct Node* newNode = createNode(num, name, score);
    struct Node* pmove = list;
    while (pmove->next != NULL) {
        pmove = pmove->next;
    }
    newNode->next = pmove->next;
    pmove->next = newNode;
}

void Print(struct Node* list) {
    struct Node* pmove = list->next;
        printf("%d %s %f\n", pmove->num, puts(pmove->name), pmove->score);
        pmove = pmove->next;
    
}

int main() {
    struct Node* list = create();
    for (int i = 0; i < 3; i++) {
        insertNode(list, i + 1, "你好", i + 80);
    }
    Print(list);
    // 释放内存（此处略去，实际应用中应考虑）
    return 0;
}
 

#include <stdio.h>
void creat() {
    struct Stu
    {
        int num;
        char name[10];
        float score;
        struct Stu* next;
    }    a = {2000," zhangsan",90.0},
        b = {2001,"lisi",85.0},
        c = {2002,"wangwu",70.0};
    struct Stu* head, * p;
    head = &a;
    a.next = &b;
    b.next = &c;
    c.next = NULL;
    printf("%d %s %f", head->num, head->name, head->score);
}

int main() {
    creat();
    
}

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

// 定义学生数据结构
typedef struct Student {
    int id;            // 学号
    char name[50];     // 姓名
    float score;       // 成绩
    struct Student *next; // 指向下一个结点的指针
} Student;

// 创建链表的函数
Student *creat() {
    Student *head = NULL, *tail = NULL, *newNode = NULL;
    int i;

    // 创建三个学生节点
    for (i = 0; i < 3; i++) {
        newNode = (Student *)malloc(sizeof(Student));
        if (newNode == NULL) {
            fprintf(stderr, "内存分配失败。\n");
            exit(1);
        }

        // 假设这里我们手动设置学生数据
        newNode->id = i + 1; // 学号从1开始
        snprintf(newNode->name, sizeof(newNode->name), "Student%d", i + 1); // 姓名为"Student1", "Student2"等
        newNode->score = 90 + i; // 成绩从90开始递增

        if (head == NULL) {
            head = newNode; // 如果链表为空，则新节点为头节点
            tail = newNode;
        } else {
            tail->next = newNode; // 将新节点链接到链表尾部
            tail = newNode; // 更新尾部节点
        }
    }

    return head;
}

// 打印第一个学生的信息
void printFirstStudent(Student *head) {
    if (head != NULL) {
        printf("第一个学生的信息：\n");
        printf("学号：%d\n", head->id);
        printf("姓名：%s\n", head->name);
        printf("成绩：%.2f\n", head->score);
    }
}

int main() {
    Student *list = creat(); // 创建链表
    printFirstStudent(list); // 打印第一个学生的信息

    // 释放链表内存
    Student *temp;
    while (list != NULL) {
        temp = list;
        list = list->next;
        free(temp);
    }

    return 0;
}

typedef struct student{
    int num;
    char name[20];
    float score;
    struct student *next;   //指向下一个结点的指针
}Student;

Student *creat(){
    Student *head = (Student*)malloc(sizeof(Student));
    Student *p1 = (Student*)malloc(sizeof(Student));
    Student *p2 = (Student*)malloc(sizeof(Student));
    head->next = p1;
    p1->next = p2;
    p2->next = NULL;
    head->num = 1001;
    strcpy(head->name, "张三");
    head->score = 90.5;
    p1->num = 1002;
    p1->score = 85.6;
    p2->num = 1003;
    strcpy(p2->name, "王五");
    p2->score = 95.3;
    return head;
}

int main(){
    Student *head = creat();
    printf("学号：%d\n", head->num);
    printf("姓名：%s\n", head->name);
    printf("成绩：%.1f\n", head->score);
    return 0;
}

#include<stdio.h>

#include<stdlib.h>

typedef struct Student{

    int no;

    char name[20];

    float score;

    struct Student* next;

}Stu;

Stu* creat(int n)

{

    int i;

    Stu *head,*tail,*new_node;

    head=tail=new_node=NULL;

    for(i=0;i<n;i++)

    {

        new_node=(Stu*)malloc(sizeof(Stu));

        printf("请输入第%d个学生的学号：",i+1);

        scanf("%d",&new_node->no);

        printf("请输入第%d个学生的姓名：",i+1);

        scanf("%s",new_node->name);

        printf("请输入第%d个学生的成绩：",i+1);

        scanf("%f",&new_node->score);

        new_node->next=NULL;

        if(head==NULL)

        {

            head=new_node;

            tail=new_node;

        }

        else

        {

            tail->next=new_node;

            tail=new_node;

        }

    }

    return head;

}

int main()

{

    Stu *s=creat(3),*temp;

    //输出链表第一个学生

    if(s!=NULL)

    {

        printf("第一个学生的信息如下：\n");

        printf("学号：%d\n",s->no);

        printf("姓名：%s\n",s->name);

        printf("成绩：%.2f\n",s->score);

    }

    else

        printf("该链表为空！\n");

    //释放链表

    while(s!=NULL)

    {

        temp=s;

        s=s->next;

        free(temp);

    }

    return 0;

}

#include<stdio.h>

typedef struct student{
    int id;
    char name[10];
    int score;
    struct student *next;
}Stu;
void create(Stu *s)
{
    Stu *p=s;
    for(int i=0;i<3;i++)
    {
        Stu *q=(Stu *)malloc(sizeof(Stu));
        scanf("%d %s %d",&q->id,&q->name,&q->score);
        q->next=p->next;
        p->next=q;
        p=q;
    }
}
int main()
{
    Stu *s;
    s=(Stu *)malloc(sizeof(Stu));
    create(s);
    printf("%d %s %d",s->next->id,s->next->name,s->next->score);
}
 

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
struct student
{
    char xuehao[100];
    char xingming[10];
    int chengji;
    struct student *next;
}data[3];
int main()
{
    for(int i=0;i<3;i++)
    {
        scanf("%s",data[i].xuehao);
        scanf("%s",data[i].xingming);
        scanf("%d",&data[i].chengji);
        if(i!=2)
        data[i].next=&data[i+1];
        else data[i].next=NULL;
    }
    printf("%s\n%s\n%d\n",data[0].xuehao,data[0].xingming,data[0].chengji);
    return 0; 
}

#include <stdio.h>
#include <stdlib.h>
#define SIZE 20
typedef struct LNode {
    int id;
    char name[SIZE];
    float score;
    LNode *next;
} LNode, *LinkList;
LinkList create(void) { //带头结点的单链表
    LinkList L = (LinkList)calloc(1, sizeof(LNode));
    LNode *r  = L;
    for (int i = 0; i < 3; ++i) {
        LNode *s = (LNode *)calloc(1, sizeof(LNode));
        printf("Pleast Input id, name and score:");
        scanf("%d%s%f", &s->id, s->name, &s->score);
        r->next = s;
        r = s;
    }
    return L;
}
int main(void)
{
    LinkList L = create();
    LNode *p = L->next;
    int count = 1;
    while (p) {
        printf("Stduent.%d:\nid: %-10d  name: %-10s  score: %g\n", count++, p->id, p->name, p->score);
        p = p->next;
    }

    return 0;
}

#include<stdio.h>
#include <stdlib.h>
typedef struct Stu{
    struct Stu*next;
    int id;
    char name[10];
    int score;
}Stu;
void create(Stu *s)
{
    Stu *p = s;
    for(int i = 0;i < 3;i++)
    {
        Stu *q = (Stu *)malloc(sizeof(Stu));
        scanf("%d %s %d",&q->id,q->name,&q->score);//!!!
        q->next = p->next;
        p->next = q;
        p = q;
    }
}
int main()
{
    Stu *s;
    s = (Stu *)malloc(sizeof(Stu));
    create(s);//10 wan 19 20 he 50 21 liu 100
    printf("%d %s %d",s->next->id,s->next->name,s->next->score);
}

#include #include typedef struct Student{ struct Student *next; int num; char name[10]; int score; }Stu; void creat(Stu *s){ Stu *p=s; for(int i=0;i<3;i++){ Stu *temp=(Stu *)malloc(sizeof(Stu)); scanf("%d%s%d",&temp->num,temp->name,&temp->score); temp->next=p->next; p->next=temp; p=temp; } } int main(){ Stu *s=(Stu *)malloc(sizeof(Stu)); creat(s); printf("%d%s%d",s->num,s->name,s->score); }

#include<stdio.h>
#include <stdlib.h>
typedef struct Stu{
    struct Stu*next;
    int id;
    char name[10];
    int score;
}Stu;
void create(Stu *s)
{
    Stu *p = s;
    for(int i = 0;i < 3;i++)
    {
        Stu *q = (Stu *)malloc(sizeof(Stu));
        scanf("%d %s %d",&q->id,q->name,&q->score);//!!!
        q->next = p->next;
        p->next = q;
        p = q;
    }
}
int main()
{
    Stu *s;
    s = (Stu *)malloc(sizeof(Stu));
    create(s);//10 wan 19 20 he 50 21 liu 100
    printf("%d %s %d",s->next->id,s->next->name,s->next->score);
}

#include <stdio.h>

struct Student

{

    char name[20];

    float score;

    int num;

    struct Student *next;

};

int main()

{

    struct Student *create();

    struct Student *ptr = create();

    while (ptr)

    {

        printf("num:%d name:%s score:%f\n", ptr->num, ptr->name, ptr->score);

        ptr = ptr->next;

    }

}

struct Student *create()

{

    struct Student *stus = (struct Student *)malloc(sizeof(struct Student) * 3);

    for (int i = 0; i < 3; i++)

    {

        struct Student *stu = stus + i;

        printf("输入第%d个学生的学号:", i + 1);

        scanf("%d", &stu->num);

        printf("输入第%d个学生的姓名:", i + 1);

        scanf("%s", stu->name);

        printf("输入第%d个学生的成绩:", i + 1);

        scanf("%f", &stu->score);

        if (i < 2)

        {

            stu->next = stu + 1;

        }

    }

    return stus;

}

#include<stdlib.h>
#include<stdio.h>
typedef struct student
{
    int[10] number;
    char[10] name;
    int score;
    st next;
}*st,stu;

struct student* creat()
{
    st p = (st)malloc(sizeof(stu));
    p->next=NULL;
    st head=p;
    for(int i=0;i<3;i++)
    {
        st temp=(st)malloc(sizeof(stu));
        temp->next=NULL;
        scanf_s("%d%s%d",temp->number,temp->name,temp->score);
        p->next=temp;
        p=temp;
    }
    return head;
}

int main()
{
    st p = creat();
    p=p->next;
    printf("%d\n",p->number);
    printf("%s\n",p->name);
    printf("%d\n",p->score);
    return 0;
}

#include <stdio.h>
#include <stdlib.h>
struct Stu
{
    long studentID;
    char name[20];
    double score;
    struct Stu *next;
};
struct Stu *creat()
{
    struct Stu *head=NULL;
    struct Stu *temp=NULL;
    int i;
    
    for( i=0; i<3; i++)
    {
        //创建头节点，检查之后，使next指向空 
        struct Stu *newStu = (struct Stu*)malloc(sizeof(struct Stu)) ;
        printf("请输入第%d个学生的信息: \n", i+1);
        printf("学号： ");
        scanf("%ld", &(*newStu).studentID);   //==&newStu->studentID
        printf("姓名： ");
        scanf("%s", &newStu->name);
        printf("成绩： ");
        scanf("%lf", &newStu->score) ;
        
        newStu->next=NULL;
        if(head==NULL) 
        {
            head = newStu;
            temp = head;
        }else
        {
            temp->next = newStu;
            temp = newStu;
        }
        
    }
    return head;
}
int main()
{
    struct Stu *studentList = creat();
    
    if(studentList==NULL)
    {
        printf("链表为空\n");
        return 1;
    }
    printf("所有学生的信息： \n");
    
    //遍历链表并输出所有学生的信息
    struct Stu *current = studentList;
    while(current !=NULL) 
    {
        printf("学号：%ld\n", current->studentID);
        printf("姓名： %s\n", current->name);
        printf("成绩： %.2lf\n",(*current).score);
        
        current = current->next;
    }
    return 0;
}

#include <stdio.h>
#include <stdlib.h>
struct Stu
{
    long studentID;
    char name[20];
    double score;
    struct Stu* next;
};

struct Stu* creat()
{
    struct Stu* head = NULL;
    struct Stu* temp = NULL;
    
    for(int i = 0; i < 3; i++)
    {
        struct Stu* newStu = (struct Stu*)malloc(sizeof(struct Stu));
        
        printf("请输入第%d个学生的信息：\n", i+1);
        printf("学号：");
        scanf("%ld", &newStu->studentID);
        printf("姓名：");
        scanf("%s", newStu->name); 
        printf("成绩：");
        scanf("%lf", &newStu->score);
        
        newStu->next = NULL;
        
        if(head == NULL)
        {
            head = newStu;
            temp = head;
        }
        else
        {
            temp->next = newStu;
            temp = newStu;
        }
    }
    
    return head;
}

int main(void)
{
    struct Stu* studentList = creat();

    if (studentList == NULL)
    {
        printf("链表为空\n");
        return 1;
    }

    printf("所有学生的信息：\n");

    // 遍历链表并输出学生信息
    struct Stu* current = studentList;
    while (current != NULL)
    {
        printf("学号：%ld\n", current->studentID);
        printf("姓名：%s\n", current->name);
        printf("成绩：%.2lf\n", current->score);
        printf("\n");

        current = current->next; // 移动到下一个学生
    }

    return 0;
}

#include<stdio.h>
#include<stdlib.h>
struct Stu
{
	long num;
	char name[30];
	double score;
};
typedef struct S
{
	struct Stu data;
	struct S* next;
}N, * p;
p creat(p head,int x);
void show(p head,int x);
int main()
{
	p head = (p)malloc(sizeof(N));       // 创建头节点，检查之后，使next指向空！
	if (head == NULL)
	{
		printf("错误");
		exit(-1);
	}
	head->next = NULL;
	creat(head,3);  //创建子节点函数  creat（指针类型，需要创建的学生个数）；
	show(head,3);   //遍历链表函数，  show（指针类型，想要查找第几位的学生）；
	return 0;
}

p creat(p head,int x)
{
	for(int i = 0; i < x; ++i)
	{
		p node = (p)malloc(sizeof(N));
		if (node == NULL)
		{
			printf("错误");
			exit(-1);
		}
		node->next = NULL;
		printf("输入第%d位学生姓名：",i+1);
		scanf("%s",node->data.name);
		printf("输入学号：");
		scanf("%ld", &node->data.num);
		printf("输入成绩：");
		scanf("%lf", &node->data.score);
		while (head->next != NULL)
			head = head->next;
		head->next = node;
	}
	return head;
}

void show(p head,int x)
{
		
	for(int i = 0; i < x; ++i)      //结束循环的时候，heda正好在需要输出的节点地址上。
	{
		head = head->next;	
	}
	printf("姓名：%s", head->data.name);
	printf("，学号：%ld", head->data.num);
	printf("，成绩：%lf\n", head->data.score);

}

typedef struct Student{
    long ID;
    char theName[20];
    float score;
    struct Student *next;
}Student;

Student *creat() {
    //1.定义头节点
    Student *head=NULL;
    //2.添加子节点
    for (int i = 1; i <= 3; i++) {
        //2.1 分配空间
        Student *current=(Student*) malloc(sizeof (Student));
        //2.2 判空
        if(current==NULL){
            printf_s("分配内存失败！");
            exit(1);
        }
        //2.3 初始化数据
        printf_s("请输入第%d个学生的学号：",i);
        scanf_s("%ld",&current->ID);
        printf_s("请输入第%d个学生的姓名：",i);
        scanf_s("%s",current->theName);
        printf_s("请输入第%d个学生的成绩：",i);
        scanf_s("%f",&current->score);

        //2.4 赋值第一个学生为头节点
        if(head==NULL){
            head=current;
        } else{
            //2.5 找到上节点
            Student *temp=head;
            while (temp->next!=NULL){
                temp=temp->next;
            }
            temp->next=current;
        }
        //2.6 下节点赋值为空
        current->next=NULL;
        //2.7 分割符
        printf_s("==============================\n");
    }
    return head;
}


int main() {
    Student *students = creat();
    //输出
    if(students!=NULL){
        printf_s("第一个学生的学号：%ld\n",students->ID);
        printf_s("第一个学生的姓名：%s\n",students->theName);
        printf_s("第一个学生的成绩：%.2f\n",students->score);
    }
    //释放内存
    Student *current= students;
    while(current!=NULL){
        Student *temp=current;
        current=current->next;
        free(temp);
    }
    return 0;
}

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

struct stu {
    int     num;
    char    name[10];
    float   score;
    struct  stu* next;
};
struct stu* head, * tail;

void creat() {
    int i=1;
    while (i<=3) {
        printf("请输入第%d位学生的信息\n",i);
        printf("----------------------\n");
        struct stu* newNode = (stu*)malloc(sizeof(struct stu));// 
        printf("请输入学号：");
        scanf("%d", &newNode->num);
        if (newNode->num == 0)break;
        printf("请输入姓名：");
        scanf("%s", newNode->name);
        printf("请输入分数：");
        scanf("%f", &newNode->score);
        printf("\n");
        if (head == NULL && tail == NULL) {//始终让尾节点的后继为空 
            head = tail = newNode;
            tail->next = NULL;
        }
        else if (tail != NULL) {//始终让尾节点的后继为空 
            tail->next = newNode;
            tail = newNode;
            tail->next = NULL;
        }
        i++;
    }
    
}

main() {
    creat();
    int i,n;
    printf("请输入你想查询学生的序号：");
    scanf("%d",&n); 
    struct stu* p=head;
    for (i=1;i<n;i++) {
            p=p->next;
    }
    printf("学号：%d\n姓名：%s\n分数：%f\n", p->num, p->name, p->score);
    return 0;
}

#include<stdio.h>
#include<stdlib.h>
struct stu{
    int num;
    char name[10];
    float score;
};
struct Node{
    struct stu info;
    struct Node * next;
};
struct Node * Create(struct Node * head){
    head = (struct Node *) malloc(sizeof(Node));
    printf("please input the first student information\n");
    scanf("%d%s%f", &head->info.num, head->info.name, &head->info.score);
    int i;
    struct Node *p = head;
    for(i = 0; i < 2; ++i){
        printf("please input the following students information\n");
        struct Node *s = (struct Node *) malloc(sizeof(Node));
        scanf("%d%s%f", &s->info.num, s->info.name, &s->info.score);
        s->next = NULL;
        p->next = s;
        p = s;
    }
    return head;
}
int main(){
    struct Node * head;
    head = Create(head);
    int i;
    struct Node *p = head;
    printf("The %d number: name is %s, score is %f\n",p->info.num, p->info.name, p->info.score);
    return 0;
}

#include<Stdio.h>
#include<stdlib.h>
#include<string.h>
typedef struct student{
    int sno;
    char sname[20] ;
    float score;
    student *next;    
}student,*stu; 
//尾插法建立单链表
void Create(stu & L) {
    int x;
    char n[20];
    float g;  
    L = (student *)malloc(sizeof(student));
    student *s,*r=L;    //与头插法不同的是需要定义一个尾指针r，r始终指向单链表中最后一个结点
    
    scanf("%d%s%f",&x,&n,&g);
    for(int i=0;i<2;i++)
    {
        s = (stu)malloc(sizeof(student));
        s->sno = x;
        strcpy(s->sname,n);     
        s->score=g; 
        r->next=s;    //当前的尾结点指向s
        r = s;        //将s的值传给r，目的是将s作为当前的尾结点
        scanf("%d%s%f",&x,&n,&g);
    }
    r->next = NULL;    //插入完成后将r->next置空
}
int main(){
    stu L;
    Create(L);
    printf("%d,%s,%f",L->next->sno,L->next->sname,L->next->score);//输出第一个学生信息
    return 0;
}

#include <stdio.h>

void creat(int x, char y, float z) {
    typedef struct student {
        int numble;
        char name[20];
        float grade;
        student *next;
    } stuNode, *stulist;

    stuNode *s;
    s->numble = x;
    s->name[20] = y;
    s->grade = z;
    s->next = NULL;

    stulist l;
    l->next = NULL;

    s->next = l->next;
    l->next = s;
}

int main() {
    int i;
    int x = 0;
    char y[20];
    float z;
    for (i = 0; i < 3; i ++) {
        printf("please input numble!\n");
        scanf("%d", &x);
        printf("please input name!\n");
        scanf("%s", y);
        printf("please input grade!\n");
        scanf("%f", &z);
        creat(x, *y, z);
    }
    printf("%d", l->next->numble);
    return 0;
}

#include<stdio.h>
#include<stdlib.h>
#define len sizeof(struct student)
struct student
{
    int num;
    char name[10];
    float score;
    struct student *next;
};
int n;
int main()
{
    struct student *creat(void);
    struct student *head;
    head=creat();
    printf("%d %s %f",head->num,head->name,head->score);
    return 0;
}  
struct student *creat(void)
{
    struct student *p1,*p2,*head;
    n=0;
    p1=p2=(struct student*) malloc(len);
    scanf("%d %s %f",&p1->num,&p1->name,&p1->score);
    head=NULL;
    while(p1->num!=0)
    {
        n=n+1;
        if(n==1) head=p1;
        else p2->next=p1;
        p2=p1;
        p1=(struct student*) malloc(len);
        scanf("%d %s %f",&p1->num,&p1->name,&p1->score);
    }
    p2->next=NULL;
    return head;
}

#include <stdio.h>
#include <malloc.h>
typedef struct student{
    long stunum;
    char stuname[20];
    float score;
    struct student *next;
}stu,*students;
stu creat(){
    students s=(stu*)malloc(sizeof(stu));
    s->next=NULL;
    stu *head=s;
    for(int i=0;i<3;i++){
        stu *temp=(stu*)malloc(sizeof(stu));
        scanf("%f%s%f",temp->stunum,temp->stuname,temp->score);
        temp->next=s->next;
        s->next=temp;
        s=temp;
    }
    return head;
}
int main(){
    students st=creat();
    printf("%f%s%f",st->stunum,st->stuname,st->score);
    return 0;
}

#include “stdio.h”

#include “malloc.h”

#define NULL 0

#define LEN sizeof(struct student)

struct student

{

   long num;

   float score;

   struct student *next;                            ————————3分

} ;

int n;

struct student *creat(void)

{

   struct student * head;

   struct student *p1,*p2;

   n=0;

   p1=p2=(struct student *)malloc(LEN);          ————————2分

   scanf(“%ld,%f”,&p1->num,&p1->score);

   head=NULL;

   while(p1->num!=0)

    {

     n=n+1;

     if (n==1) head=p1;

     else p2->next=p1;

     p2=p1; 

     p1=(struct student *)malloc(LEN);

     scanf(“%ld,%f”,&p1->num,&p2->score);         ————————3分

    }

   p2->next=NULL;

   return(head);

} 

void main( )

{

   struct student *pt;

   pt=creat( );

   printf(“\nnum:%ld\nscore:%5.1f\n”,pt->num,pt->score);   ————————2分

}

typedef struct stu{
    float number;
    char name[20];
    float score;
    struct stu *next;
}*st, stu;

st creat(){
    st p = (stu*)malloc(sizeof(stu));
    p->next = NULL;
    stu *head = p;
    for(int i = 0; i < 3; i ++){
        stu *temp = (st)malloc(sizeof(stu));
        scanf("%f%s%f", temp->number,temp->name,temp->score);
        temp->next = p->next;
        p->next = temp;
        p = temp;
    }
    return head;
}
int main(){
    st t = creat();
    printf("%f %d %f",t->number,t->name,t->score);
    return 0;
}

#include<stdio.h>

#include<malloc.h>

//声明结构体

struct sdudent

{

    float xuehao;

    char name[20];

    float score;

    struct student *next;

};

//创建链表,包含头指针有三个节点的链表

struct student *creat(void)

{

    int i;

    struct sdudent *p = ( struct sdudent*)malloc(sizeof(struct sdudent));

    //声明指向头节点的指针

    struct sdudent *q = p;

    q->next=NULL;

    //创建链表

    for(i=0;i<3;i++){

        struct sdudent *a = ( struct sdudent*)malloc(sizeof(struct sdudent));

        printf("请输入第%d个同学的信息",i+1);

        scanf("%f,%s,%f",&a->xuehao,&a->name,&a->score);

        a->next = q->next;

        q->next=a;

        q=a;

    }

    return p;

};

void main(){

    struct sdudent *p;

    p=creat();

    printf("学号:%f,  姓名:%s, 成绩:%f",p->xuehao,p->name,p->score);

}

#include <stdio.h>
#include <malloc.h>

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

struct student{
    int num;
    char name[10];
    float score;
    student *next;
}

int n;

struct student *creat(){
    struct student *head=NULL;
    struct student *p1,*p2;
    p1 = (struct student *)malloc(LEN);
    scanf("%d,%s,%f",&p1->num,&p1->name,&p1->score);
    while(p1->num!=0){
        n++;
        if(n==1)
            head = p1;
        else
            p2->next = p1;
        p2 = p1;
        p1 = (struct student *)malloc(LEN);
        scanf("%d,%s,%f",&p1->num,&p1->name,&p1->score);
    }
    p2->next = NULL;
    return head;
}

void main(){
    struct student *head;
    head = creat();
    printf("%d,%s,%f",head->num,head->name,head->score);
}

#include <stdio.h>
#include <malloc.h>
#define LEN sizeof(struct student)
struct student{
    int num;
    char name[10];
    float score;
    struct student *next;
};
int n;
struct student * creat(){
    struct student *head;
    struct student *p1,*p2;
    n=0;
    p1=p2=(struct student *)malloc(LEN);
    scanf("%ld %s %f",&p1->num,&p1->name,&p1->score);
    head=NULL;
    while(p1->num!=0||p1->score!=0){  //p1->name!=NULL||p1->name!=" "||  
        n=n+1;
        if(n==1) head=p1;
        else p2->next=p1;
        p2=p1;
        p1=(struct student *)malloc(LEN);
        scanf("%ld %s %f",&p1->num,&p1->name,&p1->score);
    }
    p2->next=NULL;
    return head;
}
void print(struct student *head){
    struct student *p;
    printf("\nNow,these %d records are:\n",n);
    p=head;
    if(head!=NULL)
        do{
            printf("%ld %s %5.1f\n",p->num,p->name,p->score);
            p=p->next;
        }while(p!=NULL);
}
int main(){
    struct student *head;
    head=creat();
    print(head);
    return 0;
}

#include “stdio.h”

#include “malloc.h”

#define NULL 0

#define LEN sizeof(struct student)

struct student

{

   long num;

   float score;

   struct student *next;                            ————————3分

} ;

int n;

struct student *creat(void)

{

   struct student * head;

   struct student *p1,*p2;

   n=0;

   p1=p2=(struct student *)malloc(LEN);          ————————2分

   scanf(“%ld,%f”,&p1->num,&p1->score);

   head=NULL;

   while(p1->num!=0)

    {

     n=n+1;

     if (n==1) head=p1;

     else p2->next=p1;

     p2=p1;

     p1=(struct student *)malloc(LEN);

     scanf(“%ld,%f”,&p1->num,&p2->score);         ————————3分

    }

   p2->next=NULL;

   return(head);

}

void main( )

{

   struct student *pt;

   pt=creat( );

   printf(“\nnum:%ld\nscore:%5.1f\n”,pt->num,pt->score);   ————————2分

}

#include<stdio.h>

typedef struct student{
    int snum;
    char sname[10];
    int score;
    struct student *next;
}Student;

Student *create(Student *stu1,Student *stu2,Student *stu3){
    stu1->next = stu2;
    stu2->next = stu3; 
}

int main(){
    Student stu3 = {3, "zhangsan", 89, NULL};
    Student stu2 = {2, "zhaoer", 88, NULL};
    Student stu1 = {1, "liuneng", 87, NULL};
    Student *head = create(&stu1,&stu2,&stu3);
    printf("id:%d, name:%s, score:%d\n", head->snum, head->sname, head->score);
    return 0;
}

#include<stdio.h>

typedef struct student{
    int id;
    char name[20];
    int score;
    struct student *next;
} Student;

Student *create(Student * stu1, Student * stu2, Student * stu3){
    stu1->next = stu2;
    stu2->next = stu2;
    return stu1;
}

int main(){
    Student stu3 = {3, "zhangsan", 89, NULL};
    Student stu2 = {2, "zhaoer", 88, NULL};
    Student stu1 = {1, "liuneng", 87, NULL};

    Student *head = create(&stu1, &stu2, &stu3);
    printf("id:%d, name:%s, score:%d\n", head->id, head->name, head->score);
    return 0;
}