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)).
Subscribe to see which companies asked this question
写代码
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
if(nums1.empty()&&nums2.empty())
return -10.0;
int m=nums1.size();
int n=nums2.size();
vector<int> nums3(m+n);
int i=0,j=0;
while(i<m||j<n)
{
if(nums1[i]==NULL)
{
nums3[k++]=nums[j];
}
else if(nums2[j]==NULL)
{
nums3[k++]=nums[i];
}
else if(nums1[i]<nums2[j])
{
nums3[k++]=nums[i];
i++;
}
else if(nums[i]>=nums[j])
{
num3[k++]=nums[j];
j++;
}
}
int a=(m+n)%2;
if(a)
{
return (double)nums3[(m+n)/2];
}
else
{
return (double)((nums3[(m+n)/2]+nums3[(m+n)/2-1])/2);
}
}
};
提示warning: NULL used in arithmetic [-Wpointer-arith]、
感觉应该是因为vector超出范围导致的问题
经过修改后为
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
if(nums1.empty()&&nums2.empty())
return -10.0;
int m = nums1.size();
int n = nums2.size();
vector<int> nums3(m+n);
int i = 0, j = 0 , k=0;
while (i < m&&j < n)
{
if (nums1[i] <= nums2[j])
{
nums3[k++] = nums1[i];
i++;
}
else{
nums3[k++] = nums2[j];
j++;
}
}//while
while (i < m)
{
nums3[k++] = nums1[i];
i++;
}//while
while (j < n)
{
nums3[k++] = nums2[j];
j++;
}//while
int a=(m+n)%2;
if(a)
{
return (double)nums3[(m+n)/2];
}
else
{
return (double)((nums3[(m+n)/2]+nums3[(m+n)/2-1])/2.0);
}
}
};