寻找中位数

10 Oct 2018

Reading time ~1 minute

最近在刷leetCode，有一道寻找两个数组的中位数的题，自己没做出来，看了官方的解题思路，觉得很详细很严谨，记录分享一下，解决方案地址

也贴一下参考答案:

class Solution(object):
    def findMedianSortedArrays(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: float
        """
        m, n = len(nums1), len(nums2)
        if m > n:
            nums1, nums2, m, n = nums2, nums1, n, m

        if n == 0:
            raise ValueError

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

                if (m + n) % 2 == 1:
                    return max_of_left

                if i == m:
                    min_of_right = nums2[j]
                elif j == n:
                    min_of_right = nums1[i]
                else:
                    min_of_right = min(nums1[i], nums2[j])

                return (max_of_left + min_of_right) / 2.0

median