题目描述 There are two sorted arrays nums1 and nums2 of size m and n respectively.
Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
Example 1:
nums1 = [1, 3]
nums2 = [2]
The median is 2.0
Example 2:
nums1 = [1, 2]
nums2 = [3, 4]
The median is (2 + 3)/2 = 2.5
这道题是一道求中位数的题目难点在于限制了时间复杂度 O(log (m+n)) 。
那怎么去做呢 前提的条件就是有序的那么中位数 必然在
k = (n + m - 1) / 2 这里 (这个不是答案 因为有奇数和偶数的情况 下面再做处理 )
我们让a 的数组长度大于等于 b的数组长度 得到两个数组中间的值
int midA = (l + r) / 2;
int midB = k - midA;//
下面只需要 一段一段的进行二分查找即可
下面给出源代码
public double findMedianSortedArrays(int A[], int B[]) {
int n = A.length;
int m = B.length;
if (n > m)
return findMedianSortedArrays(B, A);
// now, do binary search
int k = (n + m - 1) / 2;
//k max
int l = 0, r = Math.min(k, n); // r is n, NOT n-1, this is important!!
// l r
while (l < r) {
int midA = (l + r) / 2;
int midB = k - midA;//
if (A[midA] < B[midB])
l = midA + 1;
else
r = midA;
}
int a = Math.max(l > 0 ? A[l - 1] : Integer.MIN_VALUE, k - l >= 0 ? B[k - l] : Integer.MIN_VALUE);
if (((n + m) & 1) == 1)
return (double) a;
int b = Math.min(l < n ? A[l] : Integer.MAX_VALUE, k - l + 1 < m ? B[k - l + 1] : Integer.MAX_VALUE);
return (a + b) / 2.0;
}
文章地址:http://www.haha174.top/article/details/254527
项目源码:https://github.com/haha174/daylx.git