leetcode21. Merge Two Sorted Lists

最新推荐文章于 2026-01-08 21:36:59 发布

原创最新推荐文章于 2026-01-08 21:36:59 发布 · 222 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #LinkedList

leetcode 专栏收录该内容

187 篇文章

订阅专栏

本文介绍了一种将两个已排序的链表合并为一个新排序链表的方法。该方法通过遍历两个输入链表，比较节点值大小并连接较小值节点来实现。最终返回由两个链表节点拼接而成的新链表。

21. Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

解法

归并排序。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if (l1 == null && l2 == null) {
            return null;
        }

        ListNode dummy = new ListNode(0);
        ListNode head = dummy;
        while (l1 != null && l2 != null) {
            if (l1.val < l2.val) {
                head.next = l1;
                l1 = l1.next;
            } else {
                head.next = l2;
                l2 = l2.next;
            }
            head = head.next;
        }
        if (l1 != null) {
            head.next = l1;
        } 
        if (l2 != null) {
            head.next = l2;
        }

        return dummy.next;
    }
}