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

Show Tags

Have you met this question in a real interview?

思路：第一步，查找两个有序数组的第K个数，用K的二分查找；第二步，将K替换成中位数的下标（）分两种情况即可

int findKth(int a[],int m,int b[],int n,int k){
    if(m<0||n<0||k>(m+n)||k<0) return -1;
    if(m>n) return findKth(b,n,a,m,k);
    if(m==0) return b[k-1];
    if(k==1) return min(a[0],b[0]);
    
    int pa=min(k/2,m),pb=k-pa;
    if(a[pa-1]<b[pb-1])
        return findKth(a+pa,m-pa,b,n,k-pa);
    else if(a[pa-1]>b[pb-1])
        return findKth(a,m,b+pb,n-pb,k-pb);
    else
        return a[pa-1];
}
class Solution {
public:
    double findMedianSortedArrays(int A[], int m, int B[], int n) {
        int all=m+n;
        if(all%2==0)
            return (findKth(A,m,B,n,all/2)+findKth(A,m,B,n,all/2+1))/2.0;
        else
            return findKth(A,m,B,n,all/2+1);
    }
};