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

我的想法

时间复杂度O(log (m+n))必须要用分治或者二分。

解答

jiuzhang solution: divide and conquer

class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int len = nums1.length + nums2.length;
        if(len % 2 == 0) {
            int res1 = helper(nums1, 0, nums2, 0, len / 2);
            int res2 = helper(nums1, 0, nums2, 0, len / 2 + 1);
            return (double)(res1 + res2) / 2;
        }
        return helper(nums1, 0, nums2, 0, len / 2 + 1);
    }
    
    private int helper(int[] nums1, int start1, int[] nums2, int start2, int k) {
        if(start1 >= nums1.length) {
            return nums2[start2 + k - 1];
        }
        if(start2 >= nums2.length) {
            return nums1[start1 + k - 1];
        }
        if(k == 1) {
            return Math.min(nums1[start1], nums2[start2]);
        }
        
        int half1 = start1 + k / 2 - 1 < nums1.length ? 
            nums1[start1 + k / 2 - 1] : Integer.MAX_VALUE;
        int half2 = start2 + k / 2 - 1 < nums2.length ? 
            nums2[start2 + k / 2 - 1] : Integer.MAX_VALUE;
        
        if (half1 < half2) {
            return helper(nums1, start1 + k / 2, nums2, start2, k - k / 2);
        } else {
            return helper(nums1, start1, nums2, start2 + k / 2, k - k / 2);
        }
    }
}