mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
58 lines
2.0 KiB
HTML
58 lines
2.0 KiB
HTML
<p>给你一个字符串 <code>word</code> 和一个 <strong>非负 </strong>整数 <code>k</code>。</p>
|
||
|
||
<p>返回 <code>word</code> 的 <span data-keyword="substring-nonempty">子字符串</span> 中，每个元音字母（<code>'a'</code>、<code>'e'</code>、<code>'i'</code>、<code>'o'</code>、<code>'u'</code>）<strong>至少</strong> 出现一次，并且 <strong>恰好 </strong>包含 <code>k</code> 个辅音字母的子字符串的总数。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong class="example">示例 1：</strong></p>
|
||
|
||
<div class="example-block">
|
||
<p><strong>输入：</strong><span class="example-io">word = "aeioqq", k = 1</span></p>
|
||
|
||
<p><strong>输出：</strong><span class="example-io">0</span></p>
|
||
|
||
<p><strong>解释：</strong></p>
|
||
|
||
<p>不存在包含所有元音字母的子字符串。</p>
|
||
</div>
|
||
|
||
<p><strong class="example">示例 2：</strong></p>
|
||
|
||
<div class="example-block">
|
||
<p><strong>输入：</strong><span class="example-io">word = "aeiou", k = 0</span></p>
|
||
|
||
<p><strong>输出：</strong><span class="example-io">1</span></p>
|
||
|
||
<p><strong>解释：</strong></p>
|
||
|
||
<p>唯一一个包含所有元音字母且不含辅音字母的子字符串是 <code>word[0..4]</code>，即 <code>"aeiou"</code>。</p>
|
||
</div>
|
||
|
||
<p><strong class="example">示例 3：</strong></p>
|
||
|
||
<div class="example-block">
|
||
<p><strong>输入：</strong><span class="example-io">word = "ieaouqqieaouqq", k = 1</span></p>
|
||
|
||
<p><strong>输出：</strong>3</p>
|
||
|
||
<p><strong>解释：</strong></p>
|
||
|
||
<p>包含所有元音字母并且恰好含有一个辅音字母的子字符串有：</p>
|
||
|
||
<ul>
|
||
<li><code>word[0..5]</code>，即 <code>"ieaouq"</code>。</li>
|
||
<li><code>word[6..11]</code>，即 <code>"qieaou"</code>。</li>
|
||
<li><code>word[7..12]</code>，即 <code>"ieaouq"</code>。</li>
|
||
</ul>
|
||
</div>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>5 <= word.length <= 250</code></li>
|
||
<li><code>word</code> 仅由小写英文字母组成。</li>
|
||
<li><code>0 <= k <= word.length - 5</code></li>
|
||
</ul>
|