LeetCode 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.

解题思路：理解题意后，由于题目的特殊性，只要找出’a’-‘z’26个字母在P中的最长子串的长度再把他们加起来就是题目要求得的解。这样，时间复杂度为O（p.size()）,空间复杂度为O(1).

代码如下：

class Solution {
public:
    int findSubstringInWraproundString(string p) {
        if(p.size()==0) return 0;
        vector<int> num(26,0);
        int a = (int)'a', count = 1, temp = 0, index = 0;
        num[(int)p[0]-a] = 1;
        for(int i = 1; i != p.size(); ++i){
            temp = (int)p[i]-(int)p[i-1];
            index = (int)p[i]-a;
            if(temp==1||(temp == -25 && p[i-1]=='z')){
                ++count;
            }
            else{
                count = 1;
            }
            if(num[index] < count){
                    num[index] = count;
            }
        }
        int sum = 0;
        for(int i = 0; i != num.size(); ++i){
            sum += num[i];
        }
        return sum;
    }
};