题目：

题解：

func findSubstringInWraproundString(p string) (ans int) {dp := [26]int{}k := 0for i, ch := range p {if i > 0 && (byte(ch)-p[i-1]+26)%26 == 1 { // 字符之差为 1 或 -25k++} else {k = 1}dp[ch-'a'] = max(dp[ch-'a'], k)}for _, v := range dp {ans += v}return
}func max(a, b int) int {if b > a {return b}return a
}