【算法】【Divide and conquer】Median of Two Sorted Arrays

Difficulty:Hard

Description

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

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

思路

该题目的解决思路和代码都有给出：
https://leetcode.com/problems/median-of-two-sorted-arrays/solution/

这里主要说说做题时我遇到的问题和难点。

我利用二分法，先设好imin和imax的值，令 i=imin+imax