每天一道算法题--Median of Two Sorted Arrays

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)).

You may assume nums1 and nums2 cannot be both empty.

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

double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2)
{
vector<int> tmp;
int len1 =nums1.size(),len2 = nums2.size();
//cout<<len1<<" "<<len2<<endl;
int i =0,j=0;
while(i<len1&&j<len2){
if(nums1[i]<nums2[j]){
tmp.push_back(nums1[i]);
i++;
}else if(nums1[i]>nums2[j]){
tmp.push_back(nums2[j]);
j++;
}else{
tmp.push_back(nums1[i]);
tmp.push_back(nums2[j]);
i++;
j++;
}
}
//cout<<tmp.size()<<endl;
while(i<len1){
tmp.push_back(nums1[i++]);
}
while(j<len2){
tmp.push_back(nums2[j++]);
}
int length = tmp.size();
//cout<<length<<endl;
if(length%2!=0)
return 1.0*tmp[length/2];
else
return (tmp[length/2]+tmp[length/2-1])/2.0;
}

03-06 265

06-29 2476