(http://leetcode.com/2011/01/find-k-th-smallest-element-in-union-of.html) Given two sorted arrays A, B of size m and n respectively. Find the k-th smallest element in the union of A and B. You can assume that there are no duplicate elements. O(lg m + lg n) solution: 1. M...
Median of Two Sorted Arrays 我的解法 leetcode/Median of Two Sorted Arrays.cpp at master · gzc...
Given two sorted arrays A, B of size m and n respectively. Find the k-th smallest element in the union of A and B. You can assume that there are no duplicate elements. http://leetcode.com/2011/01/find-k-th-smallest-element-in-union-of.html A special case: Median of two sorted ...