示例 1:
输入:lists = [[1,4,5],[1,3,4],[2,6]]
输出:[1,1,2,3,4,4,5,6]
解释:链表数组如下:
[
1->4->5,
1->3->4,
2-...1->1->2->3->4->4->5->6
示例 2:
输入:lists = []
输出:[]
示例 3:
输入:lists = [[]]
输出:[]
提示:
k == lists.length
0...有可能发生左指针大于右指针的情况
// 返回null
if (left > right) {
return null;
}
// 注释的是问题代码...,目测是在向下舍入的时候有精度问题,导致无限递归
// int mid = (right - left) >> 1 + left;
int mid = (left + right