【leetcode】345. Reverse Vowels of a String

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

---

思路：
很简单，直接看代码。

---

代码实现：

class Solution {
public:
    bool isVowel(char c){
        return c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' || c == 'A' || c == 'E' || c == 'I' || c == 'O' || c == 'U';
    }
    
    string reverseVowels(string s) {
        int left = 0;
        int right = s.size()-1;
        
        while (left < right){
            if (!isVowel(s[left])){
                ++left;
            }else if (!isVowel(s[right])){
                --right;
            }else{
                swap(s[left++], s[right--]);
            }
        }
        
        return s;
    }
};