-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.java
More file actions
39 lines (28 loc) · 996 Bytes
/
Solution.java
File metadata and controls
39 lines (28 loc) · 996 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
package leetcode.countElementsWithMaximumFrequency;
import java.util.HashMap;
import java.util.Map;
class Solution {
public int maxFrequencyElements(int[] nums) {
int maxFrequence = 0;
Map<Integer, Integer> frequences = new HashMap<>();
for(int i = 0; i < nums.length; i++){
int num = nums[i];
int frequence = frequences.getOrDefault(num, 0) + 1;
frequences.put(num, frequence);
if(maxFrequence < frequence){
maxFrequence = frequence;
}
}
int result = 0;
for(Map.Entry<Integer,Integer> entrada : frequences.entrySet()){
if(entrada.getValue() == maxFrequence) result ++;
}
return result * maxFrequence;
}
public static void main(String[] args) {
Solution s = new Solution();
int[] nums = new int[]{1,2,2,3,1,4};
int result = s.maxFrequencyElements(nums);
System.out.println(result);
}
}