来个菜鸟的做法:
class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
if s=='':
return 0
dp=[1]*len(s)
for i in range(1,len(s)):
j=i-1
while j>=0:
if s[j+1:i+1].find(s[j])==-1:
dp[i]+=1
j-=1
else:
break
dp.sort()
return dp[-1]