Merge Two Sorted List

最新推荐文章于 2022-02-11 00:03:48 发布

RockPaperProgrammer

最新推荐文章于 2022-02-11 00:03:48 发布

阅读量140

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/gina0613/article/details/51643145

Leetcode Easy Javascript 专栏收录该内容

71 篇文章

订阅专栏

本文介绍了一种将两个已排序的链表合并为一个新排序链表的方法。通过创建一个虚拟头节点简化新链表的构造过程。算法遍历两个输入链表，比较节点值并依次连接较小值节点，直至其中一个链表遍历完毕。

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.

Tag

LinkedList

----------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Easy Solution

Create a dummy node at head, convenient for creating a new linked list

/**
 * @param {ListNode} l1
 * @param {ListNode} l2
 * @return {ListNode}
 */
var mergeTwoLists = function (l1, l2) {
    var start1 = l1, start2 = l2;
    var ret = [];

    while (start1 && start2) {
        if (start1.val < start2.val) {
            ret.push(start1.val);
            start1 = start1.next;
        } else {
            ret.push(start2.val);
            start2 = start2.next;
        }
    }

    while (start1) {
        ret.push(start1.val);
        start1 = start1.next;
    }

    while (start2) {
        ret.push(start2.val);
        start2 = start2.next;
    }

    return ret;
};