求讲解 Median of Two Sorted Arrays 转换为 TopK 问题?

[phx13ye]

比较两个数组的中位数之后, 排除那部分蒙圈了

[deepreader]

https://github.com/idf/LeetCode/blob/master/002%20Median%20of%20Two%20Sorted%20Arrays.py

看注释。

[phx13ye]

@deepreader
if A[m/2]>B[n/2] and k>m/2+n/2, then disregard B_left and B[n/2]
if A[m/2]>B[n/2] and k<=m/2+n/2, then disregard A_right and A[m/2]
if A[m/2]<=B[n/2] and k>m/2+n/2, then disregard A_left and A[m/2]
if A[m/2]<=B[n/2] and k<=m/2+n/2, then disregard B_right and B[n/2]
这里怎么理解

[deepreader]

@phx13ye 两个数组被分成四段，case 1的话，你要找的target则不可能在四段中值最小的那一段，其他的类推。