Leetcode 解題 Longest Substring without repeating charcater python

標籤：

原題：

Given a string, find the length of the longest substring without repeating character

For example, the Longest substring without repeating letters for "abcabcbb" is "abc", with the length is 3

思路：參考blog.csdn.net/hcbbt/article/details/43966513

       開一個數組記錄當前字元最近出現的位置，遍曆，更新左邊界，用它計算最大值。

代碼：

class Solution:    def lenthOfLongestSubstring(self, s):        res = 0        left = 0        d = {}        for i , ch in enumerate(s):            if ch in d and d[ch] >= left: left = d[ch] + 1            d[ch] = i            res = max(res, i -left + 1)        return res

 

Leetcode 解題 Longest Substring without repeating charcater python