[LeetCode]21. Merge Two Sorted Lists

最新推荐文章于 2025-12-28 17:52:30 发布

转载最新推荐文章于 2025-12-28 17:52:30 发布 · 207 阅读

文章标签：

#leetcode

leetcode 专栏收录该内容

64 篇文章

订阅专栏

本文介绍了一种将两个已排序的链表合并为一个新排序链表的方法。通过比较两个链表节点的值来决定合并顺序，最终形成一个新的有序链表。

Easy

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.

2ms:

 public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode fakehead = new ListNode(-1);
         ListNode l3 = fakehead;
          while(l1!=null&&l2!=null){
              if(l1.val<l2.val){
                  l3.next = l1;
                  l3 = l3.next;
                  l1 = l1.next;
              }else{
                 l3.next = l2;
                 l3 = l3.next;
                 l2 = l2.next;
             }
         }

        if(l1!=null)
             l3.next = l1;
        if(l2!=null)
             l3.next = l2;
         return fakehead.next;
    }