Problem
Description
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Example
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Answer
Thinking
Nothing
Code
/**
* 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) {
var carry = 0;
var sum = l1.val + l2.val,n1 = l1.next,n2 = l2.next;
var head = new ListNode(sum % 10), temp = head;
sum = Math.floor(sum / 10);
while(n1 || n2 || sum !== 0){
sum += (n1?n1.val:0)+(n2?n2.val:0);
temp.next = new ListNode(sum%10);
temp = temp.next;
n1 = n1 ? n1.next : null;
n2 = n2 ? n2.next : null;
sum = Math.floor(sum / 10);
}
return head;
};
