forked from LeBW/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathIntersectionOfTwoArraysII.java
More file actions
33 lines (32 loc) · 936 Bytes
/
IntersectionOfTwoArraysII.java
File metadata and controls
33 lines (32 loc) · 936 Bytes
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
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
/**
* 350. Intersection of Two Arrays II
* @author LBW
*/
public class IntersectionOfTwoArraysII {
public int[] intersect(int[] nums1, int[] nums2) {
Map<Integer, Integer> map = new HashMap<>();
for (int value : nums1) {
if (!map.containsKey(value)) {
map.put(value, 0);
}
map.put(value, map.get(value) + 1);
}
int[] result = new int[nums1.length];
int count = 0;
for (int value : nums2) {
if (map.containsKey(value)) {
result[count++] = value;
if (map.get(value) > 1) {
map.put(value, map.get(value) - 1);
} else {
map.remove(value);
}
}
}
// list to array
return Arrays.copyOf(result, count);
}
}