美文网首页
Merge Two Sorted Lists(LeetCode)

Merge Two Sorted Lists(LeetCode)

作者: 静候那一米阳光 | 来源:发表于2017-05-26 16:31 被阅读0次

Merge Two Sorted Lists

合并两个有序链表。

JavaScript 实现算法

function ListNode(val) {
    this.val = val;
    this.next = null;
}
var mergeTwoLists = function(l1, l2) {
    var r={};
    var cur=r;
    while(l1&&l2){
        if(l1.val<=l2.val){
            cur.next=l1;
            l1=l1.next;
        }else{
            cur.next=l2;
            l2=l2.next;
        }
        cur=cur.next;
    }
    cur.next=l1?l1:l2;
    return r.next;
};
var l1=new ListNode(1);
var l2=new ListNode(0);
var res = mergeTwoLists(l1,l2);
console.log(res);

更多语言方法解析参考 http://www.cnblogs.com/grandyang/p/4086297.html

相关文章

网友评论

      本文标题:Merge Two Sorted Lists(LeetCode)

      本文链接:https://www.haomeiwen.com/subject/ossxfxtx.html