LeetCode#350. Intersection of Two Arrays II

350. Intersection of Two Arrays II

难度:简单

Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you may return the result in any order.

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]
Explanation: [9,4] is also accepted.

Constraints:

  • 1 <= nums1.length, nums2.length <= 1000
  • 0 <= nums1[i], nums2[i] <= 1000

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?

哈希表

class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        if (nums1.length > nums2.length) {
            return intersect(nums2, nums1);
        }
        Map<Integer, Integer> hashtable = new HashMap<>();
        for (int num : nums1) {
            int count = hashtable.getOrDefault(num, 0) + 1;
            hashtable.put(num, count);
        }
        int[] ans = new int[nums1.length];
        int index = 0;
        for (int num : nums2) {
            if (hashtable.containsKey(num) && hashtable.get(num) > 0) {
                int count = hashtable.get(num) - 1;
                hashtable.put(num, count);
                ans[index] = num;
                index++;
            } else {
                continue;
            }
        }
        return Arrays.copyOfRange(ans, 0, index);
    }
}

时间复杂度: O ( m + n ) O(m+n) O(m+n)
空间复杂度: O ( min ⁡ ( m , n ) ) O(\min(m,n)) O(min(m,n))

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值