Leetcode 4. Median of Two Sorted Arrays
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
想法是把两个数组放在一起比他们的中位数,然后去掉中位数左边或者右边的部分从而寻找到两个数组一起的中位数index k和k-1位(偶数个元素) 或者 第k位(奇数个元素)
代码如下:
def findMedianSortedArrays(self, A, B):
l = len(A) + len(B)
if l & 1 == 1:
return self.kth(A, B, l // 2)
else:
return (self.kth(A, B, l // 2) + self.kth(A, B, l // 2 - 1)) / 2.
def kth(self, a, b, k):
if len(a) == 0:
return b[k]
if len(b) == 0:
return a[k]
ia, ib = len(a) // 2 , len(b) // 2
ma, mb = a[ia], b[ib]
if ia + ib < k:
if ma > mb:
return self.kth(a, b[ib + 1:], k - ib - 1)
else:
return self.kth(a[ia + 1:], b, k - ia - 1)
else:
if ma > mb:
return self.kth(a[:ia], b, k)
else:
return self.kth(a, b[:ib], k)
因为自己思路在边界处比较混乱,用循环代码也比较混乱,此处参考了Discuss中的递归方法解决。
时间复杂度为 O(max(log(m),log(n)))