readme.md

Leetcode

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?

Solution

package leetcode350_IntersectionofTwoArraysII;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import utils.Logs;

public class Solution {
  public int[] intersect(int[] nums1, int[] nums2) {
    Map<Integer, Integer> maps = new HashMap<>();
    for (int i : nums1) {
      maps.put(i, maps.getOrDefault(i, 0) + 1);
    }

    List<Integer> res = new ArrayList<>();

    for (int j : nums2) {
      if (maps.containsKey(j) && maps.get(j) > 0) {
        res.add(j);
        maps.put(j, maps.get(j) - 1);
      }
    }

    return res.stream().mapToInt(i->i).toArray();
  }

  public static void main(String[] args) {
    Logs.print(new Solution().intersect(new int[] {1, 2, 2, 1}, new int[] {2, 2}));
    Logs.print(new Solution().intersect(new int[] {4, 9, 5}, new int[] {9, 4, 9, 8, 4}));
  }
}