-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex-median-two-sorted-array.html
63 lines (58 loc) · 2.01 KB
/
index-median-two-sorted-array.html
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
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8" />
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<title>Page Title</title>
<meta name="viewport" content="width=device-width, initial-scale=1">
</head>
<body>
<script>
// @param {number[]} nums1
// @param {number[]} nums2
// @return {number}
function medianOfTwoSortedArray(nums1, nums2) {
let len1 = nums1.length;
let len2 = nums2.length;
let odd = (len1+len2)%2;
if (odd) {
return kthOfTwoSortedArray(nums1, 0 ,len1-1, nums2, 0, len2-1, (len1+len2+1)/2);
} else {
let m1 = kthOfTwoSortedArray(nums1, 0, len1-1, nums2, 0, len2-1, (len1+len2)/2);
let m2 = kthOfTwoSortedArray(nums1, 0, len1-1, nums2, 0, len2-1, (len1+len2)/2+1);
console.log(m1);
console.log(m2);
return (m1+m2)/2;
}
}
function kthOfTwoSortedArray(nums1, m0, m1, nums2, n0, n1, k) {
let m = m1 - m0 + 1;
let n = n1 - n0 + 1;
// special conditions
if (m > n) {
return kthOfTwoSortedArray(nums2, n0, n1, nums1, m0, m1, k);
}
if (m === 0) {
return nums2[n0+k-1];
}
// recursion
let h = Math.min(Math.floor(k/2), m);
let c = k - h;
if (k === 1) {
return Math.min(nums1[m0], nums2[n0]);
}
if (nums1[m0+h-1] === nums2[n0+c-1]) {
return nums1[m0+h-1];
} else if (nums1[m0+h-1] < nums2[n0+c-1]) {
return kthOfTwoSortedArray(nums1, m0+h, m1, nums2, n0, n1, k-h);
} else {
return kthOfTwoSortedArray(nums1, m0, m1, nums2, n0+c, n1, k-c);
}
}
let nums1 = [1, 3];
let nums2 = [2];
let n = medianOfTwoSortedArray(nums1, nums2);
console.log(n);
</script>
</body>
</html>