LeetCode练习（八） 寻找中位数

题目：
给定两个大小为 m 和 n 的有序数组 nums1 和 nums2。
*
* 请你找出这两个有序数组的中位数，并且要求算法的时间复杂度为 O(log(m + n))。
* 你可以假设 nums1 和 nums2 不会同时为空。
* 示例 1:
* nums1 = [1, 3]
* nums2 = [2]

* 则中位数是 2.0
* 示例 2:
* nums1 = [1, 2]
* nums2 = [3, 4]
*
* 则中位数是 (2 + 3)/2 = 2.5

代码如下：

public class LeetCodeEight {
    /**
     * left_part          |        right_part
     * A[0], A[1], ..., A[i-1]  |  A[i], A[i+1], ..., A[m-1]
     * B[0], B[1], ..., B[j-1]  |  B[j], B[j+1], ..., B[n-1]
     **/
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {


        if (nums1.length > nums2.length) {
            int[] temp = nums1;
            nums1 = nums2;
            nums2 = temp;
        }
        int lengthA = nums1.length;
        int lengthB = nums2.length;

        int Min = 0, Max = lengthA, halfLen = (lengthA + lengthB + 1) / 2;
        while (Min <= Max) {

            int cutA = (Min + Max) / 2;
            int cutB = halfLen - cutA;
            if (cutA < Max && nums1[cutA] < nums2[cutB - 1]) {
                Min = cutA + 1;
            } else if (cutA > Min && nums1[cutA - 1] > nums2[cutB]) {
                Max = cutA - 1;
            } else{
                int maxLeft = 0;
                int minRight = 0;
                if(cutA == 0){
                    maxLeft = nums2[cutB-1];
                }
                else if(cutB == 0){
                    maxLeft = nums1[cutA -1];
                }else {
                    maxLeft = Math.max(nums1[cutA-1], nums2[cutB-1]);
                }
                if ( (lengthA + lengthB) % 2 == 1 ) {
                    return maxLeft;
                }

                if (cutA == lengthA) { minRight = nums2[cutB]; }
                else if (cutB == lengthB) { minRight = nums1[cutA]; }
                else { minRight = Math.min(nums2[cutB], nums1[cutA]); }

                return (maxLeft + minRight) / 2.0;

            }
        }
        return 0.0;
    }


    public static void main(String[] args) {

        LeetCodeEight eight = new LeetCodeEight();
        double medianSortedArrays = eight.findMedianSortedArrays(new int[]{5,6}, new int[]{1,2,3,4,7});
        System.out.println(medianSortedArrays);
    }

}