forked from jeantimex/javascript-problems-and-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathadd-two-numbers-ii.js
65 lines (56 loc) · 1.39 KB
/
add-two-numbers-ii.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
/**
* Add Two Numbers II
*
* You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes
* first 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.
*
* Follow up:
* What if you cannot modify the input lists? In other words, reversing the lists is not allowed.
*
* Example:
*
* Input: (7 -> 2 -> 4 -> 3) + (5 -> 6 -> 4)
* Output: 7 -> 8 -> 0 -> 7
*/
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} l1
* @param {ListNode} l2
* @return {ListNode}
*/
const addTwoNumbers = (l1, l2) => {
// Let's use two stacks to help
const s1 = [];
const s2 = [];
while (l1) {
s1.push(l1.val);
l1 = l1.next;
}
while (l2) {
s2.push(l2.val);
l2 = l2.next;
}
// Perform the addition
let carry = 0;
let list = null;
while (s1.length > 0 || s2.length > 0 || carry > 0) {
const v1 = s1.length > 0 ? s1.pop() : 0;
const v2 = s2.length > 0 ? s2.pop() : 0;
const node = new ListNode((v1 + v2 + carry) % 10);
carry = Math.floor((v1 + v2 + carry) / 10);
if (list) {
node.next = list;
}
list = node;
}
return list;
};
export { addTwoNumbers };