Skip to content

problem9.md

Latest commit

 

History

History
14 lines (11 loc) · 429 Bytes

problem9.md

File metadata and controls

14 lines (11 loc) · 429 Bytes

Problem 9: Integrated Median Analysis

Problem Statement

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

Input Format

  • Two sorted arrays nums1 and nums2.

Example

Input: nums1 = [1, 3], nums2 = [2]
Output: 2.0
Input: nums1 = [1, 2], nums2 = [3, 4]
Output: 2.5