1 class Solution: 2 def numKLenSubstrNoRepeats(self, S: str, K: int) -> int: 3 n = len(S) 4 if n < K: 5 return 0 6 cnt = 0 7 dic = {} 8 i = 0 9 j = 0 10 while i <= n - K: 11 nexti = i 12 while j < i + K: 13 if S[j] not in dic: 14 dic[S[j]] = j 15 j += 1 16 else: 17 nexti = dic[S[j]] + 1 18 break 19 if j == i + K: 20 cnt += 1 21 dic.pop(S[i]) 22 i += 1 23 else: 24 for k in range(i,nexti): 25 dic.pop(S[k]) 26 i = nexti 27 return cnt
leetcode1100
猜你喜欢
转载自www.cnblogs.com/asenyang/p/11108350.html
今日推荐
周排行