leetcode 349[easy]---Intersection of Two Arrays

難度：easy 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 c

>>阅读原文<<