feat: Solve merge-two-sorted-lists problem

Author: hu6r1s

merge-two-sorted-lists/hu6r1s.py

@@ -0,0 +1,26 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    # 시간복잡도: O(n + m)  -> 두 리스트의 모든 노드를 한 번씩 방문
+    # 공간복잡도: O(1)      -> 기존 노드 재배치, 추가 메모리 거의 없음
+    def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]:
+        merged_list = ListNode()
+        tail = merged_list
+
+        while list1 and list2:
+            if list1.val < list2.val:
+                tail.next = list1
+                list1 = list1.next
+            else:
+                tail.next = list2
+                list2 = list2.next
+            tail = tail.next
+        
+        if list1:
+            tail.next = list1
+        else:
+            tail.next = list2
+        return merged_list.next