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)).
解题思路:其实本题的核心便是在O(log(m+n))的时间复杂度内找到两个有序数组中的第K小的值,又因为要求的是log级的时间复杂度加上两个数组的有序性,我们便不难想到利用分治的方法来寻找两个有序数组中的第K小的数,这样我们便可以计算两个有序数组的中位数了,分为奇数和偶数两种情况进行计算。
class Solution {
public:
int findKthElement(int arr1[], int n, int arr2[], int m, int k) {
if(n > m) {
return findKthElement(arr2, m, arr1, n, k);
}
if(n == 0) {
return arr2[k-1];
}
if(m == 0) {
return arr1[k-1];
}
if(k == 1) {
return min(arr1[0], arr2[0]);
}
int p1 = min(n, k / 2), p2 = k - p1;
if(arr1[p1-1] < arr2[p2-1]) {
return findKthElement(arr1 + p1, n - p1, arr2, m, k - p1);
} else if(arr1[p1-1] > arr2[p2-1]) {
return findKthElement(arr1, n, arr2 + p2, m - p2, k - p2);
} else {
return arr1[p1-1]; // or arr2[p2-1]
}
}
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
int len1 = nums1.size();
int len2 = nums2.size();
int arr1[100010], arr2[100010];
for(int i = 0; i < len1; ++i) {
arr1[i] = nums1[i];
}
for(int i = 0; i < len2; ++i) {
arr2[i] = nums2[i];
}
if((len1+len2)%2) {
return findKthElement(arr1, len1, arr2, len2, (len1+len2+1)/2);
} else {
return (findKthElement(arr1, len1, arr2, len2, (len1+len2)/2) + \
findKthElement(arr1, len1, arr2, len2, (len1+len2)/2+1)) / 2.0;
}
}
};