mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-12 19:01:47 +08:00
35 lines
1.2 KiB
HTML
35 lines
1.2 KiB
HTML
<p>给你一个字符串 <code>s</code> ，仅反转字符串中的所有元音字母，并返回结果字符串。</p>
|
||
|
||
<p>元音字母包括 <code>'a'</code>、<code>'e'</code>、<code>'i'</code>、<code>'o'</code>、<code>'u'</code>，且可能以大小写两种形式出现不止一次。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong class="example">示例 1：</strong></p>
|
||
|
||
<div class="example-block">
|
||
<p><strong>输入：</strong><span class="example-io">s = "IceCreAm"</span></p>
|
||
|
||
<p><span class="example-io"><b>输出：</b>"AceCreIm"</span></p>
|
||
|
||
<p><strong>解释：</strong></p>
|
||
|
||
<p><code>s</code> 中的元音是 <code>['I', 'e', 'e', 'A']</code>。反转这些元音，<code>s</code> 变为 <code>"AceCreIm"</code>.</p>
|
||
</div>
|
||
|
||
<p><strong class="example">示例 2：</strong></p>
|
||
|
||
<div class="example-block">
|
||
<p><span class="example-io"><b>输入：</b>s = "leetcode"</span></p>
|
||
|
||
<p><strong>输出：</strong><span class="example-io">"leotcede"</span></p>
|
||
|
||
<p> </p>
|
||
</div>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>1 <= s.length <= 3 * 10<sup>5</sup></code></li>
|
||
<li><code>s</code> 由 <strong>可打印的 ASCII</strong> 字符组成</li>
|
||
</ul>
|