Merge branch 'main' of https://github.com/AlgorithmIsMyLife/Algorithm

Author: jihostudy

JungHwan/Day27/NeetCode_MergeTwoSortedLinkedLists.py

@@ -0,0 +1,28 @@
+# 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]:
+        start = ListNode()
+        cur = start
+        while list1 and list2:
+            if list1.val <= list2.val:
+                cur.next = list1
+                list1 = list1.next
+            else:
+                cur.next = list2
+                list2 = list2.next
+            cur = cur.next
+        
+        if list1:
+            cur.next = list1
+        elif list2:
+            cur.next = list2
+
+        return start.next
+                
+
+