c++ 合并k个有序链表

二分思想，每次让数组二分，直到数组长度为1，输出结果

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
    ListNode* mergeTwo(ListNode* l1, ListNode* l2)
    {
        if (l1 == NULL)
            return l2;
        else if (l2 == NULL)
            return l1;
        if (l1 -> val > l2 -> val)
            return mergeTwo(l2, l1);
        l1 -> next = mergeTwo(l1 -> next, l2);
        return l1;
    }
public:
    ListNode* mergeKLists(vector<ListNode*>& lists) {
        int count = lists.size();
        if (count == 0)
            return NULL;
        if (count == 1)
            return lists[0];
        --count;
        while (count > 0)
        {
            for (int i = 0; i < count; ++i, --count)
                lists[i] = mergeTwo(lists[i], lists[count]);
        }
        return lists[0];
    }
};