# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def mergeKLists(self, lists: List[ListNode]) -> ListNode:
if not lists:
return None
ln=len(lists)
while(ln>1):
mid=int((ln+1)/2)
for i in range(int(ln/2)):
lists[i]=self.mergetwo(lists[i],lists[i+mid])
ln=mid
return lists[0]
def mergetwo(self,l1,l2):
root=ListNode(-1)
cur=root
while(l1 and l2):
if l1.val<l2.val:
cur.next=l1
l1=l1.next
else:
cur.next=l2
l2=l2.next
cur=cur.next
if l1:
cur.next=l1
if l2:
cur.next=l2
return root.next