Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 345 with 18 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 345 # by problem number
lcpy gen -s reverse_vowels_of_a_string # by problem name
s, reverse only all the vowels in the string and return it.
The vowels are 'a', 'e', 'i', 'o', and 'u', and they can appear in both lower and upper cases, more than once.
Input: s = \"IceCreAm\"
Output: \"AceCreIm\"
s are ['I', 'e', 'e', 'A']. On reversing the vowels, s becomes “AceCreIm”.
Input: s = \"leetcode\"
Output: \"leotcede\"
class Solution:
# Time: O(n)
# Space: O(n)
def reverse_vowels(self, s: str) -> str:
vowels = set("aeiouAEIOU")
chars = list(s)
left, right = 0, len(chars) - 1
while left < right:
while left < right and chars[left] not in vowels:
left += 1
while left < right and chars[right] not in vowels:
right -= 1
chars[left], chars[right] = chars[right], chars[left]
left += 1
right -= 1
return "".join(chars)
| Time | Space |
|---|---|
| O(n) | O(n) |