leetcodeday12

合并k个排序链表
1，找出lists中值最小的节点
2，将上一个节点的next指向它

class Solution(object):
    def mergeKLists(self, lists):
        """
        :type lists: List[ListNode]
        :rtype: ListNode
        """
        l = ListNode(0)
        k = l
        while None in lists:
                lists.remove(None)
        while lists:
            c = lists[0]
            i = 0
            for j,temp in enumerate(lists[1:]):
                if temp.val < c.val:
                    c = temp
                    i = j + 1
            l.next = c
            l = l.next
            lists[i] = lists[i].next
            if None in lists:
                lists.remove(None)
        return k.next