LeetCode 345. Reverse Vowels of a String

345. Reverse Vowels of a String

Description

Write a function that takes a string as input and reverse only the vowels of a string.

 Example 1:
Given s = "hello", return "holle".

Example 2:
Given s = "leetcode", return "leotcede".

Note:
The vowels does not include the letter "y"

Solution

• 题意即将一个字符串中的元音字母逆转顺序，不改变其他字母的位置。
• 可以利用pair来保存元音字母及其内容，并将内容替换而位置不换，从而再在原字符串中根据位置修改，注意大小写元音字母均视为元音字母，代码如下：

// C/C++
class Solution {
public:
    bool isVowel(char c) {
        c = tolower(c);
        if (c == 'a' || c == 'i' || c == 'o' || c == 'e' || c == 'u')
            return true;
        return false;
    }
    string reverseVowels(string s) {
        vector<pair<int,char> > vowels;
        for (int i = 0;i < s.size();i++) {
            if (isVowel(s[i]))
                vowels.push_back(make_pair(i,s[i]));
        }
        int l = 0,r = vowels.size() - 1;
        while (l < r) {
            char temp = vowels[l].second;
            vowels[l].second = vowels[r].second;
            vowels[r].second = temp;
            l++;
            r--;
        }
        for (int i = 0;i < vowels.size();i++) {
            s[vowels[i].first] = vowels[i].second;
        }
        return s;
    }
};

# python
class Solution(object):
    def reverseVowels(self, s):
        pos = [];
        v = [];
        vowels = ['a','i','o','e','u','A','I','O','E','U'];
        for i in range(len(s)):
            if s[i] in vowels:
                pos.append(i)
                v.append(s[i])
        v = v[::-1]
        s = list(s)
        for i in range(len(pos)):
            s[pos[i]] = v[i]
        s = ''.join(s)
        return s