-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path3.py
38 lines (33 loc) · 948 Bytes
/
3.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
class Solution:
def lengthOfLongestSubstring(self, s):
"""
:type s: str
:rtype: int
"""
if len(s)==0:
return 0
if len(s)==1:
return 1
d = {}
begin = 0
end = 0
l = 1
while end < len(s):
if s[end] in d and d[s[end]]>= begin:
# do something
begin = d[s[end]]+1
del d[s[end]]
else:
d[s[end]]=end
end+=1
l = max(l,end-begin)
return l
if __name__ == "__main__":
s = Solution()
print(s.lengthOfLongestSubstring("tmmzuxt"))
print(s.lengthOfLongestSubstring("pwwkew"))
print(s.lengthOfLongestSubstring(" "))
print(s.lengthOfLongestSubstring("au"))
print(s.lengthOfLongestSubstring("abba"))
print(s.lengthOfLongestSubstring("bbbbb"))
print(s.lengthOfLongestSubstring("abcabcbb"))