程式語言 - LeetCode - C - 1456. Maximum Number of Vowels in a Substring of Given Length

參考資訊：
https://www.cnblogs.com/cnoodle/p/17375813.html

題目：


解答：

int is_vowel(char ch)
{
    if ((ch == 'a') ||
        (ch == 'e') ||
        (ch == 'i') ||
        (ch == 'o') ||
        (ch == 'u'))
    {
        return 1;
    }

    return 0;
}

int maxVowels(char* s, int k)
{
    int r = 0;
    int cc = 0;
    int cnt = 0;
    int len = strlen(s);

    for (cc = 0; cc < k; cc++) {
        cnt += is_vowel(s[cc]);
    }

    r = cnt;
    for (cc = k; cc < len; cc++) {
        cnt += is_vowel(s[cc]);
        cnt -= is_vowel(s[cc - k]);

        if (cnt > r) {
            r = cnt;
        }
    }

    return r;
}