-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathIntersectionOfTwoArrays.java
More file actions
59 lines (49 loc) · 1.25 KB
/
IntersectionOfTwoArrays.java
File metadata and controls
59 lines (49 loc) · 1.25 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
package Leetcode;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
/**
* @author kalpak
*
* 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.
*
*/
public class IntersectionOfTwoArrays {
public static int[] intersection(int[] nums1, int[] nums2) {
Set<Integer> set = new HashSet<>();
List<Integer> res = new ArrayList<>();
for(int i : nums1)
set.add(i);
for(int i : nums2) {
if(set.contains(i)) {
set.remove(i);
res.add(i);
}
}
int[] result = new int[res.size()];
for(int i = 0; i < result.length; i++)
result[i] = res.get(i);
return result;
}
public static void main(String[] args) {
int[] nums1 = new int[]{1, 2, 2, 1};
int[] nums2 = new int[]{2, 2};
int[] result = intersection(nums1, nums2);
for (int i : result)
System.out.println(i);
}
}