放一个简单易理解想法:
代码
class Solution:
def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
len1 = len(nums1)
len2 = len(nums2)
size = len1 + len2
if size % 2 == 1:
return self.findKth(nums1, 0, len1, nums2, 0, len2, int(size / 2) + 1)
else:
return (self.findKth(nums1, 0, len1, nums2, 0, len2, int(size / 2)) +
self.findKth(nums1, 0, len1, nums2, 0, len2, int(size / 2) + 1)) / 2
def findKth(self, nums1, start1, len1, nums2, start2, len2, k):
if len1-start1 > len2 - start2:
return self.findKth(nums2, start2, len2, nums1, start1, len1, k)
if len1 - start1 == 0:
return nums2[k - 1]
if k == 1:
return min(nums1[start1], nums2[start2])
p1 = start1 + int(min(len1 - start1, k / 2))
p2 = start2 + k - p1 + start1
if nums1[p1 - 1] < nums2[p2 - 1]:
return self.findKth(nums1, p1, len1, nums2, start2, len2, k - p1 + start1)
elif nums2[p2 - 1] < nums1[p1 - 1]:
return self.findKth(nums1, start1, len1, nums2, p2, len2, k - p2 + start2)
else:
return nums1[p1 - 1]
具体理解