LeetCode-in-Java

2586. Count the Number of Vowel Strings in Range

Easy

You are given a 0-indexed array of string words and two integers left and right.

A string is called a vowel string if it starts with a vowel character and ends with a vowel character where vowel characters are 'a', 'e', 'i', 'o', and 'u'.

Return the number of vowel strings words[i] where i belongs to the inclusive range [left, right].

Example 1:

Input: words = [“are”,”amy”,”u”], left = 0, right = 2

Output: 2

Explanation:

Example 2:

Input: words = [“hey”,”aeo”,”mu”,”ooo”,”artro”], left = 1, right = 4

Output: 3

Explanation:

The number of vowel strings in the mentioned range is 3.

Constraints:

Solution

public class Solution {
    public int vowelStrings(String[] words, int left, int right) {
        int count = 0;
        for (int i = left; i <= right; i++) {
            if (isVowel(words[i].charAt(0)) && isVowel(words[i].charAt(words[i].length() - 1))) {
                count++;
            }
        }
        return count;
    }

    private boolean isVowel(char ch) {
        String str = "aeiou";
        return str.indexOf(ch) != -1;
    }
}