Unique Substrings in Wraparound String

[leetcode]Unique Substrings in Wraparound String

链接：https://leetcode.com/problems/unique-substrings-in-wraparound-string/description/

Question

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.

Solution

class Solution {
public:
  int findSubstringInWraproundString(string p) {
    int size = p.size();
    if (size == 0) return 0;
    vector<int> dp;
    dp.resize(size);
    dp[0] = 1;
    vector<int> vec;
    // 以26个字母结尾的最长子串长度
    vec.resize(26, 0);
    vec[p[0]-'a'] = 1;
    for (int i = 1; i < size; i++) {
      if (p[i]-p[i-1] == 1 || (p[i] == 'a' && p[i-1] == 'z')) {
        dp[i] = dp[i-1]+1;
        vec[p[i]-'a'] = max(vec[p[i]-'a'], dp[i]);
      } else {
        dp[i] = 1;
        vec[p[i]-'a'] = max(vec[p[i]-'a'], dp[i]);
      }
    }
    int res = 0;
    for (int i = 0; i < vec.size(); i++)
      res += vec[i];
    return res;
  }
};

思路：这道题解法很机智，统计以各个字母结尾的最长的连续字符串的长度，比如 zabcdabc中，a结尾最长是za，b是zab，c是zabc，d是zabcd。以a结尾的substring有a、za，以b结尾的substring有zab、ab、b，观察规律发现将所有字母最长连续长度相加就可以了。