Median of Two Sorted Arrays

解法参考： http://blog.csdn.net/ojshilu/article/details/15027309

代码如下：

class Solution {
public:
    double findMedianSortedArrays(int A[], int m, int B[], int n) {
        int total = m+n;
        if(total%2)
            return find_kth(A, m, B, n, total/2+1);
        else
            return (double)(find_kth(A, m, B, n, total/2) + find_kth(A, m, B, n, total/2+1))/2.0;
    }
    
    //k is from 1 rather than 0
    int find_kth(int A[], int m, int B[], int n, int k)
    {
        if(m > n)
            return find_kth(B, n, A, m, k);
        
        if(m == 0) return B[k-1];
        if(k == 1) return min(A[0], B[0]);
        
        int ia = min(k/2, m); int ib = k - ia;
        
        if(A[ia-1] < B[ib-1])
            return find_kth(A+ia, m-ia, B, n, k-ia);
        else if(A[ia-1] > B[ib-1])
            return find_kth(A, m, B+ib, n-ib, k-ib);
        else
            return A[ia-1];
    }
};