general ListMerge

Author: MurphysL

BinarySortTree.cpp

@@ -99,7 +99,7 @@ int main(){
     InsertBST(&bintree , n);
 
     cout << "中序遍历:" <<endl;
-    InOrderTraversal(bintree);
+    //InOrderTraversal(bintree);
 
     cin >>n;
     cout <<"输入要删除的数:" <<endl;

ListMerge.cpp

@@ -2,6 +2,10 @@
 #include <stdlib.h>
 using namespace std;
 
+/**
+ * 增序链表合并
+ */
+
 typedef struct List{
     int num;
     List *next;
@@ -16,6 +20,17 @@ void print(List *list){
     cout <<""<<endl;
 }
 
+void print2(List *PC){
+    while(PC->next){
+        cout <<PC->next->num<< " ";
+        PC = PC->next;
+    }
+    cout << "" <<endl;
+}
+
+/**
+ * 递归合并
+ */
 List *MergeList(List *list , List *list2){
     if(list == NULL)
         return list2;
@@ -34,32 +49,91 @@ List *MergeList(List *list , List *list2){
     return temp;
 }
 
-int main(){
-    List *l1 = new List;
-    l1->next = NULL;
-    l1->num = 0;
-    List *l2 = new List;
-    l2->next = NULL;
-    l2->num = 1;
+/**
+ * 普通合并
+ */
+List *MergeList2(List *PA , List *PB , List *PC){
+    List *pa = PA->next;
+    List *pb = PB->next;
+    PC = PA;
+    List *pc = PC;
+    while(pa&&pb){
+        if(pa->num >= pb->num){
+            pc->next = pb;
+            pc = pc->next;
+            pb = pb->next;
+        }else{
+            pc->next = pa;
+            pc= pc->next;
+            pa = pa->next;
+        }
+    }
+
+    pc->next = pa?pa:pb;
+    return PC;
+}
+
+/**
+ * 初始化链表
+ */
+void InitList(List **l1 , List **l2){
+    (*l1) = new List;
+    (*l1)->next = NULL;
+    (*l1)->num = 0;
+    (*l2) = new List;
+    (*l2)->next = NULL;
+    (*l2)->num = 1;
     for(int i = 10 ;i >= 2 ;i -= 2){
         List *t = new List;
-        t->next = l1->next;
-        l1->next = t;
+        t->next = (*l1)->next;
+        (*l1)->next = t;
         t->num = i;
     }
 
     for(int i = 11 ;i >= 3 ;i -= 2){
         List *t = new List;
-        t->next = l2->next;
-        l2->next = t;
+        t->next = (*l2)->next;
+        (*l2)->next = t;
         t->num = i;
     }
+}
 
+/**
+ * 初始化带头结点链表
+ */
+void InitListWithHead(List **LA , List **LB){
+    *LA = new List;
+    *LB = new List;
+    (*LA)->next = NULL;
+    (*LB)->next = NULL;
+    for(int i = 10;i >= 0 ;i -=2){
+        List *t = new List;
+        t->num = i;
+        t->next = (*LA)->next;
+        (*LA)->next = t;
+    }
+    for(int i = 11 ;i >= 1 ;i -=2){
+        List *t = new List;
+        t->num = i;
+        t->next = (*LB)->next;
+        (*LB)->next = t;
+    }
+}
+
+int main(){
+    cout << "递归合并" <<endl;
+    List *l1,*l2,*l3;
+    InitList(&l1 , &l2);
     print(l1);
     print(l2);
-
-    cout << "ÅÅÐòºó" <<endl;
     print(MergeList(l1 ,l2));
 
+    cout << "普通合并" <<endl;
+    List *LA , *LB, *LC;
+    InitListWithHead(&LA , &LB);
+    print2(LA);
+    print2(LB);
+    print2(MergeList2(LA,LB,LC));
+
     return 0;
 }