力扣算法12-合并K个排序链表

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func mergeKLists(lists []*ListNode) *ListNode {
    min := 100
    s := -1
    for i := 0 ; i < len(lists) ; i++ {
        if lists[i] != nil && lists[i].Val < min {
            min = lists[i].Val
            s = i
        }
    }
    if s == -1 {
        return nil
    }
    node := lists[s]
    lists[s] =lists[s].Next
    node.Next = mergeKLists(lists)
    return node
}