LeetCode 1456. 定长子串中元音的最大数目

class Solution {
public:
    bool isV(char ch){
        return ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u';
    }
    int maxVowels(string s, int k) {
        int n = s.size();
        int t = 0;
        for(int i = 0; i < k; ++i){
            t += isV(s[i]);
        }
        int res = t;
        for(int i = k; i < n; ++i){
            t += isV(s[i]) - isV(s[i - k]);
            res = max(res, t);
        }
        return res;
    }
};