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

//二分法  定义findkth函数
class Solution {
public:
    double findMedianSortedArrays(int A[], int m, int B[], int n) 
    {
        int flag = m+n;
        if (flag%2 != 0)
            return findkth(A, m, B, n, (flag+1)/2);
        else
            return (findkth(A, m, B, n, flag/2) + findkth(A, m, B, n, flag/2 + 1))/2;
            
    }
    double findkth(int A[], int m, int B[], int n, int k)
    {
        if (m<n)
            return findkth(B,n,A,m,k);
        if (n==0)
            return A[k-1];
        if (1 == k)
            return min(A[0], B[0]);
        int bindex = min(k/2, n), aindex = k-bindex;
        if (A[aindex-1] > B[bindex-1])
            return findkth(A,m,B+bindex, n-bindex, k-bindex);
        else
            return findkth(A+aindex,m-aindex,B, n, k-aindex);
    }
};

测试

#include<iostream>
using namespace std;
class Solution {
public:
    double findMedianSortedArrays(int A[], int m, int B[], int n) 
    {
        int flag = m+n;
        if (flag%2 != 0)
            return findkth(A, m, B, n, (flag+1)/2);
        else
            return (findkth(A, m, B, n, flag/2) + findkth(A, m, B, n, flag/2 + 1))/2;
            
    }
    double findkth(int A[], int m, int B[], int n, int k)
    {
        if (m<n)
            return findkth(B,n,A,m,k);
        if (n==0)
            return A[k-1];
        if (1 == k)
            return min(A[0], B[0]);
        int bindex = min(k/2, n), aindex = k-bindex;
        if (A[aindex-1] > B[bindex-1])
            return findkth(A,m,B+bindex, n-bindex, k-bindex);
        else
            return findkth(A+aindex,m-aindex,B, n, k-aindex);
    }
};

int main()
{
    Solution s;
    int A[] = {1,2,4,6,7,9};
    int B[] = {5,8,10,11};
    int res = s.findMedianSortedArrays(A, 5, B, 4);
    cout<<res<<endl;
}