Python | Leetcode Python题解之第467题环绕字符串中唯一的子字符串
题目:
题解:
class Solution:
def findSubstringInWraproundString(self, p: str) -> int:
dp = defaultdict(int)
k = 0
for i, ch in enumerate(p):
if i > 0 and (ord(ch) - ord(p[i - 1])) % 26 == 1: # 字符之差为 1 或 -25
k += 1
else:
k = 1
dp[ch] = max(dp[ch], k)
return sum(dp.values())
原文地址:https://blog.csdn.net/Mopes__/article/details/142800830
免责声明:本站文章内容转载自网络资源,如本站内容侵犯了原著者的合法权益,可联系本站删除。更多内容请关注自学内容网(zxcms.com)!