-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathmain.js
63 lines (61 loc) · 1.12 KB
/
main.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
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} l1
* @param {ListNode} l2
* @return {ListNode}
*/
var addTwoNumbers = function (l1, l2) {
const dummy = new ListNode(-1)
let cur = dummy
let carry = 0
while (l1 != null || l2 != null || carry !== 0) {
cur.next = new ListNode(-1)
cur = cur.next
let val1 = l1 == null ? 0 : l1.val
let val2 = l2 == null ? 0 : l2.val
cur.val = (val1 + val2 + carry) % 10
carry = Math.floor((val1 + val2 + carry) / 10)
l1 = l1 == null ? l1 : l1.next
l2 = l2 == null ? l2 : l2.next
}
return dummy.next
}
if (process.env.next) { // local test
const assert = require('chai').assert
let l1 = {
val: 2,
next: {
val: 4,
next: {
val: 3,
next: null
}
}
}
let l2 = {
val: 5,
next: {
val: 6,
next: {
val: 3,
next: null
}
}
}
assert.deepEqual(addTwoNumbers(l1, l2), {
val: 8,
next: {
val: 0,
next: {
val: 6,
next: null
}
}
})
}