intersection-of-two-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 integer arrays <code>nums1</code> and <code>nums2</code>, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.

&nbsp;
Example 1:

<pre>
Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2]
</pre>

Example 2:

<pre>
Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]
Explanation: [4,9] is also accepted.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 1000</code></li>
	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 1000</code></li>
</ul>

intersection

Intersection of Two Arrays

Intersection of Two Arrays II

intersection-of-two-arrays-ii

两个数组的交集 II

Intersection of Three Sorted Arrays

intersection-of-three-sorted-arrays

三个有序数组的交集

Find the Difference of Two Arrays

find-the-difference-of-two-arrays

找出两数组的不同

Count Common Words With One Occurrence

count-common-words-with-one-occurrence

统计出现过一次的公共字符串

Choose Numbers From Two Arrays in Range

choose-numbers-from-two-arrays-in-range

在两个数组的区间中选取数字

Intersection of Multiple Arrays

intersection-of-multiple-arrays

多个数组求交集

Minimum Common Value

minimum-common-value

最小公共值

Maximum Size of a Set After Removals

maximum-size-of-a-set-after-removals

移除后集合的最多元素数

Array

Hash Table

Two Pointers

Binary Search

Sorting

给定两个数组&nbsp;<code>nums1</code>&nbsp;和&nbsp;<code>nums2</code> ，返回 它们的 交集&nbsp;。输出结果中的每个元素一定是 唯一 的。我们可以 不考虑输出结果的顺序 。

&nbsp;

示例 1：

<pre>
输入：nums1 = [1,2,2,1], nums2 = [2,2]
输出：[2]
</pre>

示例 2：

<pre>
输入：nums1 = [4,9,5], nums2 = [9,4,9,8,4]
输出：[9,4]
解释：[4,9] 也是可通过的
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 1000</code></li>
	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 1000</code></li>
</ul>