Median of Two Sorted Arrays

Hard~45 min

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(min(m, n))).

Examples

Example 1
Input: nums1 = [1, 3], nums2 = [2]
Output: 2.0
Explanation: Merged array = [1, 2, 3]. The median is 2.0.
Example 2
Input: nums1 = [1, 2], nums2 = [3, 4]
Output: 2.5
Explanation: Merged array = [1, 2, 3, 4]. The median is (2 + 3) / 2 = 2.5.

Constraints

  • nums1.length == m
  • nums2.length == n
  • 0 <= m <= 1000
  • 0 <= n <= 1000
  • 1 <= m + n <= 2000
  • -10^6 <= nums1[i], nums2[i] <= 10^6
  • Expected time complexity: O(log(min(m, n)))
Code
Ctrl+EnterRun|Ctrl+⇧+EnterSubmit
Output

Run your code to see results

Use Cmd+Enter to run