1156. Swap For Longest Repeated Character Substring

交叠存储，由于允许，且只允许间隔一个字符，应用采用两个技术器的方法，交替保存重叠断cnt1字符数，以及cnt2字符数。

class Solution {
public:
    
    int process(vector<int>& a_index){
        int res = 0;
        int cnt1 = 1;
        int cnt2 = 0;
        for(int i=1;i<a_index.size();i++){
            if (a_index[i]==a_index[i-1]+1){
                cnt1 ++;
            }
            else{
                res = res>(cnt1+cnt2)?res:(cnt1+cnt2);
                if(a_index[i]==a_index[i-1]+2){
                    cnt2 = cnt1;
                    cnt1 = 1;
                }
                else{
                    cnt1 = 1;
                    cnt2 = 0;
                }
            }
        }
        res = res>(cnt1+cnt2)?res:(cnt1+cnt2);

        // return result
        if (res < a_index.size()){
            res = res + 1;
        }
        return res;
    }
    
    int maxRepOpt1(string text) {
        
        vector<int> a_index;
        vector<vector<int>> indexs(26, a_index);
        for (int i=0;i<text.size();i++){
            indexs[int(text[i]-'a')].push_back(i);
        }
        
        // return max num
        int res = 0;
        for (int i=0;i<indexs.size();i++){
            int temp = process(indexs[i]);
            res = res > temp? res:temp;
        }
        
        return res;
    }
};