345. Reverse Vowels of a String（LeetCode）

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".

class Solution {
public:
    string reverseVowels(string s) {
       vector<char> vet{'A','E','I','O','U', 'a', 'e', 'i', 'o', 'u' };
        int len = s.size();
        int first = 0;
        int last = len - 1;
        cout << first << " " << last << endl;
        cout << vet.size() << endl;
        while (first <= last)
        {
            int i,j;
            for (i = 0; i < vet.size(); i++)
            {
                if (s[first] == vet[i])
                    break;
            }
            if (i>=vet.size())
            {
                first++;
            }
            for (j = 0; j < vet.size(); j++)
            {
                if (s[last] == vet[j])
                    break;
            }
            if (j >= vet.size())
            {
                last--;
            }
            if (i < vet.size() && j < vet.size())
            {
                swap(s[first], s[last]);
                first++;
                last--;
            }
        }
        return s;
    }
};

别人的代码是下面的：

class Solution {
public:
    string reverseVowels(string s) {
        int i = 0, j = s.size();
        string s1 = "aAeEiIoOuU";
        
        while( i < j ) {
            if ( s1.find_first_of(s[i]) == std::string::npos ) {
                i++;
                continue;
            }
            
            if ( s1.find_first_of(s[j]) == std::string::npos ) {
                j--;
                continue;
            }
            
            swap(s[i], s[j]);
            i++;
            j--;
        }
        
        return s;
    }
};