LeetCode4. Median of Two Sorted Arrays(java实现)

• 问题描述

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.

• 解决方案

代码如下:

public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int len = nums1.length + nums2.length;
        if(len % 2 == 0)
            return (help(nums1,0,nums2,0,len / 2) + help(nums1,0,nums2,0,len / 2 + 1)) / 2.0;
        else
            return help(nums1,0,nums2,0,len / 2 + 1);
    }

    public static int help(int[] nums1,int left1,int[] nums2,int left2,int k){
        if(left1 == nums1.length)
            return nums2[left2 + k - 1];
        if(left2 == nums2.length)
            return nums1[left1 + k - 1];
        if(k == 1)
            return Math.min(nums1[left1],nums2[left2]);
        int index1 = left1 + k / 2 - 1;
        int index2 = left2 + k / 2 - 1;
        if(index2 >= nums2.length)
            return help(nums1,index1 + 1,nums2,left2,k - k / 2);
        if(index1 >= nums1.length)
            return help(nums1,left1,nums2,index2 + 1,k - k / 2);
        if(nums1[index1] > nums2[index2] )
            return help(nums1,left1,nums2,index2 + 1,k - k / 2);
        else
            return help(nums1,index1 + 1,nums2,left2,k - k / 2);
    }