[LeetCode 解题报告]004.Median of Two Sorted Arrays

 

Description:

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

Hard不亏是Hard，刷起来还是吃力，暂时想不到时间复杂度为O(log (m+n))的解法（肯定是得用二分查找，不然降不到log n），下面贴出O(m+n)解法。将其转换成找第Kth小问题。而且两个数组还都是排序好的。注意如果nums1的数组加nums2的数组长度为偶数（Examples 2）

 

class Solution {
public:
    int findKth(vector<int> nums1, vector<int> nums2, int k) {
        
        int m = nums1.size(), n = nums2.size();
        int i = 0, j = 0, cur = 0;
        
        while(i < m && j < n) {
            
            if(nums1[i] < nums2[j]) {
                cur ++;
                if(cur == k)
                    return nums1[i];
                i ++;
            }
            else {
                cur ++;
                if(cur == k) 
                    return nums2[j];
                j ++;
            }
        }
        
        while(i < m) {
            cur ++;
            if(cur == k)
                return nums1[i];
            i ++;
        }
        
        while(j < n) {
            cur ++;
            if(cur == k)
                return nums2[j];
            j ++;
        }
        return 0;
    }
    
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        
        int totalLength = nums1.size() + nums2.size();
        
        if(totalLength & 0x00000001)
            return findKth(nums1, nums2, totalLength/2 + 1);
        else
            return (findKth(nums1, nums2, totalLength/2) + findKth(nums1, nums2, totalLength/2 +1))/2.0;
    }
};