Leetcode-1156 Swap For Maximum Repeated Substring(单字符重复子串的最大长度)

 1 #define _for(i,a,b) for(int i = (a);i < b;i ++)
 2 
 3 
 4 class Solution
 5 {
 6     public:
 7         int check(string &s,int st)
 8         {
 9             int rnt = 1;
10             _for(i,st+1,s.size())
11                 if(s[i]!=s[i-1])
12                     break;
13                 else
14                     rnt ++;
15             return rnt;
16         }
17         int maxRepOpt1(string text)
18         {
19             int hash[30];
20             int kuai[30];
21             memset(hash,0,sizeof(hash));
22             memset(kuai,0,sizeof(kuai));
23             _for(i,0,text.size())
24             {
25                 int len = check(text,i);
26                 hash[text[i]-‘a‘] = max(hash[text[i]-‘a‘],len);
27                 kuai[text[i]-‘a‘] ++;
28                 i += len-1;
29             }
30             int rnt = 0;
31             _for(i,0,29)
32                 rnt = max(rnt,hash[i]);
33             
34             _for(i,0,text.size())
35             {
36                 int len = check(text,i);
37                 if(i+len+1<text.size() && text[i+len+1]==text[i])
38                 {
39                     int len2 = check(text,i+len+1);
40                     rnt = max(rnt,len+len2);
41                     if(kuai[text[i]-‘a‘]>2)
42                         rnt = max(rnt,len+len2+1);
43                 }
44                 if(kuai[text[i]-‘a‘]>1)
45                     rnt = max(rnt,len+1);
46                 i += len-1;
47             }
48             return rnt;
49         }
50 };