leetcode题目训练4

class Solution:
    def findMedianSortedArrays(self, nums1, nums2):
        size1 = len(nums1)
        size2 = len(nums2)
        if size1 > size2:
            return Solution.findMedianSortedArrays(self, nums2, nums1)
        l = 0
        r = 2 * size1
        while l <= r:
            c1 = int((l + r) // 2)
            c2 = size1 + size2 - c1
            if c1 == 0:
                l1 = -1000000
            else:
                l1 = nums1[int((c1-1)//2)]
            if c1 == 2 * size1:
                r1 = 1000000
            else:
                r1 = nums1[int(c1//2)]
            if c2 == 0:
                l2 = -1000000
            else:
                l2 = nums2[int((c2-1)//2)]
            if c2 == 2 * size2:
                r2 = 1000000
            else:
                r2 = nums2[int(c2//2)]
            if(l1 > r2):
                r = c1 - 1
            elif(l2 > r1):
                l = c1 + 1
            else:
                break
        return (max(l1, l2) + min(r1, r2)) / 2.0