LeetCode-in-TypeScript.github.io

4. Median of Two Sorted Arrays

Hard

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
• 1 <= m + n <= 2000
• -106 <= nums1[i], nums2[i] <= 106

Solution

function findMedianSortedArrays(nums1: number[], nums2: number[]): number {
    const nums = nums1.concat(nums2)
    nums.sort((a, b) => a - b)
    const len = nums.length
    if (len % 2 === 0) {
        return (nums[len / 2 - 1] + nums[len / 2]) / 2
    } else {
        return nums[Math.floor(len / 2)]
    }
}

export { findMedianSortedArrays }

This site is open source. Improve this page.