LeetCode 2278: Percentage of Letter in String (Counting)
LeetCode 2278StringCountingSource: https://leetcode.com/problems/percentage-of-letter-in-string/
English
Count how many times letter appears in s. The answer is (count * 100) / s.length() using integer division.
class Solution {
public int percentageLetter(String s, char letter) {
int count = 0;
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) == letter) count++;
}
return count * 100 / s.length();
}
}func percentageLetter(s string, letter byte) int {
count := 0
for i := 0; i < len(s); i++ {
if s[i] == letter {
count++
}
}
return count * 100 / len(s)
}class Solution {
public:
int percentageLetter(string s, char letter) {
int count = 0;
for (char c : s) if (c == letter) count++;
return count * 100 / (int)s.size();
}
};class Solution:
def percentageLetter(self, s: str, letter: str) -> int:
count = sum(1 for c in s if c == letter)
return count * 100 // len(s)var percentageLetter = function(s, letter) {
let count = 0;
for (const c of s) if (c === letter) count++;
return Math.floor((count * 100) / s.length);
};中文
先统计 letter 在 s 中出现的次数,再计算 count * 100 / s.length,按题意使用整数除法即可。
class Solution {
public int percentageLetter(String s, char letter) {
int count = 0;
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) == letter) count++;
}
return count * 100 / s.length();
}
}func percentageLetter(s string, letter byte) int {
count := 0
for i := 0; i < len(s); i++ {
if s[i] == letter {
count++
}
}
return count * 100 / len(s)
}class Solution {
public:
int percentageLetter(string s, char letter) {
int count = 0;
for (char c : s) if (c == letter) count++;
return count * 100 / (int)s.size();
}
};class Solution:
def percentageLetter(self, s: str, letter: str) -> int:
count = sum(1 for c in s if c == letter)
return count * 100 // len(s)var percentageLetter = function(s, letter) {
let count = 0;
for (const c of s) if (c === letter) count++;
return Math.floor((count * 100) / s.length);
};
Comments