merge two sorted list solution

Author: radiantchoi

merge-two-sorted-lists/radiantchoi.py

@@ -0,0 +1,31 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]:
+        head = ListNode()
+        result = head
+
+        while list1 and list2:
+            if list1.val <= list2.val:
+                head.next = ListNode(list1.val)
+                head = head.next
+                list1 = list1.next
+            else:
+                head.next = ListNode(list2.val)
+                head = head.next
+                list2 = list2.next
+        
+        while list1:
+            head.next = ListNode(list1.val)
+            head = head.next
+            list1 = list1.next
+        
+        while list2:
+            head.next = ListNode(list2.val)
+            head = head.next
+            list2 = list2.next
+
+        return result.next