点击打开链接
//DP
class Solution {
public:
int findSubstringInWraproundString(string p) {
vector<int>cnt(26, 0);
int res=0,len = 0;
for(int i=0; i<p.size(); i++){
if(i>0 && (p[i]==p[i-1]+1 || p[i-1]-p[i]==25)){
len +=1;
}
else{
len = 1;
}
//cnt[p[i]-'a'] = max(cnt[p[i]-'a'], len);
if(len>cnt[p[i]-'a']){
res += len-cnt[p[i]-'a'];
cnt[p[i]-'a'] = len;
}
}
return res;
}
};