mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-26 07:18:56 +08:00
48 lines
1.8 KiB
HTML
48 lines
1.8 KiB
HTML
<p>A <strong>substring</strong> is a contiguous (non-empty) sequence of characters within a string.</p>
|
|
|
|
<p>A <strong>vowel substring</strong> is a substring that <strong>only</strong> consists of vowels (<code>'a'</code>, <code>'e'</code>, <code>'i'</code>, <code>'o'</code>, and <code>'u'</code>) and has <strong>all five</strong> vowels present in it.</p>
|
|
|
|
<p>Given a string <code>word</code>, return <em>the number of <strong>vowel substrings</strong> in</em> <code>word</code>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> word = "aeiouu"
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation:</strong> The vowel substrings of word are as follows (underlined):
|
|
- "<strong><u>aeiou</u></strong>u"
|
|
- "<strong><u>aeiouu</u></strong>"
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> word = "unicornarihan"
|
|
<strong>Output:</strong> 0
|
|
<strong>Explanation:</strong> Not all 5 vowels are present, so there are no vowel substrings.
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> word = "cuaieuouac"
|
|
<strong>Output:</strong> 7
|
|
<strong>Explanation:</strong> The vowel substrings of word are as follows (underlined):
|
|
- "c<strong><u>uaieuo</u></strong>uac"
|
|
- "c<strong><u>uaieuou</u></strong>ac"
|
|
- "c<strong><u>uaieuoua</u></strong>c"
|
|
- "cu<strong><u>aieuo</u></strong>uac"
|
|
- "cu<strong><u>aieuou</u></strong>ac"
|
|
- "cu<strong><u>aieuoua</u></strong>c"
|
|
- "cua<strong><u>ieuoua</u></strong>c"
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= word.length <= 100</code></li>
|
|
<li><code>word</code> consists of lowercase English letters only.</li>
|
|
</ul>
|