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

参考资料：here。

class Solution {
private:
	bool is_next(char a, char b) {
		if (a == 'z') return b == 'a';
		else return a == (b - 1);
	}
public:
	int findSubstringInWraproundString(string p) {
		vector<int> counts(26, 0);
		int count = 1;
		for (int i = 0; i < p.size(); i++) {
			if (i > 0 && is_next(p[i - 1], p[i])) {
				count++;
			}
			else count = 1;
			int idx = p[i] - 'a';
			counts[idx] = max(counts[idx], count);
		}
		return accumulate(counts.begin(), counts.end(), 0);
	}
};