2个有序数组里找第k个最小的数/中位数

每次排除掉k/2的数，注意考虑当剩余数组的长度小于k/2时候的边界情况。

class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int mid1 = divide(nums1, 0, nums2, 0, (nums1.length + nums2.length + 1) / 2);
        int mid2 = divide(nums1, 0, nums2, 0, (nums1.length + nums2.length + 2) / 2);
        return (mid1 + mid2) / 2.0;
    }
    private int divide(int[] nums1, int l1, int[] nums2, int l2, int k) {
        int len1 = nums1.length - l1;
        int len2 = nums2.length - l2;
        // keep length of rest of nums1 shorter than length of rest of nums2
        if (len1 > len2) return divide(nums2, l2, nums1, l1, k);
        // if length of  rest of nums1 is zero, return median of rest of nums2
        if (len1 == 0) return nums2[l2 + k - 1];
        // if k is 1, return the smallest one
        if (k == 1) return Math.min(nums1[l1], nums2[l2]);
        // remove smaller part of [l+k/2], remember to check the remaining len larger or smaller than k/2
        int i = l1 + Math.min(len1, k/2) - 1;
        int j = l2 + Math.min(len2, k/2) - 1;
        if (nums1[i] < nums2[j]) {
            return divide(nums1, i + 1, nums2, l2, k - (i + 1 - l1));
        } else {
            return divide(nums1, l1, nums2, j + 1, k - (j + 1 - l2));
        }
    }
}