题目:给定2个数组nums1和nums2,长度分别为m和n,求2个数组中间的元素,总时间复杂度为O(log(m+n))。
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
首先,对于这道题,最基本的思路是把2个数组合并,然后取合并数组中间的元素,这样时间复杂度是O(m+n), 显然不符合题意。
那有没有更简单的思路呢?
我们可以吧问题转化成求合并数组的第k个元素,那么我们只需要比较nums1和nums2的第k/2个元素就行(其中k/2取下整,当然也还要和数组长度比较),假设nums1[k/2-1]>=nums[k/2-1], 那么把nums2的前k/2个元素删除,k=k-k/2(注意k-k/2不一定等于k/2),反之同理, 这样时间复杂度也就为O(log(m+n))
class Solution {
public:
//get k-th element in nums1 and nums2
double getKth(vector<int>& nums1,vector<int>& nums2,int low1,int high1,int low2,int high2,int k)
{
if(nums1.size()==0||low1>high1)
return nums2[low2+k-1];
if(nums2.size()==0||low2>high2)
return nums1[low1+k-1];
if(k==1)
return min(nums1[low1],nums2[low2]);
int t1=min(high1-low1+1,k/2),t2=min(high2-low2+1,k/2);
if(nums1[low1+t1-1]<=nums2[low2+t2-1])
return getKth(nums1,nums2,low1+t1,high1,low2,high2,k-t1);
else
return getKth(nums1,nums2,low1,high1,low2+t2,high2,k-t2);
}
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
int low1=0,high1=nums1.size()==0?0:nums1.size()-1,low2=0,high2=nums2.size()==0?0:nums2.size()-1;
int k1=(nums1.size()+nums2.size()+1)/2,k2=(nums1.size()+nums2.size()+2)/2;
if((nums1.size()+nums2.size())%2==0)
{
return (getKth(nums1,nums2,low1,high1,low2,high2,k1)+getKth(nums1,nums2,low1,high1,low2,high2,k2))/2;
}
else
{
return getKth(nums1,nums2,low1,high1,low2,high2,k1);
}
}
};