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

Commit f4c6b11

Browse files
add 2341
1 parent 24e608d commit f4c6b11

File tree

2 files changed

+27
-0
lines changed

2 files changed

+27
-0
lines changed

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
88

99
| # | Title | Solutions | Video | Difficulty | Tag
1010
|------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
11+
| 2341 |[Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2341.java) || Easy ||
1112
| 2335 |[Minimum Amount of Time to Fill Cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2335.java) || Easy ||
1213
| 2331 |[Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2331.java) || Easy ||
1314
| 2326 |[Spiral Matrix IV](https://leetcode.com/problems/spiral-matrix-iv/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2326.java) || Medium ||
Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
package com.fishercoder.solutions;
2+
3+
import java.util.HashMap;
4+
import java.util.Map;
5+
6+
public class _2341 {
7+
public static class Solution1 {
8+
public int[] numberOfPairs(int[] nums) {
9+
Map<Integer, Integer> map = new HashMap<>();
10+
for (int num : nums) {
11+
map.put(num, map.getOrDefault(num, 0) + 1);
12+
}
13+
int pairs = 0;
14+
int leftover = 0;
15+
for (int key : map.keySet()) {
16+
if (map.get(key) > 1) {
17+
pairs += map.get(key) / 2;
18+
leftover += map.get(key) % 2;
19+
} else {
20+
leftover++;
21+
}
22+
}
23+
return new int[]{pairs, leftover};
24+
}
25+
}
26+
}

0 commit comments

Comments
 (0)