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

public class Solution {
    public double findMedianSortedArrays(int A[], int B[]) {
        int len1 = A.length;
        int len2 = B.length;
        int total = len1+len2;
        if(total%2==0){
            return (helper(A,0,len1,B,0,len2,total/2)+helper(A,0,len1,B,0,len2,total/2+1))/2;
        }
        else{
            return helper(A,0,len1,B,0,len2,total/2+1);
        }
    }
    
    public double helper(int A[],int indexA,int m,int B[],int indexB,int n,int k){
        if(m>n) return helper(B,indexB,n,A,indexA,m,k);
        if(m==0) return B[indexB+k-1]/1.0;
        if(k==1) return Math.min(A[indexA],B[indexB])/1.0;
        int pa = Math.min(m,k/2);
        int pb = k-pa;
        if(A[indexA+pa-1]<B[indexB+pb-1]){
            indexA += pa;
            return helper(A,indexA,m-pa,B,indexB,n,k-pa);
        }
        else if(A[indexA+pa-1]>B[indexB+pb-1]){
            indexB += pb;
            return helper(A,indexA,m,B,indexB,n-pb,k-pb);
        }
        else{
            return A[indexA+pa-1];
        }
    }
}