21.合并单链表

/**
 * 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}
 */
/*
* 合并单链表：
* 两种思路：
* 迭代：两个表中的元素依次比较，依次加入新的链表后面
* 递归：需要明确边界条件，是否要借助第三方变量，如果不需要借助第三方变量，就要改变给定链表指针的指向，用来接收递归返回的结果
* */
function ListNode(val, next) {
   this.val = (val===undefined ? 0 : val)
        this.next = (next===undefined ? null : next)
 }
var mergeTwoLists = function(l1, l2) {
    var l3=new ListNode(0),cur=l3;
    while (l1&&l2){
        if(l1.val<=l2.val){
            l3.next = l1;
            l1=l1.next;
        }else {
            l3.next=l2;
            l2=l2.next;
        }
        l3=l3.next;
    }
    l3.next=l2;
    return cur.next;
};
var mergeTwoLists2 = function(l1, l2) {
    if(!l1||!l2){
        return l1||l2;
    }
    if(l1.val<=l2.val){
        l1.next = mergeTwoLists2(l1.next,l2);
        return l1;
    }else {
        l2.next = mergeTwoLists2(l1,l2.next);
        return l2;
    }
};
var mergeTwoLists3 = function(l1, l2) {
    var l3=new ListNode(0);
    if(!l1||!l2){
        return l1||l2;
    }
    if(l1.val<=l2.val){
        l3.val = l1.val;
        l3.next = mergeTwoLists3(l1.next,l2);
        return l3;
    }else {
        l3.val = l2.val;
        l3.next = mergeTwoLists3(l1,l2.next);
        return l3;
    }
};
let getList = function makeList(array) {
    let head = new ListNode()
    let cur = head
    for(let i = 0; i < array.length; i++){
        let node = new ListNode(array[i])
        cur.next = node
        cur = cur.next
    }
    return head.next
}
let arr1 = [2,  5,]
let l1 = getList(arr1)
let arr2 = [4,6]
let l2 = getList(arr2)
// console.log(mergeTwoLists(l1,l2));
console.log(mergeTwoLists3(l1,l2));