-
Notifications
You must be signed in to change notification settings - Fork 1
/
addTwoNumbers.js
65 lines (52 loc) · 1.56 KB
/
addTwoNumbers.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/*
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 contains a single digit. Add the two numbers and return the sum as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
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]
Constraints:
The number of nodes in each linked list is in the range [1, 100].
0 <= Node.val <= 9
It is guaranteed that the list represents a number that does not have leading zeros.
*/
/**
* 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) {
const dummyNode = new ListNode();
let carry = 0;
let currentNode = dummyNode;
while(l1 !== null || l2 !== null) {
if (l1 !== null) {
carry += l1.val;
l1 = l1.next;
}
if (l2 !== null) {
carry += l2.val;
l2 = l2.next;
}
currentNode.next = new ListNode(carry % 10);
currentNode = currentNode.next;
carry = ~~(carry / 10);
}
if (carry > 0){
currentNode.next = new ListNode(carry);
}
return dummyNode.next;
};