Python第九周LeetCode

4. Median of Two Sorted Arrays

给出两个已经排好序的整数列表，求中位数。

这一题考验的是如何降低时间复杂度，虽然说我用最简单的方法也可以做出来：

class Solution(object):
    def findMedianSortedArrays(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: float
        """
        m = len(nums1)
        n = len(nums2)
        flag = (m+n)%2
        median = (m+n+flag)/2-1
        nums3 = nums1 + nums2
        nums3.sort()
        if flag:
            return nums3[median]
        else:
            return (nums3[median] + nums3[median+1])/2.0

但是题目说最小的时间复杂度是 O(log (m+n))，而我这里是O((m+n)^2)，下面的是Solution中的代码：

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]:
            # i is too small, must increase it
            imin = i + 1
        elif i > 0 and A[i-1] > B[j]:
            # i is too big, must decrease it
            imax = i - 1
        else:
            # i is perfect

            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