467. Unique Substrings in Wraparound String Medium

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.

思路：本题分解子列，分析可知，子列的个数为以每个字母为结尾的最长连续子列的长度之和，由此将问题变为求出p中以每个字母为结尾的最长连续子列的大小，注意z后接a是连续的。

class Solution {
public:
    int findSubstringInWraproundString(string p) {
        int count[26];
        for (int i = 0; i < 26; i++) {
            count[i] = 0;
        }
        int length, result = 0;
        for (int i = 0; i < p.length(); i++) {
            if (i == 0) {
                length = 1;
            }
            else {
                if (p[i - 1] + 1 == p[i] || p[i - 1] - 25 == p[i]) {
                    length++;
                }
                else {
                    length = 1;
                } 
            }
            count[p[i] - 'a'] = max(count[p[i] - 'a'], length);
        }
        for (int i = 0; i < 26; i++) {
            result += count[i];
        }
        return result;
    }
};