LeetCode 3 无重复字符的最长子串

 代码

class Solution:
 def lengthOfLongestSubstring(self, s: str) - int:
 if not s:
 return 0
 lookup set()
 n len(s)
 left 0
 max_len 0
 cur_len 0
 for i in range(n):
 cur_len 1
 while s[i] in lookup:
 lookup.remove(s[left])
 left 1
 cur_len - 1
 if max_len cur_len:
 max_len cur_len
 lookup.add(s[i])
 return max_len