4. Median of Two Sorted Arrays

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)).

by Abhishek Kumar

JavaScript

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

console.log(findMedianSortedArrays([1, 3], [2]))
console.log(findMedianSortedArrays([1, 2], [3, 4]))
console.log(findMedianSortedArrays([3], [-2, -1]))