Refine

begeekmyfriend · begeekmyfriend · commit 5bfc56802c11 · 2020-06-03T09:56:55.000+08:00
Signed-off-by: begeekmyfriend &lt;begeekmyfriend@gmail.com&gt;
diff --git a/011_container_with_most_water/container.c b/011_container_with_most_water/container.c
@@ -9,13 +9,9 @@ static int maxArea(int* height, int heightSize)
         int area = (max - min) * (height[min] < height[max] ? height[min] : height[max]);
         area_max = area > area_max ? area : area_max;
         if (height[min] < height[max]) {
-            while (++min < max && height[min] <= height[min - 1]) {
-                continue;
-            }
+            min++;
         } else {
-            while (min < --max && height[max] <= height[max + 1]) {
-                continue;
-            }
+            max--;
         }
     }
     return area_max;
diff --git a/021_merge_two_sorted_lists/merge_lists.c b/021_merge_two_sorted_lists/merge_lists.c
@@ -8,33 +8,27 @@ struct ListNode {
 
 static struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2)
 {
-    struct ListNode dummy, *tail = &dummy;
-    dummy.next = NULL;
+    struct ListNode dummy;
+    struct ListNode *prev = &dummy;
+    dummy.next = l1;
 
     while (l1 != NULL || l2 != NULL) {
-        struct ListNode *node = malloc(sizeof(*node));
-        node->next = NULL;
-        tail->next = node;
-        tail = node;
-        if (l1 != NULL) {
-            if (l2 != NULL) {
-                if (l1->val < l2->val) {
-                    node->val = l1->val;
-                    l1 = l1->next;
-                } else {
-                    node->val = l2->val;
-                    l2 = l2->next;
-                }
-            } else {
-                node->val = l1->val;
-                l1 = l1->next;
-            }
+        if (l1->val <= l2->val) {
+            prev = l1;
+            l1 = l1->next;
         } else {
-            node->val = l2->val;
-            l2 = l2->next;
+            struct ListNode *tmp = l2->next;
+            l2->next = l1;
+            prev->next = l2;
+            prev = l2;
+            l2 = tmp;
         }
     }
 
+    if (l2 != NULL) {
+        prev->next = l2;
+    }
+
     return dummy.next;
 }
 
