严书数据结构P31算法2.12MergeList-L中 pc->next=pa?pa:pb怎么理解?严蔚敏版 31页算法2.12题目是归并两个单链表的算法.void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc) {pa=La->next; pb=Lb->next;Lc=pc=La;while(pa&&pb){
来源:学生作业帮助网 编辑:作业帮 时间:2024/07/03 01:22:38
![严书数据结构P31算法2.12MergeList-L中 pc->next=pa?pa:pb怎么理解?严蔚敏版 31页算法2.12题目是归并两个单链表的算法.void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc) {pa=La->next; pb=Lb->next;Lc=pc=La;while(pa&&pb){](/uploads/image/z/12173256-0-6.jpg?t=%E4%B8%A5%E4%B9%A6%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84P31%E7%AE%97%E6%B3%952.12MergeList-L%E4%B8%AD+pc-%3Enext%3Dpa%3Fpa%3Apb%E6%80%8E%E4%B9%88%E7%90%86%E8%A7%A3%3F%E4%B8%A5%E8%94%9A%E6%95%8F%E7%89%88+31%E9%A1%B5%E7%AE%97%E6%B3%952.12%E9%A2%98%E7%9B%AE%E6%98%AF%E5%BD%92%E5%B9%B6%E4%B8%A4%E4%B8%AA%E5%8D%95%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AE%97%E6%B3%95.void+MergeList_L%28LinkList+%26La%2CLinkList+%26Lb%2CLinkList+%26Lc%29+%7Bpa%3DLa-%3Enext%3B+pb%3DLb-%3Enext%3BLc%3Dpc%3DLa%3Bwhile%28pa%26%26pb%29%7B)
严书数据结构P31算法2.12MergeList-L中 pc->next=pa?pa:pb怎么理解?严蔚敏版 31页算法2.12题目是归并两个单链表的算法.void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc) {pa=La->next; pb=Lb->next;Lc=pc=La;while(pa&&pb){
严书数据结构P31算法2.12MergeList-L中 pc->next=pa?pa:pb怎么理解?
严蔚敏版 31页算法2.12
题目是归并两个单链表的算法.
void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc) {
pa=La->next; pb=Lb->next;
Lc=pc=La;
while(pa&&pb){
if(pa->data data){
pc->next=pa;pc=pa;pa=pa->next; }
else {pc->next=pb;pc=pb;pb=pb->next;}
}
pc->next=pa?pa:pb;
free(Lb);
}//MergeList_
严书数据结构P31算法2.12MergeList-L中 pc->next=pa?pa:pb怎么理解?严蔚敏版 31页算法2.12题目是归并两个单链表的算法.void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc) {pa=La->next; pb=Lb->next;Lc=pc=La;while(pa&&pb){
while(pa&&pb){...} 表明两个链表都非空,此时根据data的大小来选择.
循环结束后有一个链表已经空了,pc->next=pa?pa:pb;这句话是把剩下非空的那个接到pc后面.
#include
#include
typedef int ElemType;
typedef struct LNode{
ElemType data;
struct LNode *next;
}LNode,*LinkList;
int InitList_L(LinkList &L){
...
全部展开
#include
#include
typedef int ElemType;
typedef struct LNode{
ElemType data;
struct LNode *next;
}LNode,*LinkList;
int InitList_L(LinkList &L){
L= (LinkList)malloc(sizeof(LNode));
L->next=NULL;
return 1;
}
int ListInsert_L(LinkList &L,int i,ElemType e){
LinkList p;
p=L;
int j=0;
while(p&&j
++j;
}
if(!p||j>i-1) return 0;
LinkList s=(LinkList)malloc(sizeof(LNode));
s->data=e;
s->next=p->next;
p->next=s;
return 1;
}
void Disp_L(LinkList
收起
#include
#include
typedef int ElemType;
typedef struct LNode{
ElemType data;
struct LNode *next;
}LNode,*LinkList;
int InitList_L(LinkList &L){
...
全部展开
#include
#include
typedef int ElemType;
typedef struct LNode{
ElemType data;
struct LNode *next;
}LNode,*LinkList;
int InitList_L(LinkList &L){
L= (LinkList)malloc(sizeof(LNode));
L->next=NULL;
return 1;
}
int ListInsert_L(LinkList &L,int i,ElemType e){
LinkList p;
p=L;
int j=0;
while(p&&j
++j;
}
if(!p||j>i-1) return 0;
LinkList s=(LinkList)malloc(sizeof(LNode));
s->data=e;
s->next=p->next;
p->next=s;
return 1;
}
void Disp_L(LinkList L){
LinkList p=L->next;
if(!p) printf("此链表为空!");
while(p){
printf("%d",p->data);
p=p->next;
}
printf("\n");
}
void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc){
LinkList pa=La->next;
LinkList pb=Lb->next;
LinkList pc=Lc=La;
while(pa&&pb){
if(pa->data<=pb->data){
pc->next=pa;pc=pa;pa=pa->next;
}
else{
pc->next=pb;pc=pb;pb=pb->next;
}
}
pc->next=pa?pa:pb;
free(Lb);
}
void main(){
LinkList La,Lb,Lc;
InitList_L(La);
InitList_L(Lb);
InitList_L(Lc);
ListInsert_L(La,1,2);
ListInsert_L(La,2,3);
ListInsert_L(La,3,5);
Disp_L(La);
ListInsert_L(Lb,1,1);
ListInsert_L(Lb,2,4);
ListInsert_L(Lb,3,6);
ListInsert_L(Lb,4,7);
Disp_L(Lb);
MergeList_L(La,Lb,Lc);
printf("合并之后的链表为:\n");
Disp_L(Lc);
}
_________________________________________________________________________
OTHER ONE
_________________________________________________________________________
#include
#include
typedef int ElemType;
typedef struct LNode
{
ElemType data;
struct LNode *next;}LNode,*LinkList;
int InitList_L(LinkList &L){
L=(LinkList)malloc(sizeof(LNode));
L->next=NULL;
if(L->next==NULL)
{
printf("构造链表成功");
return 1;
}
else
printf("sb");
return 0;}
int ListInsert_L(LinkList &L,int i,ElemType e){
LNode *p;ElemType j=0; LNode *s;
p=L;
while(p&&j
if(!p&&j>i-1)return 0;
s=(LinkList)malloc(sizeof(LNode));
s->data=e;s->next=p->next;p->next=s;
return 1;
}
void Disp_L(LinkList L){
LinkList p=L->next;
if(!p) printf("此链表为空!\n");
while(p){
printf("%d",p->data);
p=p->next;
}
printf("\n");}
void MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc){
LinkList pa,pb,pc;
Lc=pc=La;
pa=La->next;pb=Lb->next;
Lc=pc=La;
while(pa&&pb){
if(pa->data<=pb->data){
pc->next=pa;pc=pa;pa=pa->next;
}
else{pc->next=pb;pc=pb;pb=pb->next;}
}
pc->next=pa?pa:pb;
free(Lb);
}
void main()
{
LNode *La,*Lb,*Lc;
InitList_L(La);
printf("\n");
InitList_L(Lb);
InitList_L(Lc);
ListInsert_L(La,1,1);
ListInsert_L(La,2,3);
ListInsert_L(La,3,5);
ListInsert_L(La,4,7);
printf("\n");
ListInsert_L(Lb,1,2);
ListInsert_L(Lb,2,4);
ListInsert_L(Lb,3,6);
ListInsert_L(Lb,4,8);
Disp_L(La);
Disp_L(Lb);
MergeList_L(La,Lb,Lc);
Disp_L(Lc);
收起