> For the complete documentation index, see [llms.txt](https://wentao-shao.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://wentao-shao.gitbook.io/leetcode/array/350.intersection-of-two-arrays-ii.md).

# 350.Intersection-of-Two-Arrays-II

## 350. Intersection of Two Arrays II

## 题目地址

<https://leetcode.com/problems/intersection-of-two-arrays-ii/>

## 题目描述

```
Given two arrays, write a function to compute their intersection.

Example 1:
Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2,2]

Example 2:
Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [4,9]

Note:
Each element in the result should appear as many times as it shows in both arrays.
The result can be in any order.

Follow up:
What if the given array is already sorted? How would you optimize your algorithm?
What if nums1's size is small compared to nums2's size? Which algorithm is better?
What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?
```

## 代码

### Approach #1 HashMap

```java
class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
      if (nums1.length > nums2.length) {
        return intersect(nums2, nums1);
      }
      HashMap<Integer, Integer> map = new HashMap();
      for (int n : nums1) {
        map.put(n, map.getOrDefault(n, 0) + 1);
      }

      int k = 0;
      for (int n : nums2) {
        int cnt = map.getOrDefault(n, 0);
        if (cnt > 0) {
          nums1[k++] = n; // 覆盖到nums1之中
          map.put(n, cnt - 1);
        }
      }

      return Arrays.copyOfRange(nums1, 0, k);
    }
}
```

### Approach #2 Sort

```java
public int[] intersect(int[] nums1, int[] nums2) {
    Arrays.sort(nums1);
    Arrays.sort(nums2);
    int i = 0, j = 0, k = 0;
    while (i < nums1.length && j < nums2.length) {
        if (nums1[i] < nums2[j]) {
            ++i;
        } else if (nums1[i] > nums2[j]) {
            ++j;
        } else {
            nums1[k++] = nums1[i++];
            ++j;
        }
    }
    return Arrays.copyOfRange(nums1, 0, k);
}
```