MyLeetcode/cpp_solutions/3121.cpp at main · Kaminyou/MyLeetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
class Solution {
public:
    int numberOfSpecialChars(string word) {
        bool lower[26];
        bool upper[26];
        bool valid[26];
        for (int i = 0; i < 26; ++i) {
            lower[i] = false;
            upper[i] = false;
            valid[i] = true;
        }
        for (auto& c : word) {
            if (c >= 'a' && c <= 'z') {
                lower[c - 'a'] = true;
                if (upper[c - 'a']) {
                    valid[c - 'a'] = false;
                }
            }
            if (c >= 'A' && c <= 'Z') {
                upper[c - 'A'] = true;
            }
        }
        int res = 0;
        for (int i = 0; i < 26; ++i) {
            if (lower[i] && upper[i] && valid[i]) res++;
        }
        return res;
    }
};