-
Notifications
You must be signed in to change notification settings - Fork 0
/
4. 寻找两个有序数组的中位数.java
45 lines (45 loc) · 1.42 KB
/
4. 寻找两个有序数组的中位数.java
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
class Solution {
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
int m = nums1.length;
int n = nums2.length;
if (m > n) {
int[] temp = nums1;
nums1 = nums2;
nums2 = temp;
int tmp = m;
m = n;
n = tmp;
}
int imin = 0, imax = m, halflen = (m + n + 1) / 2;
while (imin <= imax) {
int i = (imin + imax) / 2, j = halflen - i;
if (i > imin && nums1[i - 1] > nums2[j]) {
imax = i - 1;
} else if (i < imax && nums2[j - 1] > nums1[i]) {
imin = i + 1;
} else {
int maxLeft = 0;
if (i == 0) {
maxLeft = nums2[j - 1];
} else if (j == 0) {
maxLeft = nums1[i - 1];
} else {
maxLeft = Math.max(nums1[i - 1], nums2[j - 1]);
}
if ((m + n) % 2 == 1) {
return maxLeft;
}
int minRight = 0;
if (i == m) {
minRight = nums2[j];
} else if (j == n) {
minRight = nums1[i];
} else {
minRight = Math.min(nums1[i], nums2[j]);
}
return (maxLeft + minRight) / 2.0;
}
}
return 0.0;
}
}