mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
20 lines
748 B
HTML
20 lines
748 B
HTML
<p>Given a string <code>s</code>, reverse only all the vowels in the string and return it.</p>
|
|
|
|
<p>The vowels are <code>'a'</code>, <code>'e'</code>, <code>'i'</code>, <code>'o'</code>, and <code>'u'</code>, and they can appear in both cases.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<pre><strong>Input:</strong> s = "hello"
|
|
<strong>Output:</strong> "holle"
|
|
</pre><p><strong>Example 2:</strong></p>
|
|
<pre><strong>Input:</strong> s = "leetcode"
|
|
<strong>Output:</strong> "leotcede"
|
|
</pre>
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= s.length <= 3 * 10<sup>5</sup></code></li>
|
|
<li><code>s</code> consist of <strong>printable ASCII</strong> characters.</li>
|
|
</ul>
|