package array;
import java.util.*;
/*
给定两个数组,编写一个函数来计算它们的交集。
示例 1:
输入:nums1 = [1,2,2,1], nums2 = [2,2]
输出:[2,2]
示例 2:
输入:nums1 = [4,9,5], nums2 = [9,4,9,8,4]
输出:[4,9]
说明:
输出结果中每个元素出现的次数,应与元素在两个数组中出现次数的最小值一致。
我们可以不考虑输出结果的顺序。
作者:力扣 (LeetCode)
链接:https://leetcode-cn.com/leetbook/read/top-interview-questions-easy/x2y0c2/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
* */
public class ArrayIntersection {
public static void main(String[] args) {
int[] num1 = {4, 9, 5};
int[] num2 = {9, 4, 9, 8, 4};
int[] result = arrayIntersections(num1, num2);
for (int index=0; index< result.length; index++) {
System.out.println("element "+result[index]);
}
}
//[1, 2, 2, 1]
//[2, 2]
//[2, 2]
//[2, 2]
//[1, 1, 2, 2]
//交集数组的长度不大于最短数组的长度
public static int[] arrayIntersections(int[] num1, int[] num2) {
Arrays.sort(num1);
Arrays.sort(num2);
HashMap<Integer, Integer> mapOne = new HashMap<>();
HashMap<Integer, Integer> mapTwo = new HashMap<>();
insertMap(num1, mapOne);
insertMap(num2, mapTwo);
HashMap<Integer, Integer> mapThree = new HashMap<>();
if (mapOne.keySet().size() <= mapTwo.keySet().size()) {
insertNewMap(mapOne, mapTwo, mapThree);
} else {
insertNewMap(mapTwo, mapOne, mapThree);
}
List<Integer> list = new ArrayList<>();
Set<Map.Entry<Integer, Integer>> set =mapThree.entrySet();
Iterator<Map.Entry<Integer, Integer>> iterator = set.iterator();
while (iterator.hasNext()){
Map.Entry<Integer, Integer> entry = iterator.next();
Integer key = entry.getKey();
Integer count = entry.getValue();
while (count>0){
list.add(key);
count--;
}
}
int[] integers = new int[list.size()];
for (int i=0; i< list.size(); i++){
integers[i] = list.get(i);
}
return integers;
}
private static void insertMap(int[] array, Map<Integer, Integer> map) {
for (int num : array) {
if (map.containsKey(num)) {
map.put(num, map.get(num) + 1);
continue;
}
map.put(num, 1);
}
}
private static void insertNewMap(Map<Integer, Integer> mapOut, Map<Integer, Integer> mapInner, Map<Integer, Integer> result){
for (Integer num : mapOut.keySet()) {
if (mapInner.containsKey(num)) {
result.put(num, Math.min(mapOut.get(num), mapInner.get(num)));
}
}
}
}
输出如下:
element 4
element 9