Median of Two Sorted Arrays
HardAcceptance Rate 36.5%
Given two sorted arrays
nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
The overall run time complexity should be O(log (m+n)).Examples
Example 1
Input
nums1 = [1,3], nums2 = [2]
Output
2.00000
Constraints
nums1.length == mnums2.length == n0 <= m <= 10000 <= n <= 10001 <= m + n <= 2000