Improvement

Signed-off-by: begeekmyfriend <[email protected]>

Author: begeekmyfriend

0021_merge_two_sorted_lists/merge_lists.c

@@ -9,25 +9,21 @@ struct ListNode {
 static struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2)
 {
     struct ListNode dummy;
-    struct ListNode *prev = &dummy;
+    struct ListNode *tail = &dummy;
     dummy.next = l1;
 
     while (l1 != NULL && l2 != NULL) {
         if (l1->val <= l2->val) {
-            prev = l1;
+            tail->next = l1;
             l1 = l1->next;
         } else {
-            struct ListNode *tmp = l2->next;
-            l2->next = l1;
-            prev->next = l2;
-            prev = l2;
-            l2 = tmp;
+            tail->next = l2;
+            l2 = l2->next;
         }
+        tail = tail->next;
     }
 
-    if (l2 != NULL) {
-        prev->next = l2;
-    }
+    tail->next = l1 != NULL ? l1 : l2;
 
     return dummy.next;
 }

0021_merge_two_sorted_lists/merge_lists.cc

@@ -15,26 +15,21 @@ using namespace std;
 class Solution {
 public:
     ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
-        struct ListNode *prev, dummy;
-
-        prev = &dummy;
+        struct ListNode *tail, dummy;
+        tail = &dummy;
         dummy.next = l1;
+
         while (l1 != nullptr && l2 != nullptr) {
             if (l1->val <= l2->val) {
-                prev = l1;
+                tail->next = l1;
                 l1 = l1->next;
             } else {
-                struct ListNode *tmp = l2;
+                tail->next = l2;
                 l2 = l2->next;
-                tmp->next = l1;
-                prev->next = tmp;
-                prev = tmp;
             }
         }
 
-        if (l2 != nullptr) {
-            prev->next = l2;
-        }
+        tail->next = l1 != nullptr ? l1 : l2;
 
         return dummy.next;
     }