题目注意点:
因为R-L+1等于总长度,所以每次R+1以后,在计算maxlength
解题思路:
移动滑窗的方式,分别创建L和R,每次移动以后记录最大值maxlength
完整代码:
class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
length=l=r=0
while r<len(s):
if s[r]in s[l:r]:l+=1
else:r+=1;length=max(length,r-l)
return length
作者:liu-xian-qing-chi-yan
链接:https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/solution/6xing-pyhua-dong-chuang-kou-hen-jian-dan-by-liu-xi/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。