你的浏览器禁用了JavaScript, 请开启后刷新浏览器获得更好的体验!
解答:
class Solution: def lengthOfLongestSubstring(self, s: str) -> int: k =0 m =0 for i in range(len(s)): j = i d = str() while j < len(s): if s[j] not in d: d = d + s[j] j = j+1 else: break if len(d) > m: m = len(d) return m
要回复文章请先登录或注册