4. Median of Two Sorted Arrays

参照http://blog.csdn.net/zxzxy1988/article/details/8587244

double findKth(int a[], int m, int b[], int n, int k){
    if (m > n)
        return findKth(b, n, a, m, k);
    else if (m == 0)
        return b[k-1];
    else if (k == 1)
        return a[0] < b[0] ? a[0] : b[0];
    int pa = k/2 < m ? k/2 : m;
    int pb = k - pa;
    if (a[pa-1] > b[pb-1])
        return findKth(a, m, b+pb, n-pb, k-pb);
    else if (a[pa-1] < b[pb-1])
        return findKth(a+pa, m-pa, b, n, k-pa);
    else
        return a[pa-1];
}
double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size) {
    int total = nums1Size + nums2Size;
        if (total & 0x1)
            return findKth(nums1, nums1Size, nums2, nums2Size, total/2 + 1);
        else
            return (findKth(nums1, nums1Size, nums2, nums2Size, total/2) + findKth(nums1, nums1Size, nums2, nums2Size, total/2 + 1)) / 2;
}