deffind(haystack, needle):# 暴力解法if needle isNone:return0iflen(haystack)<len(needle):return-1
i, j =0,0for i inrange(len(haystack)):if haystack[i:len(needle)+i]== needle:return i
return-1
28. 实现 strStr()解题思路暴力匹配,在长字符串中通过匹配短字符串长度的字符来得到。代码def find(haystack, needle): # 暴力解法 if needle is None: return 0 if len(haystack) < len(needle): return -1 i, j = 0, 0 for i in range(len(haystack)): if hayst