将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:l1 = [1,2,4], l2 = [1,3,4]
输出:[1,1,2,3,4,4]
提示:
- 两个链表的节点数目范围是 [0, 50]
- -100 <= Node.val <= 100
- l1 和 l2 均按 非递减顺序 排列
思路:
- 双指针
- 一次和当前所指向的 node 节点进行比对,将较小的移至新链表中,如果其中一个链表为空,则直接指向另一个链表
/**
* Definition for singly-linked list.
* class ListNode {
* val: number
* next: ListNode | null
* constructor(val?: number, next?: ListNode | null) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
* }
*/
function mergeTwoLists(l1: ListNode | null, l2: ListNode | null): ListNode | null {
if(l1 == null)
return l2;
if(l2 == null)
return l1;
var newList = new ListNode();
const Start = newList;
var nowNode1 = l1;
var nowNode2 = l2;
while(nowNode1 != null && nowNode2 != null) {
if(nowNode1.val <= nowNode2.val) {
newList.next = nowNode1;
nowNode1 = nowNode1.next;
} else {
newList.next = nowNode2;
nowNode2 = nowNode2.next;
}
newList = newList.next;
}
if(nowNode1 == null) {
newList.next = nowNode2;
}
if(nowNode2 == null) {
newList.next = nowNode1;
}
return Start.next;
};