Last active
September 3, 2020 19:57
-
-
Save nextwebb/7afd02e33694119e68a1c54efa271a55 to your computer and use it in GitHub Desktop.
Longest Substring Without Repeating Characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Solution(object): | |
def lengthOfLongestSubstring(self, string: str) -> int: | |
sub = {} | |
cur_sub_start = 0 | |
cur_len = 0 | |
longest = 0 | |
for i, letter in enumerate(string): | |
if letter in sub and sub[letter] >= cur_sub_start: | |
cur_sub_start = sub[letter] + 1 | |
cur_len = i - sub[letter] #current - duplicate | |
sub[letter] = i | |
else: | |
sub[letter] = i | |
cur_len += 1 | |
if cur_len > longest: | |
longest = cur_len | |
return(longest) | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
oh camelCase! i'll take note of that subsequently 👍