345_ReverseVowelsofaString - a920604a/leetcode GitHub Wiki

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

class Solution {
public:
    string reverseVowels(string s) {
        stack<char> vowels;
        for(char c: s)
        {
            if (c == 'a' || c=='e' || c=='i' || c=='o' || c=='u' || c == 'A' || c=='E' || c=='I' || c=='O' || c=='U') vowels.push(c);
        }
        string ret;
        for(char c:s)
        {
            if (c == 'a' || c=='e' || c=='i' || c=='o' || c=='u' || c == 'A' || c=='E' || c=='I' || c=='O' || c=='U'){
                ret += vowels.top();
                vowels.pop();
            }
            else ret+=c;
        }
        return ret;
    }
};