Leetcode345

345 Reverse Vowels of a String
Write a function that takes a string as input and reverse only the vowels of a string.
Example 1:
Input: “hello”
Output: “holle”
Example 2:
Input: “leetcode”
Output: “leotcede”

Solution:

#include <iostream>

using namespace std;

class Solution {
public:
    string reverseVowels(string s) {

        int i = nextVolewIndex(s, 0);
        int j = preVolewIndex(s, s.size()-1);
        while (i < j){
            swap(s[i], s[j]);
            i = nextVolewIndex(s, i+1);
            j = preVolewIndex(s, j-1);
        }

        return s;
    }

private:
    int nextVolewIndex(const string &s, int i){
        for (int j = i; j < s.size(); j++) {
            if(isVolew(s[j])) {
                return j;
            }
        }
        return s.size();
    }
    int preVolewIndex(const string &s, int i){
        for (int j = i; j >= 0; j--) {
            if(isVolew(s[j])){
                return j;
            }
        }
        return -1;
    }
    bool isVolew(char c){
        char lowerc = tolower(c);
        return lowerc == 'a' || lowerc == 'e' || lowerc == 'i' || lowerc == 'o' || lowerc == 'u';
    }
};

int main() {

    cout << Solution().reverseVowels("hello") << endl;
    cout << Solution().reverseVowels("leetcode") << endl;

    return 0;
}

总结： 应用两个指针，一个从前往后，一个从后往前遍历，当遇到元音字母调换两个的位置。思路很简单，注意里面tolower函数的应用（小细节）。