4_寻找两个有序数组的中位数

最新推荐文章于 2022-10-16 15:42:39 发布

clbobo

最新推荐文章于 2022-10-16 15:42:39 发布

阅读量70

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/weixin_41529389/article/details/102948441

版权

Leetcode 专栏收录该内容

87 篇文章 0 订阅

订阅专栏


def median(A, B):
    m, n = len(A), len(B)
    if m > n:
        A, B, m, n = B, A, n, m
    if n == 0:
        raise ValueError

    imin, imax, half_len = 0, m, (m+n+1)//2
    while imin <= imax:
        i = (imin+imax) // 2
        j = half_len-i
        if i < m and B[j-1] > A[i]:
            imin = i+1
        elif i >0 and A[i-1] > B[j]:
            imax = i-1
        else:
            if i == 0:
                max_of_left = B[j-1]
            elif j==0:
                max_of_left = A[i-1]
            else:
                max_of_left = max(A[i-1], B[j-1])

            if (m+n) % 2 == 1:
                return max_of_left
            if i==m:
                min_of_right = B[j]
            elif j==n:
                min_of_right = A[i]
            else:
                min_of_right = min(A[i], B[j])
            return (max_of_left+min_of_right) / 2.0