Leetcode - Longest Substring Without Repeating Characters (Python)

preview_player
Показать описание
January 2021 Leetcode Challenge
Leetcode - Longest Substring Without Repeating Characters #3
Рекомендации по теме
Комментарии
Автор

almost got the same thing! nicely done

N = len(s)
max_length = 0

mapp = {}

left, right = 0, 0
while right < N:
if s[right] not in mapp:
mapp[s[right]] = right
else:
#move left to the last recently seen s[right]
left = max(mapp[s[right]], left)


max_length = max(max_length, right - left+1)
#update mapp
mapp[s[right]] = right +1
right += 1

return max_length

janmichaelaustria
Автор

Please don't drink or eat in the videos. thanks

Regalman