Given a string, find the length of the longest substring without repeating characters.
Examples:
Given "abcabcbb"
, the answer is "abc"
, which the length is 3.
Given "bbbbb"
, the answer is "b"
, with the length of 1.
Given "pwwkew"
, the answer is "wke"
, with the length of 3. Note that the answer must be a substring, "pwke"
is a subsequence and not a substring.
class Solution(object):
def lengthOfLongestSubstring(self, s):
"""
:type s: str
:rtype: int
"""
m=n=0
b={}
for i in range(len(s)):
if s[i] not in b or b[s[i]]<i-n:
n=n+1
b[s[i]]=i
else:
n=i-b[s[i]]
b[s[i]]=i
m=max(m,n)
return m