题目描述
代码语言：javascript复制There are two sorted arrays nums1 and nums2 of size m and n respectively.
Find the median of the two sorted arrays. The overall run time complexity should be O(log (m n)).
You may assume nums1 and nums2 cannot be both empty.
Example 1:
nums1 = [1, 3]
nums2 = [2]
The median is 2.0
Example 2:
nums1 = [1, 2]
nums2 = [3, 4]
The median is (2 3)/2 = 2.5题目解析
代码语言：javascript复制class Solution:
def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
Key = sorted(nums1 nums2)
length = len(Key)
if length % 2 == 0:
return (Key[length // 2] Key[length // 2 - 1]) / 2
else:
return float(Key[length // 2])
