- 【leetcode】3. 无重复字符的最长子串
- Leetcode 之 Longest Substring Wi
- LeetCode（03）Longest Substring Wi
- Leetcode 3: Longest Substring Wi
- LeetCode 3: Longest Substring Wi
- leetcode #3 Longest Substring Wi
- LeetCode 3 [Longest Substring Wi
- LeetCode【3】.Longest Substring Wi
- LeetCode #3 Longest Substring Wi
- leetcode（3）:Longest Substring Wi
class Solution:
def lengthOfLongestSubstring(self, s):
"""
:type s: str
:rtype: int
"""
ans = 0
left = 0
last = {}
for i in range(len(s)):
if s[i] in last and last[s[i]] >= left:
left = last[s[i]] + 1
last[s[i]] = i
ans = max(ans, i - left + 1)
return ans
网友评论