题目内容
（请给出正确答案）
[主观题]
以下程序的功能是建立一个带有头结点的单向链表，链表结点中的数据通过键盘输入，当输入数据为-1时
，表示输入结束(链表头结点的data域不放数据，表空的条件是ph-＞next==NULL)，请填空。 include ＜stdio.h＞ struct list { int data;struct list *next;}; struct list *creatlist() { struct list *p,*q,*ph;int a;ph=(struct list*)malloc(sizeof(struct list)); p=q=ph;printf("Input an integer number;entre-1 to end:\n"); scanf("%d",＆a); while(a!=-1) { p=(struct list*)malloc(sizeof(struct list)); [14] =a;q-＞next=p; [15] =p;scanf("%d",＆a);} p-＞next=\0;return(ph);} main() {stuct list * head;head=creatlist();}
答案
查看答案
.jpg)
include ＜atdio.h＞ typedef struct node /*链表结点结构*/ { char sub[3]; struct node * next; } Node Node ~un(char s) /*建立链表*/ {......} void disp(Node * h) { Node * Ps p=h-＞next; while(【 】) { printf("%s\n",p-＞suh);p= 【 】;} } main() { Node * hd; hd = fun(); disp(hd) ;prinff(" \n" );.jpg)
include ＜stdio.h＞ include ＜stdlib.h＞ struct NODE { int data; struct NODE *next; }; main() { struct NODE *p,*q,*r; int sum=0; p=(struct NODE*)malloc(sizeof(struct NODE)); q=struct NODE*)malloc(sizeof(struct NODE)); r=(struct NODE*)malloc(sizeof(struct NODE)); p-＞data=100; q-＞data=200; r-＞data=300; p-＞next=q; q-＞next=r; r-＞next=p; sum=p-＞data+p-＞next-＞data+r-＞next-＞next 【 】; printf("%d\n",sum); }
