Leetcode 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)).

Difficulty: Hard

Solution: Divide and conquer

public class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int len1 = nums1.length;
        int len2 = nums2.length;
        if((len1 + len2)%2 == 1){
            return (double)(findK(0, nums1, 0, nums2, (len1 + len2)/2 + 1));
        }
        else{
            return (findK(0, nums1, 0, nums2, (len1 + len2)/2 + 1) + findK(0, nums1, 0, nums2, (len1 + len2)/2))/2.0;
        }
    }
    
    public int findK(int start1, int[] nums1, int start2, int[] nums2, int k){
        if(start1 >= nums1.length)
            return nums2[start2 + k - 1];
        if(start2 >= nums2.length)
            return nums1[start1 + k - 1];
        if(k == 1)
            return Math.min(nums1[start1], nums2[start2]);
        int A_key = start1 + k / 2 - 1 < nums1.length
		            ? nums1[start1 + k / 2 - 1]
		            : Integer.MAX_VALUE;
		int B_key = start2 + k / 2 - 1 < nums2.length
		            ? nums2[start2 + k / 2 - 1]
		            : Integer.MAX_VALUE;
		if(A_key > B_key){
		    return findK(start1, nums1, start2 + k/2, nums2, k - k/2);
		}
		else{
		    return findK(start1 + k/2, nums1, start2, nums2, k - k/2);
		}
    }
}