题目描述请点击查看LeetCode 题目描述
Python3 代码解答如下:
class Solution:
def findMedianSortedArrays(self, nums1, nums2):
"""
:type nums1: List[int]
:type nums2: List[int]
:rtype: float
"""
a = nums1 + nums2
a.sort()
if len(a) % 2 == 0:
i = int(len(a)/2)
#print(i)
return float((a[i] + a[i-1])/2)
else:
i = int(len(a)/2)+1
#print(i)
return float(a[i-1])