LeetCode 4： Median of Two Sorted Arrays

最新推荐文章于 2024-07-30 13:11:27 发布

「已注销」

最新推荐文章于 2024-07-30 13:11:27 发布

阅读量3.2k

点赞数 1

分类专栏： LeetCode LeetCode算法分析文章标签： LeetCode Median of two Sor

本文链接：https://blog.csdn.net/sunao2002002/article/details/46318329

版权

LeetCode 同时被 2 个专栏收录

80 篇文章 0 订阅

订阅专栏

LeetCode算法分析

76 篇文章 22 订阅

订阅专栏

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);
        }
        
    }
};