题目
- 输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
- leetcode链接:https://leetcode-cn.com/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof/
// 输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
// 示例1:
// 输入:1->2->4, 1->3->4
// 输出:1->1->2->3->4->4
// 限制:
// 0 <= 链表长度 <= 1000
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} l1
* @param {ListNode} l2
* @return {ListNode}
*/
var mergeTwoLists = function (l1, l2) {
if (!l1) return l2
if (!l2) return l1
const head = new ListNode()
let node1 = l1
let node2 = l2
let current = head
while (node1 && node2) {
if (node1.val < node2.val) {
current.next = node1
node1 = node1.next
} else {
current.next = node2
node2 = node2.next
}
current = current.next
}
if (node1) {
current.next = node1
} else if (node2) {
current.next = node2
}
return head.next
}