Most Frequent Number Following Key In an Array LeetCode solution in Java

1
class Solution {
2
  public int mostFrequent(int[] nums, int key) {
3
    int n = nums.length;
4
    HashMap<Integer, Integer> map = new HashMap<>();
5
    for (int i = 0; i < n - 1; i++) {
6
      if (nums[i] == key) {
7
        int target = nums[i + 1];
8
        map.put(target, map.getOrDefault(target, 0) + 1);
9
      }
10
    }
11
    int max = 0;
12
    int re = 0;
13
    for (int x : map.keySet()) {
14
      if (map.get(x) > max) {
15
        re = x;
16
        max = map.get(x);
17
      }
18
    }
19
    return re;
20
  }
21
}