# [LeetCode]#349. Intersection of Two Arrays

**Environment: Python 3.8**

**Key technique: &, set , list**

Given two integer arrays `nums1`

and `nums2`

, return *an array of their intersection*. Each element in the result must be **unique** and you may return the result in **any order**.

**Example 1:**

**Input:** nums1 = [1,2,2,1], nums2 = [2,2]

**Output:** [2]

**Analysis:**

- Use & and set to get Intersection.
- Convert it to a list.

**Solution:**

`class Solution:`

def intersection(self, nums1, nums2):

return list(set(nums1) & set(nums2))

**Submissions:**