线性表算法答案 数据结构

数据结构复习题答案：线性表算法分析题1、答：void insert(sqlist &L,ElemType x){int i=0,j;while(i<L.Length && L.data[i]<x)i++:for (j=L.Length-1;j>=i;j--)L.data[j+1]=L.data[j];L.data[i]=x;L.Length++;}2、void delnode(SqList &A,ElemType item ){int k=0,i=0;while (i<A.length){if(A.data[i]==item)k++;elseA.data[i-k]=A.data[i];i++;}A.length=A.length-k}3、4、int Listlant (Salist &L,ElemType e){/*带有头结点*/p=head;int n=0;while (p!=NULL){if(p->next->data==x)n++;p=p-.next;}return n;}5、void Delnodes(LinkList *&L,ElemType mink,ElemType maxk){LinkList *p=head->next;While(p!=null&&p->data<mink) //*r为*p的前驱结点{r=p;p=p->next;}q=p; //求值域刚好>minwhile(q!=null&&q->data>maxk) //求值域刚好<maxq=q->next;r->next=q->next;while(r!=q){r=p->next;free(p);p=r;}free(q);}6、void Dels(LinkList *&head){p=head,q=head->next;while(q->next!=null){if(p->next->data>q->next->data)p=q;q =q->next;}p->next =p->next ->next;}7、void Reverse(LinkList *&head){p=head;q=p->next; //q指向p的后继结点，仅为当前结点if(q=null)return(p); //仅有一个结点p->next=null; //原链表的首结点位新链表的尾结点if(q->next==null) //仅有两个结点{q->next=p;return(q);}r=q->next;while(r->next!=null){q->next=p; //实现逆置p=q;q=r;r=r->next;}q->next=p;return(r);}8、Typedef Elemtype int;Typedef struct Lnode{Elemtype data;Struct LNode *next;}Lnode,*LinkList;#include<stdio.h>LinkList creatlist(){//建立单链表LinkList head,r,s;ElemType x;head=(LinkList)malloc(sizeof(LNode));//建立单链表头结点r=head;printf(“输入系列整数，0标志结束\n”);scanf(“&d”,&x);while(x){//x=0 则退出while 循环s=(LinkList)mslloc(sizeof(LNode));s->data=x;r->next=s;r=s;scanf(“%d”,&x);)//whiler->next=NULL;s=head; //删除头结点head=head->next;free(s);return(head);}status ListFind(LinkList L,Elemtype e){//查找元素eLinkList p;p=L;while(p&&p->data!=e) p=p->next;If(p) return FALSE;else return TRUE;}void Lis9、Typedef Elemtype int;Typedef struct Lnode{Elemtype data;Struct LNode *next;}Lnode,*LinkList;void MergeList(LinkList Ha,LinkList Hb,LinkList &Hc) {LinkList p,q,r,s;Hc=(LinkList)malloc(sizeof(Lnode));r=Hc;p=Ha;q=Hb;while(p&&q){s=(LinkList)malloc(sizeof(Lnode));r->next=s;r=s;if(p->data<q->data){s->data=p->data;p=p->next;} else if(p->data<q->data){s->data=q->data;q=q->next;} else {s->data=p->data;p=p->next;q=q->next;}}while(q) //把Q及之后的结点复制到Hc{s=(LinkList)malloc(sizeof(Lnode));s->data=q->data;r->next=s;r=s;q=q->next;}while(p)//把P后的结点复制到Hc{s=(LinkList)malloc(sizeof(Lnode));s->data=p->data;r->next=s;r=s;p=p->next;}r->next=NULL;s=Hc;Hc=Hc->next;free(s);//删除头结点}10、Void partition(LinkList &a,LinkList &b){LinkList r,p,q;p=a->next;b=(LinkList)malloc(sizeof(Lnode));q=b;While(p->next){r=p->next;p->next=r->next;r->next=NULL;q-next=r;q=q->next;p=p->next;}}11、//p扫描单链表。

*p的值域=其后结点的值域，删除后者void Dels(LinkList *& head){ LinkList *p=head->next;while(p->next!=null){ if(p->data==p->next->data) /改重复值的结点{ q=p->next; /q指向返回重复结点p->next=q->next;free(q);}else p=p->next;}}12、void Mergelist L(LinkList&L1,LinkList&L2){LinkList *p,*q,*r,*u,*c;p=L1->next;q=L2->next;c=L1 /c为合并后新链表的表头指针r=L1while(p!=Null)&&(q!=Null)Swich{case p->data>q->data; /*是L2表中小者加入C表尾部{u=q->next; /*u为暂存指针，防止链断r->next=q;r=q;q->next=p;q=u;}case p->data<=q->data /*将A表中小者加入到C表尾部{ r=p;p=p->next;}}if(q!=Null) /如果A表已空时将B表为结束部分链接结束部分->cb表尾部r->next=q;return(c);}13、typedef struct slnode{ Elemtype data;struct slnode *next;}slnodetype;slnodetype *p,*q,*s;void merge(slnodetype *la,slnodetype *lb){ slnodetype *p;p=lb->next; Lb->next= la->next;la->next=p->next; free(p);}14、statas InsertDubList (DuLinkList &L, int e){malloc(f);f->data=Y;if(p->next==null){p->next=f;f->prior=p;}else{f->prior=p;p->next ->prior=f;f->next=p->next;p->next=f;}}15、Statas delete(cirLinkList&L){If(L=null)Error(‘nodata’);If(p→next=L){L→next=L;L→prior=L.Free(p);}Else{p→prior→next=→next;p→next→prior=→prior;free(p);}}16、statas change (CirLinkList &L){If(L=null)error(‘nodata’);elseIf(p->next==null)error(‘can’t change’)else{q=p->next;p->prior->next=q;q->prior=p->prior;p->next=q->next;q->next=p;p->prior=q;}19、void MergeList_L(LinkList &La, LinkList &Lb, LinkList &Lc){ //已知带头结点的单链线性表La和Lb的元素按值非递减排列。