class Solution(object):
def countGoodSubstrings(self, s):
"""
:type s: str
:rtype: int
"""
n=0
for i in range(0,len(s)-2) :
if s[i]==s[i+1] :
continue
elif s[i+1]==s[i+2] :
continue
elif s[i]==s[i+2] :
continue
else:
n+=1
return n
只需先将遍历到的起始字符开始比较是否相等,否则加1
22.13