[python3]碰撞法在字符串中找到两个最长的重复的字符串(or 字符)

性能之后以后有时间再与其他的比较

class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        
        record = [0]
        crush1 = str()
        crush2 = str()
        for i in range(len(s)):
            crush2 = str()
            for j in range(i,len(s)):
                crush2 += s[j]
                if len(crush2) <= len(crush1):

                    if crush1[-len(crush2):] == crush2:  
                        record.append(len(crush2))
                        crush1 = str()
                        crush2 = str()
                        continue

            
            crush1 += s[i]
        return max(record)