题解 | #字符串变形#

class Solution { public:

string trans(string s, int n) {
    // write code here
    vector<string> vec;
    for(int i = 0; i < s.size(); i ++ )
    {
        string tmp = "";
        if(s[i] >= 'a' && s[i] <= 'z' || s[i] >= 'A' && s[i] <= 'Z')
        {
            if(s[i] >= 'a' && s[i] <= 'z')
            {
                tmp += (s[i] - 32);
            }
            else if(s[i] >= 'A' && s[i] <= 'Z')
            {
                tmp += (s[i] + 32);
            }
            
            while(i + 1 < s.size() && (s[i + 1] >= 'a' && s[i + 1] <= 'z' 
                                   || s[i + 1] >= 'A' && s[i + 1] <= 'Z'))
            {
                i ++;
                if(s[i] >= 'a' && s[i] <= 'z')
                {
                    tmp += (s[i] - 32);
                }
                else if(s[i] >= 'A' && s[i] <= 'Z')
                {
                    tmp += (s[i] + 32);
                }
            }
            vec.push_back(tmp);
        }
        if(s[i] == ' ')
        {
            vec.push_back(" ");
        }
    }
    string res;
    
    for(int i = vec.size() - 1; i >= 0; i -- )
    {
        res += vec[i];
    }
    return res;
}

};