mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
40 lines
2.2 KiB
HTML
40 lines
2.2 KiB
HTML
|
<p>You are given a <strong>0-indexed</strong> array of strings <code>words</code> and a 2D array of integers <code>queries</code>.</p>
|
||
|
|
|
||
|
|
<p>Each query <code>queries[i] = [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 <strong>inclusive</strong>) of <code>words</code> that start and end with a vowel.</p>
|
||
|
|
|
||
|
|
<p>Return <em>an array </em><code>ans</code><em> of size </em><code>queries.length</code><em>, where </em><code>ans[i]</code><em> is the answer to the </em><code>i</code><sup>th</sup><em> query</em>.</p>
|
||
|
|
|
||
|
|
<p><strong>Note</strong> that the vowel letters are <code>'a'</code>, <code>'e'</code>, <code>'i'</code>, <code>'o'</code>, and <code>'u'</code>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong class="example">Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> words = ["aba","bcb","ece","aa","e"], queries = [[0,2],[1,4],[1,1]]
|
||
|
|
<strong>Output:</strong> [2,3,0]
|
||
|
|
<strong>Explanation:</strong> 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].
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong class="example">Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> words = ["a","e","i"], queries = [[0,2],[0,1],[2,2]]
|
||
|
|
<strong>Output:</strong> [3,2,1]
|
||
|
|
<strong>Explanation:</strong> Every string satisfies the conditions, so we return [3,2,1].</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= words.length <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>1 <= words[i].length <= 40</code></li>
|
||
|
|
<li><code>words[i]</code> consists only of lowercase English letters.</li>
|
||
|
|
<li><code>sum(words[i].length) <= 3 * 10<sup>5</sup></code></li>
|
||
|
|
<li><code>1 <= queries.length <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>0 <= l<sub>i</sub> <= r<sub>i</sub> < words.length</code></li>
|
||
|
|
</ul>
|