minimum-common-value

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 integer arrays <code>nums1</code> and <code>nums2</code>, sorted in non-decreasing order, return the minimum integer common to both arrays. If there is no common integer amongst <code>nums1</code> and <code>nums2</code>, return <code>-1</code>.

Note that an integer is said to be common to <code>nums1</code> and <code>nums2</code> if both arrays have at least one occurrence of that integer.

&nbsp;
Example 1:

<pre>
Input: nums1 = [1,2,3], nums2 = [2,4]
Output: 2
Explanation: The smallest element common to both arrays is 2, so we return 2.
</pre>

Example 2:

<pre>
Input: nums1 = [1,2,3,6], nums2 = [2,3,4,5]
Output: 2
Explanation: There are two common elements in the array 2 and 3 out of which 2 is the smallest, so 2 is returned.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums1[i], nums2[j] &lt;= 109</code></li>
	<li>Both <code>nums1</code> and <code>nums2</code> are sorted in non-decreasing order.</li>
</ul>

getCommon

Minimum Common Value

Intersection of Two Arrays

intersection-of-two-arrays

两个数组的交集

Intersection of Two Arrays II

intersection-of-two-arrays-ii

两个数组的交集 II

Array

Hash Table

Two Pointers

Binary Search

给你两个整数数组&nbsp;<code>nums1</code> 和&nbsp;<code>nums2</code>&nbsp;，它们已经按非降序排序，请你返回两个数组的 最小公共整数&nbsp;。如果两个数组&nbsp;<code>nums1</code> 和&nbsp;<code>nums2</code>&nbsp;没有公共整数，请你返回&nbsp;<code>-1</code>&nbsp;。

如果一个整数在两个数组中都 至少出现一次&nbsp;，那么这个整数是数组&nbsp;<code>nums1</code> 和&nbsp;<code>nums2</code>&nbsp;公共&nbsp;的。

&nbsp;

示例 1：

<pre>输入：nums1 = [1,2,3], nums2 = [2,4]
输出：2
解释：两个数组的最小公共元素是 2 ，所以我们返回 2 。
</pre>

示例 2：

<pre>输入：nums1 = [1,2,3,6], nums2 = [2,3,4,5]
输出：2
解释：两个数组中的公共元素是 2 和 3 ，2 是较小值，所以返回 2 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums1[i], nums2[j] &lt;= 109</code></li>
	<li><code>nums1</code> 和&nbsp;<code>nums2</code>&nbsp;都是 非降序&nbsp;的。</li>
</ul>