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

Commit 945c067

Browse files
add 2278
1 parent b2e02b2 commit 945c067

File tree

2 files changed

+16
-0
lines changed

2 files changed

+16
-0
lines changed

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,7 @@ _If you like this project, please leave me a star._ ★
99
| # | Title | Solutions | Video | Difficulty | Tag
1010
|------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|-------------|-------------
1111
| 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 ||
12+
| 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 ||
1213
| 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 ||
1314
| 2269 |[Find the K-Beauty of a Number](https://leetcode.com/problems/find-the-k-beauty-of-a-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2269.java) || Easy ||
1415
| 2264 |[Largest 3-Same-Digit Number in String](https://leetcode.com/problems/largest-3-same-digit-number-in-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2264.java) || Easy ||
Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
package com.fishercoder.solutions;
2+
3+
public class _2278 {
4+
public static class Solution1 {
5+
public int percentageLetter(String s, char letter) {
6+
int count = 0;
7+
for (char c : s.toCharArray()) {
8+
if (c == letter) {
9+
count++;
10+
}
11+
}
12+
return (int) Math.floor((count * 100.0 / s.length()));
13+
}
14+
}
15+
}

0 commit comments

Comments
 (0)