We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent be92708 commit 3f08fc6Copy full SHA for 3f08fc6
Python/median-of-two-sorted-arrays.py
@@ -22,7 +22,7 @@ def getKth(A, B, k):
22
if m > n:
23
m, n = n, m
24
A, B = B, A
25
- i = binary_search(0, min(m, k)-1, lambda i: 0 <= k-1-i < n and A[i] >= B[k-1-i])
+ i = binary_search(max(k-n, 0), min(m, k)-1, lambda i: A[i] >= B[k-1-i])
26
return max(A[i-1] if i-1 >= 0 else float("-inf"), B[k-1-i] if k-1-i >= 0 else float("-inf"))
27
28
len1, len2 = len(nums1), len(nums2)
0 commit comments