467. Unique Substrings in Wraparound String

Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so s will look like this: "...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd....".

Now we have another string p. Your job is to find out how many unique non-empty substrings of p are present in s. In particular, your input is the string p and you need to output the number of different non-empty substrings of p in the string s.

Note: p consists of only lowercase English letters and the size of p might be over 10000.

Example 1:

Input: "a"
Output: 1

Explanation: Only the substring "a" of string "a" is in the string s.

Example 2:

Input: "cac"
Output: 2
Explanation: There are two substrings "a", "c" of string "cac" in the string s.

Example 3:

Input: "zab"
Output: 6
Explanation: There are six substrings "z", "a", "b", "za", "ab", "zab" of string "zab" in the string s.

分析： 注意重复子字符串不能重复计数。用一个26维的数组来存储在该字符串中最长的以其为结尾的连续字符串个数，则以其结尾的可能性就等于字符串个数。

public class Solution {
    public int findSubstringInWraproundString(String p) {
        if(p==null)
            return 0;
        int n=p.length();
        int[] alpha=new int[26];
        int flag=1;
        int index;
        for(int i=0;i<n;i++){
            index = p.charAt(i)-'a';
            alpha[index]=alpha[index]<flag?flag:alpha[index];
            if((i+1)<n&&((p.charAt(i)-'a'+1)%26)==(p.charAt(i+1)-'a')){
                flag++;
            }else{
                flag=1;
            }
            
        }
        int ans=0;
        for(int i=0;i<26;i++)
            ans+=alpha[i];
        return ans;
    }
}