3. Longest Substring Without Repeating Characters 最長的子串不重復字符
阿新 • • 發佈:2018-02-13
sans nbsp type table example () gpo rgb 重復字符
,
來自為知筆記(Wiz)
Given a string, find the length of the longest substring without repeating characters.
Examples:
Given "abcabcbb"
, the answer is "abc"
, which the length is 3.
Given "bbbbb"
, the answer is "b"
, with the length of 1.
Given "pwwkew"
, the answer is "wke"
, with the length of 3. Note that the answer must be a substring
"pwke"
is a subsequenceand not a substring.1234567891011121314151617181920212223242526272829 | class Solution: def lengthOfLongestSubstring( self , s): """ :type s: str :rtype: int """ res = startIndex = 0 m = {} for i in range ( len (s)): c = s[i] if c in m and startIndex < = m[c]: startIndex = m[c] + 1 else : res = max (res, i - startIndex + 1 ) m[c] = i return res #s = "" #s = "a" #s = "au" #s = "aabbb" s = "abcabcbb" #s = "bbbb" #s = "pwwkew" solution = Solution() res = solution.lengthOfLongestSubstring(s) print (res) |
來自為知筆記(Wiz)
3. Longest Substring Without Repeating Characters 最長的子串不重復字符