forked from rubythonode/javascript-problems-and-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathadd-two-numbers.js
50 lines (40 loc) · 1.04 KB
/
add-two-numbers.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
/**
* 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.
*
* Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
* Output: 7 -> 0 -> 8
*/
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
import ListNode from 'common/list-node';
/**
* @param {ListNode} l1
* @param {ListNode} l2
* @return {ListNode}
*/
const addTwoNumbers = (l1, l2) => {
const f = new ListNode(0);
let p = f;
let c = 0;
while (l1 || l2 || c > 0) {
const a = l1 ? l1.val : 0;
const b = l2 ? l2.val : 0;
const s = a + b + c;
c = parseInt(s / 10, 10);
p.next = new ListNode(s % 10);
p = p.next;
l1 = l1 ? l1.next : null;
l2 = l2 ? l2.next : null;
}
return f.next;
};
export default addTwoNumbers;