Appearance
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 均按 非递减顺序 排列
- 来源:力扣(LeetCode)
- 链接:https://leetcode.cn/problems/length-of-last-word
javascript
/**
* Definition for singly-linked list.
* function ListNode(val, next) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
*/
/**
* @param {ListNode} list1
* @param {ListNode} list2
* @return {ListNode}
*/
var mergeTwoLists = function (list1, list2) {
var Head = new ListNode(),
cur = Head
while (list1 && list2) {
if (list1.val < list2.val) {
cur.next = list1
cur = cur.next
list1 = list1.next
} else {
cur.next = list2
cur = cur.next
list2 = list2.next
}
}
if (list1) {
cur.next = list1
}
if (list2) {
cur.next = list2
}
return Head.next
}
// test
function ListNode(val, next) {
this.val = val === undefined ? 0 : val
this.next = next === undefined ? null : next
}
var l1 = new ListNode(1)
var lstNode1 = new ListNode(2)
var lstNode2 = new ListNode(4)
l1.next = lstNode1
lstNode1.next = lstNode2
var l2 = new ListNode(1)
var lstNode3 = new ListNode(3)
var lstNode4 = new ListNode(4)
l2.next = lstNode3
lstNode3.next = lstNode4
console.log(mergeTwoLists(l1, l2))