467. Unique Substrings in Wraparound String

原题网址：https://leetcode.com/problems/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.

思路：参考https://discuss.leetcode.com/topic/70658/concise-java-solution-using-dp

Java代码：

public class Solution {
    public int findSubstringInWraproundString(String p) {
        int[] counts = new int[26];
        char[] pa = p.toCharArray();
        int maxLength = 0;
        for(int i = 0; i < pa.length; i++) {
            if (i > 0 && (pa[i - 1] + 1 == pa[i] || pa[i - 1] - 25 == pa[i])) {
                maxLength++;
            } else {
                maxLength = 1;
            }
            counts[pa[i] - 'a'] = Math.max(counts[pa[i] - 'a'], maxLength);
        }
        int result = 0;
        for(int i = 0; i < counts.length; i++) {
            result += counts[i];
        }
        return result;
    }
}

C++代码：

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

Python代码：

class Solution(object):
    def findSubstringInWraproundString(self, p):
        """
        :type p: str
        :rtype: int
        """
        counts = [0] * 26
        maxLength = 0
        for i in range(len(p)):
            if i > 0 and (ord(p[i - 1]) + 1 == ord(p[i]) or ord(p[i - 1]) - 25 == ord(p[i])):
                maxLength = maxLength + 1
            else:
                maxLength = 1
            counts[ord(p[i]) - ord('a')] = max(counts[ord(p[i]) - ord('a')], maxLength)
        result = 0
        for i in range(len(counts)):
            result += counts[i]
        return result

JavaScript代码：

/**
 * @param {string} p
 * @return {number}
 */
var findSubstringInWraproundString = function(p) {
    var counts = Array(26).fill(0);
    var maxLength = 0;
    for(var i = 0; i < p.length; i++) {
        if (i > 0 && (p.charCodeAt(i-1) + 1 == p.charCodeAt(i) || p.charCodeAt(i-1) - 25 == p.charCodeAt(i))) {
            maxLength++;
        } else {
            maxLength = 1;
        }
        counts[p.charCodeAt(i) - "a".charCodeAt(0)] = Math.max(counts[p.charCodeAt(i) - "a".charCodeAt(0)], maxLength);
    }
    var result = 0;
    for(var i = 0; i < counts.length; i++) {
        result += counts[i];
    }
    return result;
};