2.两数相加

/*给定两个链表，表示非负数，每位数字逆序排列，每个节点只能存储一位数字，
请将两数相加，返回一个表示和的链表
function two_num_sum_linkList_store(l1,l2):ListNode
在js中怎么表示ListNode
在js中怎么构造链表,js构造函数
js中使用parseInt()得到整除的结果
*/

function ListNode(val,next){
    this.val=val===undefined?0:val;
    this.next = (next===undefined?null:next);
}
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
}
// 循环法
function two_num_sum_linkList_store(l1,l2)
{
    var result=new ListNode(0);
    var cur=result;
    var next=0,total=0;
    while (l1&&l2){
        total = l1.val+l2.val+next;
        cur.next=new ListNode(total%10);
        next=parseInt(total/10);
        l1=l1.next;
        l2=l2.next;
        cur=cur.next;
    }
    var rest=l1?l1:l2;
    while (rest){
        total = rest.val+next;
        cur.next=new ListNode(total%10);
        next=parseInt(total/10);
        rest=rest.next;
        cur=cur.next;
    }
    if(next){
        cur.next = new ListNode(next);
    }
    return result.next;
}
// 递归法
function two_number_sum_iteator(l1,l2){
    var cur=result;
    var total=l1.val+l2.val;
    var result=new ListNode(total%10);
    var next=parseInt(total/10);
    if(l1.next||l2.next||next){
        l1 = l1.next?l1.next:new ListNode(0);
        l2 = l2.next?l2.next:new ListNode(0);
        l1.val=l1.val+next;
        result.next = two_num_sum_linkList_store(l1,l2);
    }
    return result;
}
let arr1 = [2, 4, 3]
let l1 = getList(arr1)
let arr2 = [5,6,4]
let l2 = getList(arr2)
console.log(two_number_sum_iteator(l1,l2));