10.15总结

List Merge(List l1,List l2){
PtrToNode dummy=(PtrToNode)malloc(sizeof(struct Node));
dummy->Next=null;
PtrToNode tail=dummy;
PtrToNode tail=dummy;
PtrToNode p1=L1;
PTrtoNode p2=L2;
while(p1!=null&&P2!=null){
if(p1->Data<=p2->Data){
tail->Next=(PtrToNode)malloc(sizeof(struct Node));
tail->Next->Data=p1->Data;
tail->Next_>Next=null;
p1=p1->Next;
}
else{
tail->Next=(PtrToNode)malloc(sizeof(struct Node));
tail->Next->Data=p2->Data;
tail->Next->Nxet=null;
p2=p3->Next;
}
tail=tail->Next;
}
while(p1!=null){
tail->Next=(ptrToNode)malloc(sizeof(struct node));
tail->Next->Data=p1->Data;
tail->Next->Next=null;
p1=p1->Next;
tail=tail->Next;
}
while(p2!=null){
tail->Next=(PtrToNode)malloc(sizeof(struct Node));
tail->Next->Data=p2->Data;
tail->Next->Next=null;
p2=p2->Next;
tail=tail->Next;
}
Listresult=summy->Next;
free(dummy);
return result;
}