median-of-two-sorted-arrays

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given two sorted arrays <code>nums1</code> and <code>nums2</code> of size <code>m</code> and <code>n</code> respectively, return the median of the two sorted arrays.

The overall run time complexity should be <code>O(log (m+n))</code>.

&nbsp;
Example 1:

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

Example 2:

<pre>
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.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>nums1.length == m</code></li>
	<li><code>nums2.length == n</code></li>
	<li><code>0 &lt;= m &lt;= 1000</code></li>
	<li><code>0 &lt;= n &lt;= 1000</code></li>
	<li><code>1 &lt;= m + n &lt;= 2000</code></li>
	<li><code>-106 &lt;= nums1[i], nums2[i] &lt;= 106</code></li>
</ul>

findMedianSortedArrays

Median of Two Sorted Arrays

Median of a Row Wise Sorted Matrix

median-of-a-row-wise-sorted-matrix

行排序矩阵的中位数

Array

Binary Search

Divide and Conquer

给定两个大小分别为 <code>m</code> 和 <code>n</code> 的正序（从小到大）数组&nbsp;<code>nums1</code> 和&nbsp;<code>nums2</code>。请你找出并返回这两个正序数组的 中位数 。

算法的时间复杂度应该为 <code>O(log (m+n))</code> 。

&nbsp;

示例 1：

<pre>
输入：nums1 = [1,3], nums2 = [2]
输出：2.00000
解释：合并数组 = [1,2,3] ，中位数 2
</pre>

示例 2：

<pre>
输入：nums1 = [1,2], nums2 = [3,4]
输出：2.50000
解释：合并数组 = [1,2,3,4] ，中位数 (2 + 3) / 2 = 2.5
</pre>

&nbsp;

&nbsp;

提示：

<ul>
	<li><code>nums1.length == m</code></li>
	<li><code>nums2.length == n</code></li>
	<li><code>0 &lt;= m &lt;= 1000</code></li>
	<li><code>0 &lt;= n &lt;= 1000</code></li>
	<li><code>1 &lt;= m + n &lt;= 2000</code></li>
	<li><code>-106 &lt;= nums1[i], nums2[i] &lt;= 106</code></li>
</ul>