LeetCode--合并K个有序链表

题目：

　　合并k个有序链表，返回合并后的有序链表，并分析实现方法的时空复杂度。

　　

　　我的想法是依次从待排序的链表中选取一个链表和已经排好序的链表进行合并，当没有待排序的链表时，整个合并过程结束

import java.util.*;

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode mergeKLists(ListNode[] lists) {
        ListNode head = new ListNode(0);
        if(lists != null && lists.length != 0)
        {
            for(int i = 0; i < lists.length; i++)        //每次从待排序链表lists中选取一个链表和已排好序的head.next链表进行合并
            {
                head.next = mergeTwoLists(head.next, lists[i]);
            }
        }
        return head.next;
    }
    
    public ListNode mergeTwoLists(ListNode l1, ListNode l2)
    {
        if(l1 == null || l2 == null)
        {
            return l1 == null ? l2 : l1;
        }
        ListNode head = l1.val <= l2.val ? l1 : l2;
        ListNode cur1 = head == l1 ? l1 : l2;
        ListNode cur2 = head == l1 ? l2 : l1;
        ListNode pre = null;
        ListNode next = null;
        while(cur1 != null && cur2 != null)
        {
            if(cur1.val <= cur2.val)
            {
                pre = cur1;
                cur1 = cur1.next;
            }
            else
            {
                next = cur2.next;
                pre.next = cur2;
                cur2.next = cur1;
                pre = cur2;
                cur2 = next;
            }
        }
        pre.next = cur1 == null ? cur2 : cur1;
        return head;
    }
}
　　// 该方法的时间复杂度为O(k*N)，其中k代表，lists中的元素个数，N代表所有的待排序节点的个数
　　// 空间复杂度为O(1)

　　官方题解给出了一种分治方法，可以减少节点比较的次数，将时间复杂度降低为O(Nlogk)，点击查看 https://leetcode-cn.com/problems/merge-k-sorted-lists/solution/he-bing-kge-pai-xu-lian-biao-by-leetcode/

import java.util.*;

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode mergeKLists(ListNode[] lists) {
        if(lists == null || lists.length == 0)
        {
            return null;
        }
        
        int len = lists.length;
        int interval = 1;
        while(interval < len)
        {
            for(int i = 0; i < len - interval; i += 2*interval)
            {
                lists[i] = mergeTwoLists(lists[i], lists[i+interval]);  // 归并的思想，两两合并
            }
            interval *= 2;
        }
        return lists[0];
        
    }

    public ListNode mergeTwoLists(ListNode l1, ListNode l2)
    {
        if(l1 == null || l2 == null)
        {
            return l1 == null ? l2 : l1;
        }
        ListNode head = l1.val <= l2.val ? l1 : l2;
        ListNode cur1 = head == l1 ? l1 : l2;
        ListNode cur2 = head == l1 ? l2 : l1;
        ListNode pre = null;
        ListNode next = null;
        while(cur1 != null && cur2 != null)
        {
            if(cur1.val <= cur2.val)
            {
                pre = cur1;
                cur1 = cur1.next;
            }
            else
            {
                next = cur2.next;
                pre.next = cur2;
                cur2.next = cur1;
                pre = cur2;
                cur2 = next;
            }
        }
        pre.next = cur1 == null ? cur2 : cur1;
        return head;
    }
}


// 关于归并，还有一种比较好的实现，来自https://leetcode-cn.com/problems/merge-k-sorted-lists/solution/leetcode-23-he-bing-kge-pai-xu-lian-biao-by-powcai/

    public ListNode mergeKLists(ListNode[] lists) {
        if(lists == null || lists.length == 0)
        {
            return null;
        }
       return merge(lists, 0, lists.length - 1); 
    }
    
    public ListNode merge(ListNode[] lists, int left, int right)
    {
        if(left == right) return lists[left];
        int mid = (left + right) / 2;
        ListNode l1 = merge(lists, left, mid);
        ListNode l2 = merge(lists, mid+1, right);
        return mergeTwoLists(l1, l2);
    }