You are given two non-empty linked lists representing two non-negative integers. Each of their digits is stored in reverse order, and each node can only store one digit.
Please add two numbers and return a linked list representing the sum in the same form.
You can assume that neither number starts with a zero other than the number zero.
Example 1:
Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.
Example 2:
Input: l1 = [0], l2 = [0]
Output: [0]
Example 3:
Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
Output: [8,9,9,9,0,0,0,1]
hint:
The number of nodes in each linked list is in the range [1, 100]
0 <= Node.val <= 9
Title data guarantee that the number represented by the list does not contain leading zeros
Solution: add two numbers and divide by 10, take the remainder as the current digit sum, % take the divisor as the current base, note that if there is a carry after the last digit, record the carry
/**
* Definition for singly-linked list.
* function ListNode(val, next) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
*/
/**
* @param {ListNode} l1
* @param {ListNode} l2
* @return {ListNode}
*/
var addTwoNumbers = function(l1, l2) {
let result = new ListNode(0);
let head = result
let inter = 0
while(l1 || l2|| inter){
let sum
if(l1 && l2) {
sum = l1.val + l2.val + inter
l1 = l1.next
l2 = l2.next
} else if(l1){
sum = l1.val + inter
l1 = l1.next
} else if(l2){
sum = l2.val + inter
l2 = l2.next
}else if(inter){
sum = inter
}
head.next = new ListNode(sum % 10)
head = head.next
inter = Math.floor(sum /10)
}
return result.next
};