【leetcode_easy_string】1417. Reformat The String

problem

1417. Reformat The String

solution#1:

code

class Solution {
public:
    string reformat(string s) {
        string res = "";
        string digits = "";
        string letters = "";
        int k = 0;
        for(auto c:s)
        {
            if(isdigit(c)) { digits += c; k++; }
            else letters += c;
        }
        if(abs(int(2*k-s.size()))>1) return "";
        int i=0, j=0;
        bool flag = true;
        if(digits.size()>=letters.size()) flag = true;
        else flag = false;
        while(true)
        {
            if(flag && i<digits.size()) { res += digits[i++]; flag= false; }
            else if(!flag && j<letters.size()) { res += letters[j++]; flag = true; }
            else break;
        }
        return res;
    }
};

注意实现的细节！！！

参考

1. Leetcode_easy_string_1417. Reformat The String;

完