Leetcode 345. Reverse Vowels of a String

小白菜又菜

已于 2023-12-07 17:02:28 修改

阅读量396

点赞数

分类专栏： Leetcode 解题报告文章标签： leetcode 算法解题报告

于 2023-12-07 16:56:30 首次发布

本文链接：https://blog.youkuaiyun.com/mobius_strip/article/details/134859803

版权

解题报告同时被 2 个专栏收录

1396 篇文章

订阅专栏

Leetcode

172 篇文章

订阅专栏

本文介绍了一个Python解决方案，用于输入字符串中只反转所有元音（a,e,i,o,u及大写形式），并给出了相应的代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem

Given a string 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.

Algorithm

Collect all the vowels and reverse the order, then relpace depend on the origional order.

Code

class Solution:
    def reverseVowels(self, s: str) -> str:
        vowels = []
        slen = len(s)
        for i in range(slen):
            if s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'A' or s[i] == 'E' or s[i] == 'I' or s[i] == 'O' or s[i] == 'U':
                vowels.append(s[i])
        vowels.reverse()
        j = 0
        ans = ""
        for i in range(slen):
            if s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == 'A' or s[i] == 'E' or s[i] == 'I' or s[i] == 'O' or s[i] == 'U':
                ans += vowels[j]
                j += 1
            else: ans += s[i]
        return ans