LeetCode-merge-two-sorted-lists

最新推荐文章于 2022-02-11 00:03:48 发布

原创最新推荐文章于 2022-02-11 00:03:48 发布 · 288 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#merge-two-sorted-lists #LeetCode

LeetCode 专栏收录该内容

105 篇文章

订阅专栏

本文介绍了一种将两个已排序的链表合并为一个新排序链表的方法。通过比较两个链表节点的值，按升序连接节点形成新链表。文章提供了完整的Java实现代码。

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

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;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode node = new ListNode(0);
        ListNode root = node;
        ListNode node1 = l1;
        ListNode node2 = l2;
         
        while(l1!=null&&l2!=null){
            ListNode nextNode = new ListNode(0);
            if(l1.val<=l2.val){
               root.next = l1;
                l1=l1.next;
            }else{
                root.next = l2;
                l2=l2.next;
            }
            root=root.next;
        }
        if(l1!=null){
          root.next = l1;        }
        if(l2!=null){
            root.next = l2;        }
        return node.next;
    }
}