LeetCode之Merge Two Sorted Lists
【摘要】 1、题目
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.
合并2个有序链表
2、代码实现 ...
1、题目
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.
合并2个有序链表
2、代码实现
-
/**
-
* Definition for singly-linked list.
-
* public class ListNode {
-
* int val;
-
* ListNode next;
-
* ListNode(int x) { val = x; }
-
* }
-
*/
-
class Solution {
-
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
-
if (l1 == null) {
-
return l2;
-
}
-
if (l2 == null) {
-
return l1;
-
}
-
ListNode head = new ListNode(0);
-
ListNode cur = head;
-
while (l1 != null && l2 != null) {
-
if (l1.val <= l2.val) {
-
//cur.val = l1.val;这样写会爆空指针异常
-
cur.next = l1;
-
l1 = l1.next;
-
} else {
-
//cur.val = l2.val;这样写会爆空指针异常
-
cur.next = l2;
-
// System.out.println(head.val);
-
l2 = l2.next;
-
}
-
cur = cur.next;
-
}
-
if (l1 != null) {
-
cur.next = l1;
-
} else {
-
System.out.println("l2 != null");
-
cur.next = l2;
-
}
-
return head.next;
-
}
-
}
文章来源: chenyu.blog.csdn.net，作者：chen.yu，版权归原作者所有，如需转载，请联系作者。
原文链接：chenyu.blog.csdn.net/article/details/77436512
【版权声明】本文为华为云社区用户转载文章，如果您发现本社区中有涉嫌抄袭的内容，欢迎发送邮件进行举报，并提供相关证据，一经查实，本社区将立刻删除涉嫌侵权内容，举报邮箱：
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论（0）