LeetCode 4： Median of Two Sorted Arrays

标签：leetcode   median of two sor   

There are two sorted arrays nums1 and nums2 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))

代码如下：

class Solution {

 int getMedian(int A[], int m, int B[], int n,int k)
    {
        if(m>n)
            return getMedian(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);
        int pb = k - pa;
        if (A[pa-1] < B[pb-1]) {
            return getMedian(A+pa, m-pa, B, n, k-pa);
        } else if(A[pa-1] > B[pb-1]) {
            return getMedian(A, m, B+pb, n-pb, k-pb);
        }else{
            return A[pa-1];
        }
        
        return 0;
    
    
    }
   public: double findMedianSortedArrays(int A[], int m, int B[], int n) {
        if ((m+n)%2 == 0) {
            return (getMedian(A, m,B, n, (m+n)/2) + getMedian(A, m,B, n, (m+n)/2+1)) /2.0;
        } else {
            return getMedian(A, m,B, n, (m+n)/2+1);
        }
        
    }
};

LeetCode 4： Median of Two Sorted Arrays

标签：leetcode   median of two sor   

原文地址：http://blog.csdn.net/sunao2002002/article/details/46318329