467. Unique Substrings in Wraparound String

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.

高票的解题思路点击打开链接

分析：

1. 以某个特定字母结尾的字符串，它的所有个数等于它的最长字符串的长度，假设有"a,b,c,d"，以d为结尾的最长字符串有“a,b,c,d”，"b,c,d"，"c,d"，"d"共4个。显然等于字符串的长度。如果我们得到所有的以26个字母结尾的字符串的个数，它们的和就是结果。

2. 如果有一个字符串被覆盖，如"a,b,c,d"和”b,c,d“，显然"b,c,d"的个数可以忽略不计。因为已经被“a,b,c,d”覆盖了。

 int findSubstringInWraproundString(string p) {
        int n=p.size();
        if(n<=1) return n;
        vector<int> mx(26,0);//mx是以26个字母为终点的子字符串的最大长度
        int r=0;int i,curmaxlen=0;
      for(i=0;i<n;i++)
      {
         if(i>0&&(p[i-1]+1==p[i])||(p[i-1]=='z'&&p[i]=='a')) 
         curmaxlen++;
         else
         curmaxlen=1;
         mx[p[i]-'a']=max(mx[p[i]-'a'],curmaxlen);
      }
      for(i=0;i<26;i++)
      {
          r+=mx[i];
      }
      return r;
    }