很简单的一个题,需要考虑奇偶数组就可以,就是需要把所有情况考虑到代码如下
class Solution:
def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
l1 = len(nums1)
l2 = len(nums2)
if l1 == 0:
if l2%2 == 0:
return float(nums2[int(l2/2)]+nums2[int(l2/2)-1])/2
else:
return float(nums2[int(l2/2)])
elif l2==0:
if l1%2 == 0:
return float(nums1[int(l1/2)]+nums1[int(l1/2)-1])/2
else:
return float(nums1[int(l1/2)])
mid = int((l1+l2)/2)
t = 0
i1 = 0
i2 = 0
Li= list()
while t <= mid:
if (i2 >= l2) or (i1 < l1 and nums1[i1]<nums2[i2]):
Li.append(nums1[i1])
i1+=1
elif i2 < l2:
Li.append(nums2[i2])
i2+=1
t+=1
if (l1+l2)%2==0:
return float(Li[mid]+Li[mid-1])/2
else:
return Li[int(mid)]