有序链表多路归并

有序链表多路归并

23. Merge k Sorted Lists
    Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

    Example:

    Input:
    [
    1->4->5,
    1->3->4,
    2->6
    ]
    Output: 1->1->2->3->4->4->5->6

这个是LeetCode的23题，对k个有序链表进行多路归并，整体思路是遍历ListNode数组，找到所有数组节点中头元素中最小的那个节点，然后将next指向这个元素，通过Set来标记已经遍历完的ListNode节点，下面是Java代码实现：

import java.util.HashSet;
import java.util.Set;

/**
 * Created by CvShrimp on 2019/8/26
 */
public class MergeMultiSortedLists {

    /**
     * Definition for singly-linked list.
     * public class ListNode {
     *     int val;
     *     ListNode next;
     *     ListNode(int x) { val = x; }
     * }
     */
    public class ListNode {
        int val;
        ListNode next;
        ListNode(int x) { val = x; }
    }

    public ListNo