建立一个线性链表,其元素值为：包括学号、姓名、性别、年龄等信息

1、第二题：建立一个线性链表，其元素值为：包括学号、姓名、性别、年龄等信息。并依次从键盘输入（输入时要有相应的提示）以输入0结束，然后依次输出线性链表中的各元素值。#include "stdlib.h"#include "stdio.h"#define null 0#define size 40struct node char num6; char name8; char sex2; int age; struct node * next; ;void main () int x; struct node * head; struct node * p,*

2、q; head=(struct node *)malloc(size); p=head; printf("if exit:pleas into '0' "); scanf("%d",&x); while (x!=0) q=(struct node *)malloc(size); printf("numn"); scanf("%s",q->num); printf("namen"); scanf("%s",q->name); printf(&

3、quot;sexn"); scanf("%s",q->sex); printf("agen"); scanf("%d",&q->age); p->next=q; p=q; printf("if exit:pleas into '0' "); scanf("%d",&x); p->next=null; p=head; printf("n num name sex age n");while (p!=null)pr

4、intf("%8s%8s%6s%6dn",p->num,p->name,p->sex,p->age);p=p->next;void main () int x,iage,find=0; struct node * head; struct node * p,* q,*pt; head=(struct node *)malloc(size); p=head; printf("if exit:pleas into '0' "); scanf("%d",&x); while (x!=0)

5、 q=(struct node *)malloc(size); printf("numn"); scanf("%s",q->num); printf("namen"); scanf("%s",q->name); printf("sexn"); scanf("%s",q->sex); printf("agen"); scanf("%d",&q->age); p->next=q; p=q; printf

6、("if exit:pleas into '0' "); scanf("%d",&x); p->next=null; p=head; printf("n num name sex age n");while (p!=null)printf("%8s%8s%6s%6dn",p->num,p->name,p->sex,p->age);p=p->next;printf("pleas into age :n");scanf("%d&q

7、uot;,&iage);pt=head;p=pt;pt=pt->next;while (pt!=null) if(pt->age=iage) p->next=pt->next; find=1; else p=pt; pt=pt->next;if(find=0)printf("no find %d ",iage);else p=head; printf("n num name sex age n");while (p!=null)printf("%8s%8s",p->num,p->nam

8、e);printf("%8s%5dn",p->sex,p->age);p=p->next;第四题：现在假设有两个多项式a(x)=7x8+6x5+12x2-9；b(x)=3x11+10x8+8x2编写一个程序将这两个多项式相加，输出两个多项式及相加的结果#include<stdio.h>#include<stdlib.h>typedef struct polynode int coef; int exp; struct polynode *next;PNode;PNode *Creat_Linkst(int n);void PolyA

9、dd(PNode *pa,PNode *pb);void Print_Linkst(PNode *H);main() PNode *HA,*HB; int la,lb; printf("enter la,lb:"); scanf("%d,%d",&la,&lb); printf("ncreat HAn");HA=Creat_Linkst(la); printf("A(x)=");Print_Linkst(HA); printf("ncreat HBn");HB=Creat_Lin

10、kst(lb); printf("B(x)=");Print_Linkst(HB); PolyAdd(HA,HB); printf("nA(x)+B(x)=");Print_Linkst(HA);PNode *Creat_Linkst(int n) PNode *head,*p,*s; int i; head=(PNode*)malloc(sizeof(PNode); head->next=NULL; p=head; printf("enter coef,exp:n"); for(i=1;i<=n;+i) s=(PNode

11、 *)malloc(sizeof(PNode);scanf("%d,%d",&s->coef,&s->exp);s->next=NULL;p->next=s;p=s; return(head);void PolyAdd(PNode *pa,PNode *pb) PNode *pre,*qa,*qb,*q; int sum; pre=pa; qa=pa->next; qb=pb->next; while(qa&&qb) if(qa->exp=qb->exp) sum=qa->coef+qb->coef; if(sum)qa->coef=sum;pre=qa; elsepre->next=qa->next;free(qa); qa=pre->next; q=qb;qb=qb->next;free(q); if(qb)pre->next=qb; free(pb); void Print_Linkst(PNode *H)PNode *p;p=H->