sireesh-001
diff --git a/‎January 2021/24 mergeKSortedLists.py
Copy file name to clipboard
+34Lines changed: 34 additions & 0 deletions b/‎January 2021/24 mergeKSortedLists.py
Copy file name to clipboard
+34Lines changed: 34 additions & 0 deletions
@@ -0,0 +1,34 @@
+# Definition for singly-linked list.
+# class ListNode(object):
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+ 
+        
+class Solution(object):
+    def mergeKLists(self, lists):
+       
+        amount = len(lists)
+        interval = 1
+        while interval < amount:
+            for i in range(0, amount - interval, interval * 2):
+                lists[i] = self.merge2Lists(lists[i], lists[i + interval])
+            interval *= 2
+        return lists[0] if amount > 0 else None
+
+    def merge2Lists(self, l1, l2):
+        head = point = ListNode(0)
+        while l1 and l2:
+            if l1.val <= l2.val:
+                point.next = l1
+                l1 = l1.next
+            else:
+                point.next = l2
+                l2 = l1
+                l1 = point.next.next
+            point = point.next
+        if not l1:
+            point.next=l2
+        else:
+            point.next=l1
+        return head.next