Class Solution
-
- All Implemented Interfaces:
public final class Solution
2559 - Count Vowel Strings in Ranges\.
Medium
You are given a 0-indexed array of strings
words
and a 2D array of integersqueries
.Each query <code>queriesi = l<sub>i</sub>, r<sub>i</sub></code> asks us to find the number of strings present in the range <code>l<sub>i</sub></code> to <code>r<sub>i</sub></code> (both inclusive ) of
words
that start and end with a vowel.Return an array
ans
of sizequeries.length
, whereans[i]
is the answer to thei
<sup>th</sup> query.Note that the vowel letters are
'a'
,'e'
,'i'
,'o'
, and'u'
.Example 1:
Input: words = "aba","bcb","ece","aa","e", queries = \[\[0,2],1,4,1,1]
Output: 2,3,0
Explanation: The strings starting and ending with a vowel are "aba", "ece", "aa" and "e".
The answer to the query 0,2 is 2 (strings "aba" and "ece").
to query 1,4 is 3 (strings "ece", "aa", "e").
to query 1,1 is 0.
We return 2,3,0.
Example 2:
Input: words = "a","e","i", queries = \[\[0,2],0,1,2,2]
Output: 3,2,1
Explanation: Every string satisfies the conditions, so we return 3,2,1.
Constraints:
<code>1 <= words.length <= 10<sup>5</sup></code>
1 <= words[i].length <= 40
words[i]
consists only of lowercase English letters.<code>sum(wordsi.length) <= 3 * 10<sup>5</sup></code>
<code>1 <= queries.length <= 10<sup>5</sup></code>
<code>0 <= l<sub>i</sub><= r<sub>i</sub>< words.length</code>
-
-
Constructor Summary
Constructors Constructor Description Solution()
-