-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathaddTwoNumbers.js
More file actions
48 lines (44 loc) · 1.22 KB
/
Copy pathaddTwoNumbers.js
File metadata and controls
48 lines (44 loc) · 1.22 KB
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
// Source : https://leetcode-cn.com/problems/add-two-numbers/
// Author : Tian Zhuo
// Date : 2018-11-21
// [1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1]
// [5,6,4]
// [6,6,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1]
// Definition for singly-linked list.
// function ListNode(val) {
// this.val = val;
// this.next = null;
// }
// function arrToList(arr) {
// let l = new ListNode(0);
// let head = l;
// for (const e of arr) {
// l.next = new ListNode(e);
// l = l.next;
// }
// return head.next;
// }
/**
* @param {ListNode} l1
* @param {ListNode} l2
* @return {ListNode}
*/
var addTwoNumbers = function(l1, l2) {
let dummyHead = new ListNode(0);
let p = l1, q = l2, curr = dummyHead;
let carry = 0;
while (p != null || q != null) {
let x = (p != null) ? p.val : 0;
let y = (q != null) ? q.val : 0;
let sum = carry + x + y;
carry = sum > 9 ? 1 : 0;
curr.next = new ListNode(sum % 10);
curr = curr.next;
if (p != null) p = p.next;
if (q != null) q = q.next;
}
if (carry > 0) {
curr.next = new ListNode(carry);
}
return dummyHead.next;
};