摘要:
There are two sorted arrays A and B 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)).解题思路:该题可以解决所有求有序数组A和B有序合并之后第k小的数!该题的重要结论:如果A[k/2-1] n) return findKth(B, n, A, m, k); if (m == 0) return B[k... 阅读全文