主观

struct student { long num; int score; struct student*next; }; struct student*insert(struct student*head,struct student * p) { struct student*p1,*p2,*p0; p1=head;(1): if(p1==NULL) { head=p0;(2); } else { if((3)) { p2=p1; p1=p1->next; } if(p0->num==pl->num) {(4)(5); n=n+1: } else { printf(“\n%ld not been found!\n”,num); } } return head; }

参考答案
¥

订单号:

遇到问题请联系在线客服

订单号:

遇到问题请联系在线客服