女生学网站设计,青浦网站制作,想做外贸去哪个网站做,网络营销案例论文链表创建与插入结点#xff08;填空#xff09;
Time Limit:1000MS Memory Limit:65535K
题型: 填空题 语言: G;GCC;VC 描述
代码实现先创新一个链表#xff0c;然后显示该链表#xff0c;之后插入一个结点#xff0c;再显示插入结点的链表。
请填空#xff0c;完成…链表创建与插入结点填空
Time Limit:1000MS Memory Limit:65535K
题型: 填空题 语言: G;GCC;VC 描述
代码实现先创新一个链表然后显示该链表之后插入一个结点再显示插入结点的链表。
请填空完成该代码 #include stdio.h #include malloc.h #define LEN sizeof(struct student) struct student { long num; int score; struct student *next; }; struct student *create(int n) { struct student *headNULL,*p1NULL,*p2NULL; int i; for(i1;in;i) { p1(struct student *)malloc(LEN); scanf(%ld,p1-num); scanf(%d,p1-score); p1-nextNULL; if(i1) headp1; else p2-nextp1; p2p1; } return(head); } void print(struct student *head) { struct student *p; phead; while(p!NULL) { printf(%ld\t%d,p-num,p-score); pp-next; printf(\n); } } struct student *insert(struct student *head, struct student *stud) { struct student *p0,*p1,*p2; p1head; p0stud; if(headNULL) {_______________________;} else { while( (p0-num p1-num) (p1-next!NULL) ) { p2p1; _______________________; } if( p0-num p1-num ) { if( headp1 ) headp0; else p2-nextp0; p0-nextp1; } else { p1-nextp0;} } return(_______________________); } int main() { struct student *head,*stu; int n; scanf(%d,n); head_______________________; print(head); stu(struct student *)malloc(LEN); scanf(%ld,stu-num); scanf(%d,stu-score); stu-next NULL; headinsert(head,stu); print(head); return 0; }
#include stdio.h
#include malloc.h
#define LEN sizeof(struct student)struct student
{long num;int score;struct student *next;
};struct student *create(int n)
{struct student *head NULL, *p1 NULL, *p2 NULL;int i;for (i 1; i n; i){p1 (struct student *)malloc(LEN);scanf(%ld, p1-num);scanf(%d, p1-score);p1-next NULL;if (i 1)head p1;elsep2-next p1;p2 p1;}return head;
}void print(struct student *head)
{struct student *p head;while (p ! NULL){printf(%ld\t%d, p-num, p-score);p p-next;printf(\n);}
}struct student *insert(struct student *head, struct student *stud)
{struct student *p0 stud, *p1 head, *p2 NULL;if (head NULL){head p0;}else{while ((p0-num p1-num) (p1-next ! NULL)){p2 p1;p1 p1-next;}if (p0-num p1-num){if (head p1){head p0;}else{p2-next p0;}p0-next p1;}else{p1-next p0;}}return head;
}int main()
{struct student *head, *stu;int n;scanf(%d, n);head create(n);print(head);stu (struct student *)malloc(LEN);scanf(%ld, stu-num);scanf(%d, stu-score);stu-next NULL;head insert(head, stu);print(head);return 0;
}
