알고리즘 문제/Leetcode

345. Reverse Vowels of a String

BEstyle 2022. 12. 27. 13:14

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.

 

Example 1:

Input: s = "hello"
Output: "holle"

Example 2:

Input: s = "leetcode"
Output: "leotcede"

 

Constraints:

  • 1 <= s.length <= 3 * 105
  • s consist of printable ASCII characters.

class Solution:
    def reverseVowels(self, s: str) -> str:
        c={}
        v='aeiouAEIOU'
        ans=""
        for i in range(len(s)):
            if s[i] in v:
                c[i]=s[i]
        for i in s:
            if i in v:
                cmax=max(c)
                ans+= c[cmax]
                del c[cmax]
            else:
                ans+=i
        return ans