1234567891011121314151617181920212223242526272829303132333435 |
- #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(); // 函数返回链表第一个结点的地址
- printf("\nnum:%ld\nscore:%5.1f\n",pt->num,pt->score); // 输出第一个结点的成员值
- return 0;
- };
|