-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q66.js
65 lines (54 loc) · 1.62 KB
/
Q66.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
// 2. Add Two Numbers
// 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 contains a single digit. Add the two numbers and return the sum as a linked list.
// You may assume the two numbers do not contain any leading zero, except the number 0 itself.
function ListNode(val, next) {
this.val = val === undefined ? 0 : val;
this.next = next === undefined ? null : next;
}
function createList(arr) {
let head = new ListNode();
head.val = arr[0];
let top = head;
for (let i = 1; i < arr.length; i++) {
head.next = new ListNode(arr[i]);
head = head.next;
}
return top;
}
var addTwoNumbers = function (l1, l2) {
let num1 = [];
let num2 = [];
while (l1) {
num1.push(l1.val);
l1 = l1.next;
}
console.log(num1);
num1.reverse();
while (l2) {
num2.push(l2.val);
l2 = l2.next;
}
console.log(num2);
num2.reverse();
num1 = parseInt(num1.join(""));
console.log(num1);
num2 = parseInt(num2.join(""));
console.log(num2);
// let answer = parseInt(num1) + parseInt(num2);
let answer = num1 + num2
console.log(answer);
answer = answer.toString().split("").reverse();
let head = new ListNode();
head.val = parseInt(answer[0]);
let top = head;
for (let i = 1; i < answer.length; i++) {
head.next = new ListNode(parseInt(answer[i]));
head = head.next;
}
return top;
};
let l1 = createList([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])
let l2 = createList([5,6,4])
// console.log(addTwoNumbers(l1, l2));
let answer = addTwoNumbers(l1, l2);
console.log(answer);