4. Median of Two Sorted Arrays

4. Median of Two Sorted Arrays

Hard

4731669FavoriteShare

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

Accepted

477,296

Submissions

1,771,821

class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        int len1=nums1.size();
        int len2=nums2.size();
        
        int total = len1+len2;
        if(total& 0x1)
        {
            return (double)findKth(nums1,0,len1-1,nums2,0,len2-1,total/2+1);
        }else{
            return (double)(findKth(nums1,0,len1-1,nums2,0,len2-1,total/2)+findKth(nums1,0,len1-1,nums2,0,len2-1,total/2+1))/2.0;
        }
    }
    double findKth(vector<int>& nums1,int start1,int end1,vector<int>& nums2,int start2,int end2,int k){
        int length1 = end1-start1+1;
        int length2 = end2-start2+1;
        
        if(length1>length2)
            return findKth(nums2,start2,end2,nums1,start1,end1,k);
        else if(length1==0){
            return nums2[start2+k-1];
        }
        else if(k==1)
        {
            //return Math.min(nums[start1],nums[start2]);
            return (nums1[start1]>nums2[start2]?nums2[start2]:nums1[start1]);
        }
        
       // int p1 = Math.min(k/2,length1);
        int p1 = (k/2>length1?length1:k/2);
        int p2 = k-p1;
        
        if(nums1[start1+p1-1]>nums2[start2+p2-1]){
            return findKth(nums1,start1,end1,nums2,start2+p2,end2,k-p2);
        }else if(nums1[start1+p1-1]<nums2[start2+p2-1]){
            return findKth(nums1,start1+p1,end1,nums2,start2,end2,k-p1);
        }else return nums1[start1+p1-1];
    }
};