Package g0301_0400.s0350_intersection_of_two_arrays_ii

Class Solution

java.lang.Object

g0301_0400.s0350_intersection_of_two_arrays_ii.Solution

public class Solution
extends Object

350 - Intersection of Two Arrays II.<p>Easy</p> <p>Given two integer arrays <code>nums1</code> and <code>nums2</code>, return <em>an array of their intersection</em>. Each element in the result must appear as many times as it shows in both arrays and you may return the result in <strong>any order</strong>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums1 = [1,2,2,1], nums2 = [2,2]</p> <p><strong>Output:</strong> [2,2]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums1 = [4,9,5], nums2 = [9,4,9,8,4]</p> <p><strong>Output:</strong> [4,9]</p> <p><strong>Explanation:</strong> [9,4] is also accepted.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums1.length, nums2.length <= 1000</code></li> <li><code>0 <= nums1[i], nums2[i] <= 1000</code></li> </ul> <p><strong>Follow up:</strong></p> <ul> <li>What if the given array is already sorted? How would you optimize your algorithm?</li> <li>What if <code>nums1</code>&rsquo;s size is small compared to <code>nums2</code>&rsquo;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>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	intersect(int[] nums1, int[] nums2)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

intersect

public int[] intersect(int[] nums1,
 int[] nums2)