Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to content

Commit fea26a9

Browse files
add 2404
1 parent 3052825 commit fea26a9

File tree

2 files changed

+37
-0
lines changed

2 files changed

+37
-0
lines changed

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -10,6 +10,7 @@ _If you like this project, please leave me a star._ ★
1010
|------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
1111
| 2432 |[The Employee That Worked on the Longest Task](https://leetcode.com/problems/the-employee-that-worked-on-the-longest-task/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2432.java) || Easy ||
1212
| 2427 |[Number of Common Factors](https://leetcode.com/problems/number-of-common-factors/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2427.java) || Easy ||
13+
| 2404 |[Most Frequent Even Element](https://leetcode.com/problems/most-frequent-even-element/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2404.java) || Easy ||
1314
| 2399 |[Check Distances Between Same Letters](https://leetcode.com/problems/check-distances-between-same-letters/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2399.java) || Medium ||
1415
| 2395 |[Find Subarrays With Equal Sum](https://leetcode.com/problems/find-subarrays-with-equal-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2395.java) || Easy ||
1516
| 2380 |[Time Needed to Rearrange a Binary String](https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2380.java) || Medium ||
Lines changed: 36 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,36 @@
1+
package com.fishercoder.solutions;
2+
3+
import java.util.ArrayList;
4+
import java.util.Collections;
5+
import java.util.HashMap;
6+
import java.util.List;
7+
import java.util.Map;
8+
9+
public class _2404 {
10+
public static class Solution1 {
11+
public int mostFrequentEven(int[] nums) {
12+
Map<Integer, Integer> map = new HashMap<>();
13+
for (int i = 0; i < nums.length; i++) {
14+
if (nums[i] % 2 == 0) {
15+
map.put(nums[i], map.getOrDefault(nums[i], 0) + 1);
16+
}
17+
}
18+
List<Integer> smallestEvens = new ArrayList<>();
19+
int freq = 0;
20+
for (int key : map.keySet()) {
21+
if (map.get(key) > freq) {
22+
smallestEvens.clear();
23+
freq = map.get(key);
24+
smallestEvens.add(key);
25+
} else if (map.get(key) == freq) {
26+
smallestEvens.add(key);
27+
}
28+
}
29+
if (smallestEvens.size() < 1) {
30+
return -1;
31+
}
32+
Collections.sort(smallestEvens);
33+
return smallestEvens.get(0);
34+
}
35+
}
36+
}

0 commit comments

Comments
 (0)