21. Merge Two Sorted Lists

最新推荐文章于 2024-02-04 15:23:14 发布

lxy598951

最新推荐文章于 2024-02-04 15:23:14 发布

阅读量149

点赞数

分类专栏： leetcode习题笔记

本文链接：https://blog.csdn.net/lxy598951/article/details/53187153

版权

leetcode习题笔记专栏收录该内容

13 篇文章 0 订阅

订阅专栏

Description: 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.

解题思路

这道题的思路不难，首先根据l1和l2的值确定head的位置，然后循环比较大小，修改next即可。注意跳出循环后还要有一部分后续工作。

Java-Solution:

public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if(l1 == null)  return l2;
        if(l2 == null)  return l1;
        ListNode head = l1;
        ListNode pre = new ListNode(0);
        if(l1.val > l2.val){    head = l2;  }
        while(l1 != null && l2 != null){
            if(l1.val <= l2.val){
                pre.next = l1;
                pre = l1;
                l1 = l1.next;
            }
            else{
                pre.next = l2;
                pre = l2;
                l2 = l2.next;
            }
        }
        if(l1 == null){  pre.next = l2;  }
        if(l2 == null){  pre.next = l1;  }

        return head;
    }
}