##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
LeetCode 349
Given two arrays and , return an array of their intersection. Each element in the result must be unique and you can return the result in any order.
For example, if and , the answer is .
This is a direct application of set intersection. Before reading the solution, think about how you would find common elements between two collections.