forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.js
57 lines (56 loc) · 1.07 KB
/
Solution.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
const mergeTwoLists2 = function (l1, l2) {
if (l1 === null && l2 === null) {
return null;
}
if (l1 !== null && l2 === null) {
return l1;
}
if (l1 === null && l2 !== null) {
return l2;
}
if (l1 !== null && l2 !== null) {
let t = null, h = null;
if (l1.val > l2.val) {
t = l2;
h = l2;
l2 = l2.next;
} else {
t = l1;
h = l1;
l1 = l1.next;
}
while (l1 !== null && l2 !== null) {
if (l1.val > l2.val) {
t.next = l2;
t = t.next;
l2 = l2.next;
} else {
t.next = l1;
t = t.next;
l1 = l1.next;
}
}
while (l1 !== null) {
t.next = l1;
l1 = l1.next;
t = t.next;
}
while (l2 !== null) {
t.next = l2;
l2 = l2.next;
t = t.next;
}
return h;
}
}
const mergeTwoLists = function (l1, l2) {
if (l1 === null) return l2;
if (l2 === null) return l1;
if (l1.val < l2.val) {
l1.next = mergeTwoLists(l1.next, l2);
return l1;
} else {
l2.next = mergeTwoLists(l1, l2.next);
return l2;
}
}