浙江大学c颜晖原版课件c9.pptVIP

(2) void free(void *ptr) 功能：释放由malloc()申请的动态内存空间，ptr存放该空间的首地址。 返回值：无。 p=(struct student *) malloc(sizeof(struct student)); …… free(p); 第二十九页，共46页。 2、建立链表 编写一个函数，要求用单向链表建立学生档案，从键盘输入数据，如果学号为0，输入结束，并返回链表的头指针。 struct student { long int num; float score; struct student *next; }； struct student *head, *tail, *p; head=tail=NULL; 第三十页，共46页。 struct student *head, *tail, *p; head=tail=NULL; size=sizeof(struct student); p = (struct student *) malloc(size); p num score next head tail p tail 第三十一页，共46页。 head=tail=NULL; input num, score while num!=0 p= (struct student *) malloc(sizeof(size)) p-num=num, p-score=score, p-next=NULL y head==NULL n head=p tail-next=p tail=p input num, score 第三十二页，共46页。 # include stdio.h struct student { int num; float score; struct student *next; }; struct student *creat( ); main( ) { struct student *head; head = creat( ); } 第三十三页，共46页。 struct student *creat() { struct student *head, *tail, *p; float score; int num, size = sizeof(struct student); head = tail = NULL; scanf(%d %f, num, score); while (num){ p = (struct student *)malloc(size); p-num = num; p-score = score; p-next = NULL; if(head == NULL) head = p; else tail-next = p; tail = p; scanf(%d %f, num, score); } return head; } 第三十四页，共46页。 3、遍历链表 ptr-num ptr-score head 9901 80 9902 90 9903 75 NULL ptr ptr for(ptr=head; ptr!=NULL; ptr=ptr-next) printf(“%ld, %f”, ptr-num, ptr-score); ptr=ptr-next 第三十五页，共46页。 # include stdio.h struct student { int num; float score; struct student *next; }; struct student *creat( ); void print(struct student *head) main( ) { struct student *head; head = creat(); print(head); } 第三十六页，共46页。 void print(struct student *head) { struct student *ptr; if(head == NULL){ printf(\n No list\n); retur