Intersection of Two Arrays LeetCode solution in Java

1
class Solution {
2
  public int[] intersection(int[] nums1, int[] nums2) {
3
    int[] dp = new int[1000];
4
    for (int i : nums1) {
5
      dp[i]++;
6
    }
7
    int[] ans = new int[1000];
8

9
    // declaring ptr to track ans array index
10
    int ptr = 0;
11
    for (int i : nums2) {
12
      if (dp[i] != 0) {
13
        dp[i] = 0;
14
        ans[ptr] = i;
15
        ptr++;
16
      }
17
    }
18
    return Arrays.copyOfRange(ans, 0, ptr);
19
  }
20
}