Median of Two Sorted Arrays

Hard

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

Solution

/**
 * @param {number[]} nums1
 * @param {number[]} nums2
 * @return {number}
 */
var findMedianSortedArrays = function(nums1, nums2) {
  let nums = nums1.concat(nums2).sort((a, b) => a - b)
  let res
  if (nums.length % 2 == 0) {
    res = (nums[parseInt((nums.length - 1) / 2)] + nums[parseInt((nums.length - 1) / 2 + 1)]) / 2
  } else {
    res = nums[parseInt(nums.length / 2)]
  }
  return res
};