update 21

leetcode/21.py

@@ -10,14 +10,16 @@ class ListNode:
 
 class Solution:
     def mergeTwoLists(self, list1: ListNode, list2: ListNode):
-        new_list1 = []
+        prehead = ListNode(-1)
-        while list1.next is not None:
+        prev = prehead
-            new_list1.append(list1.val)
-            list1 = list1.next
-        new_list2 = []
-        while list2.next is not None:
-            new_list2.append(list2.val)
-            list2 = list2.next
 
-        new_list = new_list1 + new_list2
+        while list1 and list2:
-        return new_list.sort()
+            if list1.val <= list2.val:
+                prev.next = list1
+                list1 = list1.next
+            else:
+                prev.next = list2
+                list2 = list2.next
+            prev = prev.next
+
+        return prehead.next