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
题目大意:在两个有序数组中找到中位数。
思路1:定义一个新数组,将两个数组合并为一个排序数组,然后找到中位数。
代码实现(思路1):
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
int sum = nums1.size()+nums2.size();
double* arr = new double[sum];
int i = 0,j=0;
int pos = 0;
while(i<nums1.size() && j<nums2.size())
{
if(nums1[i] < nums2[j])
{
arr[pos++] = nums1[i];
i++;
}
else if(nums1[i] > nums2[j])
{
arr[pos++] = nums2[j];
j++;
}
else{
arr[pos++] = nums1[i];
arr[pos++] = nums2[j];
i++;
j++;
}
}
while(i<nums1.size())
{
arr[pos++] = nums1[i++];
}
while(j<nums2.size())
{
arr[pos++] = nums2[j++];
}
if(sum%2 == 0)
return ((arr[(sum/2)]+arr[(sum/2)-1])/2);
else
return arr[sum/2];
}
思路2:(类似二分的思路)
1、保证第1个数组的元素数量最少;
2、先求两个数组的中位数K,然后寻找该位置的数,我们每次都剔除在第K个数之前的数,这样就会达到类似于二分法的效果。
代码实现(思路2):
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2,int K)
{
int sum1 = nums1.size();
int sum2 = nums2.size();
if (sum1 > sum2)
return findMedianSortedArrays(nums2, nums1, K);
if (sum1 == 0)
return nums2[K - 1];
if (K == 1)
return min(nums1[0],nums2[0]);
int pos = min(sum1, K / 2); int index = K - pos;
if (nums1[pos - 1] == nums2[index - 1])
return nums1[pos - 1];
else if (nums1[pos - 1] < nums2[index - 1]){
vector<int> s;
int i = pos;
for (i; i < sum1; i++)
{
s.push_back(nums1[i]);
}
return findMedianSortedArrays(s, nums2, K - pos);
}
else if (nums1[pos - 1] > nums2[index - 1])
{
vector<int> s;
int i = index;
for (i; i < sum2; i++)
{
s.push_back(nums2[i]);
}
return findMedianSortedArrays(nums1, s, K - index);
}
}
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2)
{
int sum = nums1.size() + nums2.size();
if (sum % 2 == 0)
return (findMedianSortedArrays(nums1, nums2, sum / 2 + 1) + findMedianSortedArrays(nums1, nums2, sum / 2) / 2);
else
return findMedianSortedArrays(nums1, nums2, sum / 2 + 1);
}