Merge Two Sorted Lists

最新推荐文章于 2022-05-22 13:07:29 发布

原创最新推荐文章于 2022-05-22 13:07:29 发布 · 543 阅读

0 ·

CC 4.0 BY-SA版权

算法专栏收录该内容

46 篇文章

订阅专栏

本文介绍了一种合并两个升序链表的方法，并提供了一个Java实现示例。通过比较两个链表节点的值来构建新的升序链表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Merge two sorted (ascending) linked lists and return it as a new sorted list. The new sorted list should be made by splicing together the nodes of the two lists and sorted in ascending order.

public class Solution {
    /**
     * @param ListNode l1 is the head of the linked list
     * @param ListNode l2 is the head of the linked list
     * @return: ListNode head of linked list
     */
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode dummy = new ListNode(0);
        ListNode lastNode = dummy;
        while (l1 != null && l2 != null) {
            if (l1.val < l2.val) {
                lastNode.next = l1;
                l1 = l1.next;
            } else {
                lastNode.next = l2;
                l2 = l2.next;
            }
            lastNode = lastNode.next;
        }
        if (l1 != null) {
            lastNode.next = l1;
        }
        if (l2 != null) {
            lastNode.next = l2;
        }
        return dummy.next;
    }
}