每日一题---23. 合并K个升序链表[力扣][Go]

func mergeKLists(lists []*ListNode) *ListNode {
    if len(lists) == 0 {
        return nil
    }
    if len(lists) == 1 {
        return lists[0]
    }
    lists = mergeKListsStep(lists)
    return mergeKLists(lists)
}
func mergeKListsStep(lists []*ListNode) []*ListNode {
    var list = &ListNode{Val: 0,Next: nil}
    p := list
    one := lists[0]
    two := lists[1]
    for one != nil && two != nil {
        if one.Val < two.Val {
            tem := one
            list.Next = tem
            list = list.Next
            one = one.Next
        } else {
            tem := two
            list.Next = tem
            list = list.Next
            two = two.Next
        }
    }
    if one == nil {
        list.Next = two
    }
    if two == nil {
        list.Next = one
    }
    lists = lists[2:]
    lists = append(lists, p.Next)
    return lists
}