problem349

README

< Previous 　　　　　　　　　　　　　　　　 Next >

349. Intersection of Two Arrays (Easy)

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.

 

Related Topics

[Sort] [Hash Table] [Two Pointers] [Binary Search]

Similar Questions

1. Intersection of Two Arrays II (Easy)
2. Intersection of Three Sorted Arrays (Easy)