有以下程序 include struct NODE{ int num; struct NODE *next;}; main( ) 有以下程序#include ＜stdlib.h＞struct NODE{int num;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-＞num=1;q-＞num=2;r-＞num=3;p-＞next=q;q-＞next=r;r-＞next=NULL;sum+=q-＞next-＞num;sum+=p-＞num;printf(“%d\n”,sum);}执行后的输出结果是A．3B．4C．5D．6
有以下程序 include struct NODE{ int num; struct NODE *next;}; main( )
有以下程序
#include ＜stdlib.h＞
struct NODE{
int num;
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-＞num=1;q-＞num=2;r-＞num=3;
p-＞next=q;q-＞next=r;r-＞next=NULL;
sum+=q-＞next-＞num;sum+=p-＞num;
printf(“%d\n”,sum);}
执行后的输出结果是
A．3
B．4
C．5
D．6
相关考题：
有以下程序: inClude structNODE{ int num; structNODE*next; }; main() {StructN00E 有以下程序：#inClude ＜stdlib.h＞struct NODE{int num；struct NODE *next；}；main(){ Struct N00E *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-＞num=1；q-＞num=2；r-＞num=3；p-＞next=q；q-＞next=r；r-＞next=NULL；sum+=q-＞next-＞num；sum+=p-＞num；printf("%d\n"，sum)；}执行后的输出结果是A．3B．4C．5D．6
有以下程序: include include struct NODE {int num;struct NODE *next; } 有以下程序：#include ＜stdio.h＞#include ＜stdlib.h＞struct NODE{ int num;struct NODE *next;};main(){ struet NODE *p,*q,*r;int sum=0;p=(struct NODE *) malloc(sizeof(struct NODE));q=(struct NODE *) malloc(sizeof(struet NODE));r=(struct NODE *) malloc(sizeof(struct NODE));P- ＞num=1;q- ＞num=2;r-＞num=3;p- ＞next=q;q- ＞next=r;r- ＞next=NULL;sum + =q- ＞next- ＞num;sum + =P- ＞num;printf("%d\n",sum);}执行后的输出结果是( )A．3B．4C．5D．6
有以下程序 include struct NODE {int num;stmct NODE*next;}; main() { struct NODE 有以下程序#include＜stdlib．h＞struct NODE{ int num；stmct NODE*next；}；main(){ struct NODE*p，*q，*r；p=(struct NODE*)malloc(sizeof(struct NODE))；q=(struct NODE*)malloc(sizeof(struct NODE))；r=(struct NODE*)malloc(sizeof(struct NODE))；p-＞num=10；q-＞num=20；r-＞num=30；p-＞next=q；q-＞next=r；printf(“%d\n”，p-＞num+q-＞next-＞num)；}程序运行后的输出结果是A．10B．20C．30D．40
下列给定程序中，是建立一个带头结点的单向链表，并用随机函数为各结点数据域赋值。函数fun的作用是求出单向链表结点(不包括头结点)数据域中的最大值，并且作为函数值返回。请改正程序指定部位的错误，使它能得到正确结果。[注意] 不要改动main函数，不得增行或删行，也不得更改程序的结构。[试题源程序]include＜stdio.h＞include＜stdlib.h＞typedef struct aa{int data;struct aa *next;}NODE;fun(NODE *h){int max=-1;NODE *p;/***********found************/p=h;while(p){if(p-＞data＞max)max=p-＞data;/************found************/p=h-＞next;}return max;}outresult(int s, FILE *Pf){fprintf(pf, "\nThe max in link: %d\n", s);}NODE *creatlink(int n, int m){NODE *h, *p, *s, *q;int i, x;h=p=(NODE *)malloc(sizeof(NODE));h-＞data=9999;for(i=1; i＜=n; i++){s=(NODE *)malloc(sizeof(NODE));s-＞data=rand()%m; s-＞next=p-＞next;p-＞next=s; p=p-＞next;}p-＞next=NULL;return h;}outlink(NODE *h, FILE *pf){NODE *p;p=h-＞next;fprintf(Pf, "\nTHE LIST:\n\n HEAD");while(P){fprintf(pf, "-＞%d", P-＞datA); p=p-＞next;}fprintf(pf, "\n");}main(){NODE *head; int m;head=cteatlink(12,100);outlink(head, stdout);m=fun(head);printf("\nTHE RESULT"\n");outresult(m, stdout);}
有以下程序: include struct NODE { int num; struct NODE*next; }; main() { struct 有以下程序：#include ＜stdlib.h＞struct NODE{ int num; struct NODE *next; };main(){ struct NODE *p,*q,*r;p=(struct NODE*)malloc(sizeof(struct NODE))；q=(struct NODE*)mallloc(sizeof(struct NODE))；r=(struct NODE*)malloc(sizeof(struct NODE))；p-＞num=10;q-＞num=20; r-＞num=30;p-＞next=q;q-＞next=r;printf("%d\n",p-＞num+q-＞next-＞num);}程序运行后的输出结果是( )。A．10B．20C．30D．40
有以下程序 include gtruet NODE {intnum;struct NODE *next;}; main() {struct NODE 有以下程序#include ＜stdlib.h＞gtruet NODE{ int num; struct NODE *next; };main(){struct NODE *p,*q,*r;p=(struct NODE*)malloc(sizeof (struct NODE));q=(struct NODE*)malloc(sizeof (struct NODE));r=(struct NODE*)malloc(sizeef (struct NODE));p-＞num=10; q-＞num=20; r-＞num=30;p-＞next=q; q-＞next-r;printf("%d\n",p-＞num+q-＞next-＞num);}程序运行后的输出结果是A．10B．20C．30D．50
有以下程序 include struct NODE { int num;struct NODE*next;}; main() { struct NO 有以下程序#include＜stdlib.h＞struct NODE{ int num；struct NODE*next；}；main(){ struct NODE*p，*q，*r；p=(struct NODE*)malloc(sizeof(struct NODE))；q=(struct NODE*)malloc(sizeof(struct NODE))；r=(struct NODE*)malloc(sizeof(struct NODE))；p-＞num=10；q-＞num=20；r-＞num=30；p-＞next=q；q-＞next=r；printf("%d\n"，p-＞num+q-＞next-＞num)；}程序运行后的输出结果是A．10B．20C．30D．40
有以下程序: include struct NODE {int num;stmct NODE *next;}; main( ) { str 有以下程序：#include＜stdlib.h＞struct NODE{ int num；stmct NODE *next；}；main( ){ struct NODE * p， * q，* r；p=(struct NODE * )malloc(sizeof(struct NODE) )；q=(struct NODE * )malloc(sizeof(struct NODE) )；r=(struct NODE * )malloc(sizeof(struct NODE) )；p-＞num=10； q-＞num=20； r-＞num=30；p-＞next=q； q-＞next=r；printf("%d\n"，p-＞num+q-＞next-＞num)；}程序运行后的输出结果是A．10B．20C．30D．40
有以下程序 include struct NODE {int num;struct NODE*next;} main() {struct NODE 有以下程序#include＜stdlib.h＞struct NODE{int num；struct NODE*next；}main(){struct NODE *P，*q，*r；p＝(struct NODE *)malloc(sizeof(struct NODE))；q=(struct NODE *)malloc(sizeof(struet NODE))；r=(struct NODE*)malloc(sizeof(struct NODE))：p-＞num＝10；q-＞num＝20；r-＞num＝30；p-＞next=q；q-＞next=r；printf("%d\n"，p-＞num+q-＞next-＞num)：}程序运行后的输出结果是( )A．10B．20C．30D．40
有以下程序: include struct NODE{int nurn;struct NODE *next; }; main() { struct 有以下程序：#include ＜stdlib.h＞struct NODE{int nurn;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-＞num=1;q-＞num=2;r-＞num=3;p-＞next=q;q-＞next=r;r-＞next=NULL;sum+=q-＞next-＞num;sum+=p-＞num;Printf("%d\n",sum);}执行后的输出结果是( )。A．3B．4C．5D．6