intersection-of-two-arrays-ii

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 appear as many times as it shows in both arrays and you may return the result in any order.

&nbsp;
Example 1:

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

Example 2:

<pre>
Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [4,9]
Explanation: [9,4] 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>

&nbsp;
Follow up:

<ul>
	<li>What if the given array is already sorted? How would you optimize your algorithm?</li>
	<li>What if <code>nums1</code>&#39;s size is small compared to <code>nums2</code>&#39;s size? Which algorithm is better?</li>
	<li>What if elements of <code>nums2</code> are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?</li>
</ul>

intersect

Intersection of Two Arrays II

Intersection of Two Arrays

intersection-of-two-arrays

两个数组的交集

Find Common Characters

find-common-characters

查找共用字符

Find the Difference of Two Arrays

find-the-difference-of-two-arrays

找出两数组的不同

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

最小公共值

Array

Hash Table

Two Pointers

Binary Search

Sorting

给你两个整数数组&nbsp;<code>nums1</code> 和 <code>nums2</code> ，请你以数组形式返回两数组的交集。返回结果中每个元素出现的次数，应与元素在两个数组中都出现的次数一致（如果出现次数不一致，则考虑取较小值）。可以不考虑输出结果的顺序。

&nbsp;

示例 1：

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

示例 2:

<pre>
输入：nums1 = [4,9,5], nums2 = [9,4,9,8,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>

&nbsp;

进阶：

<ul>
	<li>如果给定的数组已经排好序呢？你将如何优化你的算法？</li>
	<li>如果&nbsp;<code>nums1</code>&nbsp;的大小比&nbsp;<code>nums2</code> 小，哪种方法更优？</li>
	<li>如果&nbsp;<code>nums2</code>&nbsp;的元素存储在磁盘上，内存是有限的，并且你不能一次加载所有的元素到内存中，你该怎么办？</li>
</ul>

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier! Saves Data!