-
Notifications
You must be signed in to change notification settings - Fork 8
/
add-two-numbers.js
48 lines (45 loc) · 1.2 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
// 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.
//
// Example:
//
//
// Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
// Output: 7 -> 0 -> 8
// Explanation: 342 + 465 = 807.
//
//
/**
* 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) {
var result = new ListNode(-1),
r = result,
cur;
while (l1 !== null || l2 !== null) {
cur = r.next || new ListNode(0);
r.next = cur;
cur.val += (l1 && l1.val || 0);
cur.val += (l2 && l2.val || 0);
if (cur.val > 9) {
cur.next = new ListNode(1);
cur.val -= 10;
}
r = cur;
l1 = l1 && l1.next;
l2 = l2 && l2.next;
}
r = result.next;
result.next = null;
return r;
};