merge-two-sorted-lists solution

Author: sejineer

merge-two-sorted-lists/sejineer.py

@@ -0,0 +1,20 @@
+"""
+시간 복잡도: O(n + m)
+공간 복잡도: O(1)
+"""
+class Solution:
+    def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]:
+        node = ListNode(0)
+        head = node
+
+        while list1 and list2:
+            if list1.val <= list2.val:
+                head.next = list1
+                list1 = list1.next
+            else:
+                head.next = list2
+                list2 = list2.next
+            head = head.next
+        head.next = list1 if list1 else list2
+
+        return node.next