[LeetCode]-algorithms-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)).

分析：给定两个已经排好序的数组nums1和nums2，求两个数组的中值，时间复杂度为O(log(m+n))

[]
[1]
=>1.00000
[1,1]
[1,2]
=>1.00000
[2,5,8]
[1,3,6]
=> 4.00000
[2,5,8,9]
[1,3,6,7]
=> 5.50000

public double findMedianSortedArrays(int[] nums1, int[] nums2) {

        int len = nums1.length + nums2.length;

        int[] nums = new int[len];

        int i=0;

        for( ; i<nums1.length; i++)

            nums[i] = nums1[i];

        for(int j=0; j<nums2.length; j++,i++)

            nums[i] = nums2[j];

        Arrays.sort(nums);

        //System.out.println(Arrays.toString(nums) + "-- len:"+len+"--len/2:"+(len/2));

        return len%2==0? ((nums[len/2]+nums[len/2-1])/(2 * 1.0)):(nums[len/2]*1.0) ;

    }

解：需要把两个数组合并成一个数组，并重新排序

巴特西

[LeetCode]-algorithms-Median of Two Sorted Arrays

最新文章

热门文章