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
解决
中文题目是求两个有序的队列中位数。
最直接的想法是归并两个数列，然后取中位数。但是这样的算法时间复杂度是O(n+m),不符合题意。但从O(log(m+n))可以看出，应该是要使用对分(二分)算法来解决。