写一个函数建立一个有3名学生数据的单向动态链表。
解：程序：
#include<stdio.h>
#include<stdlib.h>
#define LEN sizeof(struct Student)
struct Student
{
long num;
float score;
struct Student *next;
};
int n;
struct Student *creat(void)//定义函数返回一个指向链表头的指针
{
struct Student *head;
struct Student *p1, *p2;
n = 0;
p1 = p2 = (struct Student *)malloc(LEN);
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, &p1->score);
}
p2->next=NULL;
return(head);
}
int main()
{
struct Student *pt;
pt = creat();//函数返回链表第1个结点的地址
printf("\nnum=%ld\nscore=%5.1f\n", pt->num, pt->score);//输出第1个结点的成员值
return 0;
}
结果：
1001,67
1003,89
1005,99
0,0
num=1001
score= 67.0
请按任意键继续. . .
时间： 2024-12-26 15:30:04