Leetcode-Median of Two Sorted Arrays

There are two sorted arrays A and B 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)).

Solution:

public class Solution {
    public double findMedianSortedArrays(int A[], int B[]) {
        if (A.length<B.length) findMedianSortedArrays(B,A);

        int lenA = A.length;
        int lenB = B.length;
        int min=0,max=lenA;
        int i=-1,j=-1;
        while (min<=max){
            i = (max+min)/2;
            j = (lenA+lenB)/2-i;
            if (j<0)
                max = i-1;
            else if (j>lenB)
                min = i+1;
            else if (i<lenA && j>0 && A[i]<B[j-1]) 
                min = i+1;
            else if (i>0 && j<lenB && A[i-1]>B[j])
                max = i-1;
            else break;
        }

        int num1 = Integer.MAX_VALUE;
        if (i>=0 && i<lenA) num1 = Math.min(num1,A[i]);
        if (j>=0 && j<lenB) num1 = Math.min(num1,B[j]);

        if ((lenA+lenB)%2==1) return num1;

        int num2 = Integer.MIN_VALUE;
        if (i-1>=0 && i-1<lenA) num2 = Math.max(num2,A[i-1]);
        if (j-1>=0 && j-1<lenB) num2 = Math.max(num2,B[j-1]);
  
        double res = (double)(num1+num2)/2;

        return res;        
    
        
    }
}