题目:21. 合并两个有序链表
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例 1:
输入:l1 = [1,2,4], l2 = [1,3,4]
输出:[1,1,2,3,4,4]
示例 2:
输入:l1 = [], l2 = []
输出:[]
示例 3:
输入:l1 = [], l2 = [0]
输出:[0]
提示:
两个链表的节点数目范围是 [0, 50]
-100 <= Node.val <= 100
l1 和 l2 均按 非递减顺序 排列
链接:https://leetcode-cn.com/problems/merge-two-sorted-lists
解题:
两个链表同时遍历比较
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
// 思路:两个链表同时遍历,一边遍历一边比较构建新的链表,注意后面收尾不为空的剩余链表;
public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if (null == l1 || null == l2) {
return l1 == null ? l2 : l1;
}
ListNode head = new ListNode(-1);
ListNode list = head;
while (l1 != null && l2 != null) {
while (l1 != null && l2 != null && l1.val <= l2.val) {
list.next = l1;
list = list.next;
l1 = l1.next;
}
while (l1 != null && l2 != null && l1.val > l2.val) {
list.next = l2;
list = list.next;
l2 = l2.next;
}
}
list.next = l1 != null ? l1 : l2;
return head.next;
}
}