# 清风的技术小屋

0%

## 问题描述

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

Example:

Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].

Note:

• Each element in the result must be unique.

• The result can be in any order.

Related Topics: Hash Table, Two Pointers, Binary Search, Sort