-
Notifications
You must be signed in to change notification settings - Fork 0
/
2.add-two-numbers.js
91 lines (72 loc) · 1.74 KB
/
2.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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
/*
* @lc app=leetcode id=2 lang=javascript
*
* [2] Add Two Numbers
*/
// @lc code=start
/**
* 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) {
let head = new ListNode(0)
let current = head
let tmp_sum = 0
while (l1 || l2) {
current.next = new ListNode(tmp_sum)
current = current.next
current.val += (l1 ? l1.val : 0) + (l2 ? l2.val : 0)
l1 = l1?.next
l2 = l2?.next
tmp_sum = current.val / 10 | 0
current.val %= 10
}
if (tmp_sum)
current.next = new ListNode(tmp_sum)
return head.next
};
// @lc code=end
function ListNode(val, next) {
this.val = (val===undefined ? 0 : val)
this.next = (next===undefined ? null : next)
}
function makeChain(vals) {
let head = new ListNode()
current = head
for(let v of vals) {
current.next = new ListNode(v)
current = current.next
}
return head.next
}
function chainToArray(node) {
let array = []
while (node != null) {
array.push(node.val)
node = node.next
}
return array
}
console.log(chainToArray(addTwoNumbers(
makeChain([2, 4]), makeChain([5, 6, 4])
)))
console.log(chainToArray(addTwoNumbers(
makeChain([0, 2, 4]), makeChain([5, 6, 4])
)))
console.log(chainToArray(addTwoNumbers(
makeChain([0]), makeChain([5, 6, 4])
)))
console.log(chainToArray(addTwoNumbers(
makeChain([9, 9, 9]), makeChain([9, 9, 9])
)))
console.log(chainToArray(addTwoNumbers(
makeChain([9, 9, 9]), makeChain([1])
)))