/ leetcodesolve / longestsubstring.py
swadhinbiswas update · 3/29/2024
1f22b99
19 lines · 602 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        l = answer = 0
        chars = [-1]*128
        for r, ch in enumerate(s):
            if chars[ord(ch)] >= l:
                l = chars[ord(ch)]+1
            else:
                answer = max(answer, r-l+1)
            chars[ord(ch)] = r
        return answer
      
      
solve=Solution()
print(solve.lengthOfLongestSubstring("abcabcbb"))
print(solve.lengthOfLongestSubstring("bbbbb"))
print(solve.lengthOfLongestSubstring("pwwkew"))
print(solve.lengthOfLongestSubstring(""))
print(solve.lengthOfLongestSubstring(" "))