原文链接

class Solution:
    def findMedianSortedArrays(self, nums1, nums2) -> float:
        nums1.extend(nums2)
        nums1.sort()
        list_len = len(nums1)
        center = list_len // 2
        if list_len % 2 == 0:
            return float((nums1[center] + nums1[center - 1]) / 2)
        return float(nums1[center])

S1=Solution()
a=S1.findMedianSortedArrays([1],[4.7])
print(a)

用时最短的范例

class Solution:

    def findMedianSortedArrays(self, nums1: 'List[int]', nums2: 'List[int]') -> float:
        nums = nums1 + nums2
        nums.sort()
        l = len(nums)
        mid = l//2
        if l%2:
            output = nums[mid]
        else:
            output = (nums[mid-1] + nums[mid])/2
        return output