Intersection of Two Arrays (E)
題目
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.
題意
求兩個陣列的交集(元素不重復)，
思路
Set處理，
代碼實作
Java
class Solution {
public int[] intersection(int[] nums1, int[] nums2) {
Set<Integer> list = new HashSet<>();
Set<Integer> set = new HashSet<>();
for (int num : nums1) {
set.add(num);
}
for (int num : nums2) {
if (set.contains(num)) {
list.add(num);
}
}
int[] res = new int[list.size()];
int i = 0;
for (int num : list) {
res[i++] = num;
}
return res;
}
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/36588.html
標籤：其他
上一篇：0044. Wildcard Matching (H)
下一篇：平方根倒數快速演算法