1、　　有n个学生，每个学生有m门成绩，每个学生的m门成绩用一单链表实现，n个学生所对应n个单链表的头指针用一指针数组统一存放。

1)　　建立该存贮结构。

2)　　查找第i个学生的某门课成绩。

链表中结点结构：

struct node

{char *nam；/*nam为课程名*/

　 float sco；/*sco为该门课程的成绩*/

struct node *link；/*link为指向下一课程结点的指针*/

-1, there are n students, each student has m gate results, gate m of each student accomplishments to achieve with a single list, n corresponding to n students in single-linked list head pointer with a pointer array of unified storage. 1) the establishment of the storage structure. 2) Find the first i of a student success course. List of node structure: struct node (char* nam /* nam for the courses name*/float sco /* sco course for success*/struct node* link /* link to point to the next program node point pointer* /