mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-13 14:57:08 +00:00
Deven
27 lines
838 B
Python
27 lines
838 B
Python
class Solution(object):
|
|
def lengthOfLongestSubstring(self, s):
|
|
"""
|
|
:type s: str
|
|
:rtype: int
|
|
"""
|
|
letters = [x for x in s]
|
|
longestLength = 1
|
|
|
|
if len(letters) == 0:
|
|
return 0
|
|
|
|
for i in range(len(letters)):
|
|
dictionary = {}
|
|
for j in range(i, len(letters)):
|
|
if dictionary.get(letters[j]) == None:
|
|
dictionary[letters[j]] = 0
|
|
else:
|
|
if j-i > longestLength:
|
|
longestLength = j-i
|
|
break
|
|
|
|
if j == len(letters) - 1:
|
|
if j-i+1 > longestLength:
|
|
longestLength = j-i+1
|
|
return longestLength
|
|
return longestLength |