4. Median of Two Sorted Arrays

Problem

leetcode 바로가기

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

Example 1:

Input: nums1 = [1,3], nums2 = [2]
Output: 2.00000
Explanation: merged array = [1,2,3] and median is 2.

Example 2:

Input: nums1 = [1,2], nums2 = [3,4]
Output: 2.50000
Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.

Constraints:

• nums1.length == m
• nums2.length == n
• 0 <= m <= 1000
• 0 <= n <= 1000
• 0 <= m + n <= 2000
• -10$^6$ <= nums1[i], nums2[i] <= 10$^6$

Solution

/**
 * @param {number[]} nums1
 * @param {number[]} nums2
 * @return {number}
 */
 var findMedianSortedArrays = function(nums1, nums2) {
    let arr = nums1.concat(nums2);
    let harf = Math.ceil(arr.length / 2);

    arr.sort((a, b) => a - b)

    if (arr.length % 2 === 0) {
      return (arr[harf - 1] + arr[harf]) / 2;
    } else {
      return arr[harf - 1]
    }
};