【Leetcode_easy】917. Reverse Only Letters

problem

917. Reverse Only Letters

solution:

class Solution {
public:
    string reverseOnlyLetters(string S) {
        for(int i=0, j=S.size()-1; i<j; )//err...
        {
            if(!isalpha(S[i])) i++;
            else if(!isalpha(S[j])) j--;
            else 
            {
                char tmp = S[i];
                S[i] = S[j];
                S[j] = tmp;
                i++;
                j--;
            }
        }
        return S;
    }
};

参考

1. Leetcode_easy_917. Reverse Only Letters;

原文地址:https://www.cnblogs.com/happyamyhope/p/11252332.html