Leetcode 467. Unique Substrings in Wraparound String

原题链接:

思路： 开大小为26的dp数组，‘a’对应0，dp[i]表示以‘a’到‘z’结尾的最长子串，最后把dp数组相加就是结果了

class Solution {
    public int findSubstringInWraproundString(String p) {
        if(p == null || p.length() == 0) return 0;
        char[] str = p.toCharArray();
        int[] dp = new int[26];
        dp[str[0] - 'a'] = 1;
        int cnt = 1;
        for(int i = 1; i < str.length; i++){
            int last = str[i - 1]  - 'a';
            int cur = str[i]  - 'a';
            if(cur == (last + 1) % 26){
                cnt++;
            } else{
                cnt = 1;
            }
            dp[cur] = Math.max(cnt, dp[cur]);
        }
        return Arrays.stream(dp).sum();
    }
}