Skip to content

Commit faca7d0

Browse files
add 2283
1 parent 106fa12 commit faca7d0

File tree

2 files changed

+25
-0
lines changed

2 files changed

+25
-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+
| 2283 |[Check if Number Has Equal Digit Count and Digit Value](https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2283.java) || Easy ||
1112
| 2279 |[Maximum Bags With Full Capacity of Rocks](https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2279.java) || Medium ||
1213
| 2278 |[Percentage of Letter in String](https://leetcode.com/problems/percentage-of-letter-in-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2278.java) || Easy ||
1314
| 2270 |[Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2270.java) || Medium ||
Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
package com.fishercoder.solutions;
2+
3+
import java.util.HashMap;
4+
import java.util.Map;
5+
6+
public class _2283 {
7+
public static class Solution1 {
8+
public boolean digitCount(String num) {
9+
Map<Integer, Integer> map = new HashMap<>();
10+
for (char c : num.toCharArray()) {
11+
int n = Character.getNumericValue(c);
12+
map.put(n, map.getOrDefault(n, 0) + 1);
13+
}
14+
for (int i = 0; i < num.length(); i++) {
15+
int n = Character.getNumericValue(num.charAt(i));
16+
int times = map.getOrDefault(i, 0);
17+
if (n != times) {
18+
return false;
19+
}
20+
}
21+
return true;
22+
}
23+
}
24+
}

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy