1class Solution {2    public double findMedianSortedArrays(int[] nums1, int[] nums2) {3        if (nums1.length > nums2.length) return findMedianSortedArrays(nums2, nums1);4        int m = nums1.length, n = nums2.length;5        int left = 0, right = m;6        while (left <= right) {7            int i = left + (right - left) / 2;8            int j = (m + n + 1) / 2 - i;9            int leftA = i == 0 ? Integer.MIN_VALUE : nums1[i - 1];10            int rightA = i == m ? Integer.MAX_VALUE : nums1[i];11            int leftB = j == 0 ? Integer.MIN_VALUE : nums2[j - 1];12            int rightB = j == n ? Integer.MAX_VALUE : nums2[j];13            if (leftA <= rightB && leftB <= rightA) {14                if ((m + n) % 2 == 1) return Math.max(leftA, leftB);15                return ((double) Math.max(leftA, leftB) + Math.min(rightA, rightB)) / 2;16            }17            if (leftA > rightB) right = i - 1;18            else left = i + 1;19        }20        throw new IllegalArgumentException("输入数组必须有序");21    }22}