LeetCode23. 合并 K 个升序链表

给你一个链表数组，每个链表都已经按升序排列。

请你将所有链表合并到一个升序链表中，返回合并后的链表。

示例 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->6
]
将它们合并到一个有序链表中得到。
1->1->2->3->4->4->5->6
示例 2：

输入：lists = []
输出：[]
示例 3：

输入：lists = [[]]
输出：[]
 

提示：

k == lists.length
0 <= k <= 10^4
0 <= lists[i].length <= 500
-10^4 <= lists[i][j] <= 10^4
lists[i] 按 升序 排列
lists[i].length 的总和不超过 10^4

class ListNode {
  int val;
  ListNode? next;
  ListNode([this.val = 0, this.next]);
}

void main() {
  List<ListNode?> lists = [];
  ListNode l11 = ListNode();
  ListNode? head = l11;
  l11.next = ListNode(1);
  l11 = l11.next!;
  l11.next = ListNode(4);
  l11 = l11.next!;
  l11.next = ListNode(5);
  l11 = l11.next!;

  ListNode l22 = ListNode();
  ListNode? head2 = l22;
  l22.next = ListNode(1);
  l22 = l22.next!;
  l22.next = ListNode(3);
  l22 = l22.next!;
  l22.next = ListNode(4);
  l22 = l22.next!;

  ListNode l33 = ListNode();
  ListNode? head3 = l33;
  l33.next = ListNode(2);
  l33 = l33.next!;
  l33.next = ListNode(6);
  l33 = l33.next!;

  lists.add(head.next);
  lists.add(head2.next);
  lists.add(head3.next);
  ListNode? result = mergeKLists(lists);
  while (result != null) {
    print('result:${result.val}');
    result = result.next;
  }
}

ListNode? mergeKLists(List<ListNode?> lists) {
  ListNode? result = ListNode();
  if (lists.length == 1) {
    return lists[0];
  }
  for (int i = 0; i < lists.length; i++) {
    ListNode? temp = lists[i];
    ListNode? tempResult = result;
    result.next = mergeTwoLists(temp, tempResult.next);
  }
  return result.next;
}

ListNode? mergeTwoLists(ListNode? list1, ListNode? list2) {
  ListNode? result = ListNode();
  ListNode? tempResult = result;
  while (list1 != null || list2 != null) {
    if (list1 == null) {
      tempResult?.next = list2;
      list2 = list2?.next;
      tempResult = tempResult?.next;
      continue;
    }

    if (list2 == null) {
      tempResult?.next = list1;
      list1 = list1.next;
      tempResult = tempResult?.next;
      continue;
    }

    if (list1.val <= list2.val) {
      tempResult?.next = list1;
      list1 = list1.next;
      tempResult = tempResult?.next;
    } else {
      tempResult?.next = list2;
      list2 = list2.next;
      tempResult = tempResult?.next;
    }
  }
  return result.next;
}

LeetCode23. 合并 K 个升序链表

来源：力扣（LeetCode）
链接：https://leetcode.cn/problems/merge-k-sorted-lists
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。