class Solution:
def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
nums = nums1 + nums2
nums.sort()
length = len(nums)
if length % 2 == 0:
return (nums[length//2-1]+nums[length//2])/2
else:
return nums[(length+1)//2-1]
Leetcode 4. Median of Two Sorted Arrays (寻找两个有序数组的中位数) Python
最新推荐文章于 2021-08-25 10:38:52 发布