[LeetCode Sync] Runtime - 9 ms (66.31%), Memory - 18.6 MB (48.81%)

Author: NinePiece2

Solutions/0345-reverse-vowels-of-a-string/README.md

@@ -0,0 +1,32 @@
+<p>Given a string <code>s</code>, reverse only all the vowels in the string and return it.</p>
+
+<p>The vowels are <code>&#39;a&#39;</code>, <code>&#39;e&#39;</code>, <code>&#39;i&#39;</code>, <code>&#39;o&#39;</code>, and <code>&#39;u&#39;</code>, and they can appear in both lower and upper cases, more than once.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">s = &quot;IceCreAm&quot;</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">&quot;AceCreIm&quot;</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The vowels in <code>s</code> are <code>[&#39;I&#39;, &#39;e&#39;, &#39;e&#39;, &#39;A&#39;]</code>. On reversing the vowels, s becomes <code>&quot;AceCreIm&quot;</code>.</p>
+</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">s = &quot;leetcode&quot;</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">&quot;leotcede&quot;</span></p>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= s.length &lt;= 3 * 10<sup>5</sup></code></li>
+	<li><code>s</code> consist of <strong>printable ASCII</strong> characters.</li>
+</ul>

Solutions/0345-reverse-vowels-of-a-string/solution.py

@@ -0,0 +1,16 @@
+class Solution:
+    def reverseVowels(self, s: str) -> str:
+        vowels = "aeiou"
+        i, j = 0, len(s) - 1
+        words = list(s)
+
+        while j > i:
+            while j > i and words[i].lower() not in vowels:
+                i += 1
+            while j > i and words[j].lower() not in vowels:
+                j -= 1
+            if j > i:
+                words[i], words[j] = words[j], words[i]
+                i, j = i + 1, j - 1
+        
+        return "".join(words)