-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2.add-two-numbers.js
55 lines (48 loc) · 1.03 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
/*
* @lc app=leetcode.cn id=2 lang=javascript
*
* [2] 两数相加
*/
// @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) {
if (!l1 || !l2) {
return
}
let node = new ListNode(0)
let carry = 0
let tmp1 = l1
let tmp2 = l2
let tmp = node
while(tmp1 || tmp2) {
let val1 = tmp1 && tmp1.val || 0
let val2 = tmp2 && tmp2.val || 0
let sum = val1 + val2 + carry
carry = sum >= 10 ? 1 : 0
let newNode = new ListNode(sum % 10)
tmp.next = newNode
tmp = tmp.next
if (tmp1) {
tmp1 = tmp1.next
}
if (tmp2) {
tmp2 = tmp2.next
}
}
if (carry > 0) {
tmp.next = new ListNode(carry)
}
return node.next
};
// @lc code=end