-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathaddTwoNumbers.js
More file actions
51 lines (44 loc) · 1.12 KB
/
Copy pathaddTwoNumbers.js
File metadata and controls
51 lines (44 loc) · 1.12 KB
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
/**
* 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
* Explanation: 342 + 465 = 807.
*/
/**
* Definition for singly-linked list
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} l1
* @param {ListNode} l2
* @returns {ListNode}
*/
var addTwoNumbers = function(l1, l2) {
const result = new ListNode(0);
let curr = result;
let carry = 0;
while (l1 || l2) {
if (l1) {
carry += l1.val;
l1 = l1.next;
}
if (l2) {
carry += l2.val;
l2 =l2.next;
}
curr = curr.next = new ListNode(carry % 10);
carry = Math.floor(carry / 10);
}
if (carry !== 0) {
curr.next = new ListNode(carry);
}
return result.next;
}