# 349. Intersection of Two Arrays

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

**Example 1:**

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

**Example 2:**

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

**Note:**

* Each element in the result must be unique.
* The result can be in any order.

**Solution**

```
class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        int m = nums1.length;
        int n = nums2.length;
        Set<Integer> set = new HashSet<>();
        Set<Integer> list = new HashSet<>();
        
        for(int num : nums1){
                set.add(num);
        }
        
        for(int num : nums2){
            if(set.contains(num)){
               list.add(num);
            }
        }
        
        return list.stream().mapToInt(i->i).toArray();
    }
}
```
