算法分析与设计课程11——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.

Example1

Input: "a"
Output: 1

Explanation: Only the substring "a" of string "a" is in the string s.

Example2

Input: "cac"
Output: 2
Explanation: There are two substrings "a", "c" of string "cac" in the string s.

Example3

Input: "zab"
Output: 6
Explanation: There are six substrings "z", "a", "b", "za", "ab", "zab" of string "zab" in the string s.

二、分析

1、考虑允许子集重复出现的情况，令dp[i]为字符串第i个字符时，前面所得到的子集数量总数，那在到字符i的时候，有以下两种情况：
①该字符与前面的c个字符能连成一串：dp[i] = (c + 1) + dp[i - 1];
②不能连成一串：dp[i] = dp[i - 1] + 1;

2、由于子集是不能重复的，所以令dp[]的长度为26个（即英文字母’a’~’z’），dp[i]为以字符i结尾的最大子串数量，结合分析1，易得结果

三、源代码

class Solution {
public:
    int findSubstringInWraproundString(string p) {
        int length = p.length();
        int dp[26];
        for(int i = 0; i < 26; i ++)
            dp[i] = 0;
        int c = 1;
        for(int i = 0; i < length; i ++)
        {
            int flag = p[i] - p[i - 1];
            if(flag == 1 || flag == -25)
                c ++;
            else
                c = 1;
            int index = p[i] - 'a';
            if(c > dp[index])
                dp[index] = c;
        }
        int sum = 0;
        for(int i = 0; i < 26; i ++)
            sum += dp[i];
        return sum;
    }
};