Leetcode-Unique Substrings in Wraparound String
java 代码：
public class Solution { public int findSubstringInWraPRoundString(String p) { if(p.length()==0)return 0; char[] arr=p.toCharArray(); int[] cnt=new int[256]; cnt[arr[0]]=1; int pre=1,res=0; for(int i=1;i<p.length();i++){ if(arr[i]=='a'&&arr[i-1]=='z'||arr[i]==arr[i-1]+1)pre+=1; else pre=1; cnt[arr[i]]=Math.max(pre,cnt[arr[i]]); } for(int i=0;i<256;i++)res+=cnt[i]; return res; } }