LeetCode-in-Java
3120. Count the Number of Special Characters I
Easy
You are given a string word. A letter is called special if it appears both in lowercase and uppercase in word.
Return the number of special letters in word.
Example 1:
Input: word = “aaAbcBC”
Output: 3
Explanation:
The special characters in word are 'a', 'b', and 'c'.
Example 2:
Input: word = “abc”
Output: 0
Explanation:
No character in word appears in uppercase.
Example 3:
Input: word = “abBCab”
Output: 1
Explanation:
The only special character in word is 'b'.
Constraints:
1 <= word.length <= 50wordconsists of only lowercase and uppercase English letters.
Solution
public class Solution {
public int numberOfSpecialChars(String word) {
int[] a = new int[26];
int[] b = new int[26];
int ans = 0;
for (char c : word.toCharArray()) {
if (c >= 'a' && c <= 'z') {
a[c - 'a']++;
} else {
b[c - 'A']++;
}
}
for (int i = 0; i < 26; i++) {
if (a[i] != 0 && b[i] != 0) {
ans++;
}
}
return ans;
}
}