-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path#21 Merge Two Sorted Lists.js
More file actions
57 lines (52 loc) · 1.08 KB
/
Copy path#21 Merge Two Sorted Lists.js
File metadata and controls
57 lines (52 loc) · 1.08 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
49
50
51
52
53
54
55
56
57
/**
* Merge two sorted linked lists and return it as a new list.
* The new list should be made by splicing together the nodes of the first two lists.
* Example:
* Input: 1->2->4, 1->3->4
* Output: 1->1->2->3->4->4
*/
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} l1
* @param {ListNode} l2
* @return {ListNode}
*/
// recursviely
var mergeTwoLists = function(l1, l2) {
if(!l1) return l2;
if(!l2) return l1;
let res = null;
if(l1.val < l2.val){
res = l1;
res.next = mergeTwoLists(l1.next, l2);
} else{
res = l2;
res.next = mergeTwoLists(l1, l2.next);
}
return res;
};
// iteratively
var mergeTwoLists = function(l1, l2) {
if(!l1) return l2;
if(!l2) return l1;
let res = new ListNode(null);
let dumb = res;
while(l1 && l2){
if(l1.val < l2.val){
res.next = l1;
l1 = l1.next;
} else{
res.next = l2;
l2 = l2.next;
}
res = res.next;
}
res.next = l1 || l2;
return dumb.next;
};