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.解析:
设table[i],为以字符‘a'+i结尾的最大的字符串长度,如abcd,则以a,b,c,d即为的最大长度分别是1,2,3,4,以每个字符结尾的子串数分别是这个串的产固定,如abcd以d结尾的串分别是d,cd,bcd,abcd,为4个。
代码:
class Solution {
public:
int findSubstringInWraproundString(string p) {
int ans=0;
int begin=0;
int end=p.size();
vector<int>table(26,0);
table[p[0]-'a']=1;
for (int i=1; i<p.size(); i++)
{
if((p[i]-p[i-1]==1)||(p[i]+25==p[i-1]))
{
table[p[i]-'a']=max(table[p[i]-'a'],i-begin+1);
}
else
{
table[p[i]-'a']=max(1,table[p[i]-'a']);
begin=i;
}
}
for (int i=0; i<26; i++)
{
ans+=table[i];
}
return ans;
}
};