23. 合并 K 个升序链表

void1024

于 2024-07-14 22:21:14 发布

阅读量30

点赞数 1

分类专栏：面试经典 150 题文章标签：链表算法数据结构

本文链接：https://blog.csdn.net/diOSyu/article/details/140424497

版权

面试经典 150 题专栏收录该内容

110 篇文章 1 订阅

订阅专栏

class Solution {
    public ListNode mergeKLists(ListNode[] lists) {
        int n = lists.length;
        if (n == 0) {
            return null;
        }
        ListNode head = lists[0];
        for (int i = 1; i < lists.length; i++) {
            head = merge(head, lists[i]);
        }
        return head;
    }

    private ListNode merge(ListNode l1, ListNode l2) {
        if (l1 == null) {
            return l2;
        }
        if (l2 == null) {
            return l1;
        }
        ListNode root = new ListNode(), tail = root, tmp;
        while (l1 != null && l2 != null) {
            if (l1.val < l2.val) {
                tmp = l1;
                l1 = l1.next;
            } else {
                tmp = l2;
                l2 = l2.next;
            }
            tmp.next = null;
            tail.next = tmp;
            tail = tmp;
        }
        if (l1 != null) {
            tail.next = l1;
        }
        if (l2 != null) {
            tail.next = l2;
        }
        return root.next;
    }
}