【LeetCode】350. Intersection of Two Arrays II 两个数组的交集 II（Easy）（JAVA）

【LeetCode】350. Intersection of Two Arrays II 两个数组的交集 II（Easy）（JAVA）

题目地址: https://leetcode.com/problems/intersection-of-two-arrays-ii/

题目描述：

Given two arrays, write a function to compute their intersection.

Example 1:

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2,2]

Example 2:

Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [4,9]

Note:

• Each element in the result should appear as many times as it shows in both arrays.
• The result can be in any order.

Follow up:

• What if the given array is already sorted? How would you optimize your algorithm?
• What if nums1’s size is small compared to nums2’s size? Which algorithm is better?
• What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?

题目大意

给定两个数组，编写一个函数来计算它们的交集。

说明：

• 输出结果中每个元素出现的次数，应与元素在两个数组中出现次数的最小值一致。
• 我们可以不考虑输出结果的顺序。

解题方法

非常容易的一道题

1. 用 map 记录 num1 中的元素和出现的次数
2. 用 list 记录 num2 中在 num1 中存在元素，要判断是否大于 0 次，然后再把当前元素的次数 -1 存到 map 里面
3. list 转为 int 即可

class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums1.length; i++) {
            Integer temp = map.get(nums1[i]);
            if (temp == null) {
                map.put(nums1[i], 1);
            } else {
                map.put(nums1[i], temp + 1);
            }
        }
        List<Integer> list = new ArrayList<>();
        for (int i = 0; i < nums2.length; i++) {
            Integer count = map.get(nums2[i]);
            if (count == null || count == 0) continue;
            list.add(nums2[i]);
            map.put(nums2[i], count - 1);
        }
        int[] res = new int[list.size()];
        for (int i = 0; i < list.size(); i++) {
            res[i] = list.get(i);
        }
        return res;
    }
}

执行耗时:3 ms,击败了79.80% 的Java用户
内存消耗:38.6 MB,击败了81.48% 的Java用户

欢迎关注我的公众号，LeetCode 每日一题更新