给出两个 非空 的链表用来表示两个非负的整数。其中,它们各自的位数是按照 逆序 的方式存储的,并且它们的每个节点只能存储 一位 数字。
如果,我们将这两个数相加起来,则会返回一个新的链表来表示它们的和。
您可以假设除了数字 0 之外,这两个数都不会以 0 开头。
示例:
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出:7 -> 0 -> 8
原因:342 + 465 = 807
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} l1
* @param {ListNode} l2
* @return {ListNode}
*/
var addTwoNumbers = function(l1, l2) {
let num1 = [l1.val], num2= [l2.val]
while (l1.next) {
l1 = l1.next
num1.push(l1.val)
}
while (l2.next) {
l2 = l2.next
num2.push(l2.val)
}
let nodes= []
let min = Math.min(num1.length, num2.length), max = Math.max(num2.length, num1.length)
for (let i = 0; i < min; i++) {
let num = num1[i] + num2[i]
console.log(num%10, num/10)
nodes.push(new ListNode(num%10))
let floor = Math.floor(num/10)
if (floor < 1 ) {
continue
}
if (num1.length > num2.length) {
num1[i+1] += floor
} else if (num2.length > num1.length) {
num2[i+1] += floor
} else if (num1.length == num2.length) {
i==min-1 ? nodes.push(new ListNode(floor)) : num2[i+1] +=floor
}
}
if (num1.length == num2.length) {
nodes.forEach((node, idx) => {
nodes[idx+1] ? node.next = nodes[idx+1] : null
})
return nodes[0]
}
for (let i = min; i< max; i++) {
if (num1.length > num2.length) {
if (num1[i] >= 10 && i == max -1) {
nodes.push(new ListNode(num1[i]%10))
nodes.push(new ListNode(Math.floor(num1[i]/10)))
} else if (num1[i] >= 10 && i != max -1) {
num1[i+1] += Math.floor(num1[i]/10)
nodes.push(new ListNode(num1[i]%10))
} else if (num1[i] < 10) {
nodes.push(new ListNode(num1[i]))
}
} else {
if (num2[i] >= 10 && i == max -1) {
nodes.push(new ListNode(num2[i]%10))
nodes.push(new ListNode(Math.floor(num2[i]/10)))
} else if (num2[i] >= 10 && i != max -1) {
num2[i+1] += Math.floor(num2[i]/10)
nodes.push(new ListNode(num2[i]%10))
} else if (num2[i] < 10) {
nodes.push(new ListNode(num2[i]))
}
}
}
nodes.forEach((node, idx) => {
nodes[idx+1] ? node.next = nodes[idx+1] : null
})
return nodes[0]
};