class Solution:
def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
nums3 = sorted(nums1+nums2)
if len(nums3) == 0:
return 0.0
elif len(nums3) % 2 == 0:
left_num = nums3[int(len(nums3) / 2 -1)]
right_num = nums3[int(len(nums3) / 2)]
return (left_num+right_num)/2
else:
return nums3[int((len(nums3)-1) / 2)]
Leetcode | 4. 寻找两个正序数组的中位数
最新推荐文章于 2024-09-12 11:03:37 发布