3. Longest Substring Without Repeating Characters 最長的子串不重復字符

阿新 • • 發佈：2018-02-13

sans nbsp type table example () gpo rgb 重復字符

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 最長的子串不重復字符

sans nbsp type table example () gpo rgb 重復字符 Given a string, find the length of the longest substring without repeating characters.E

3. Longest Substring Without Repeating Characters 最長的子串不重復字符

3. Longest Substring Without Repeating Characters 最長的子串不重復字符

leetcode-3:Longest Substring Without Repeating Characters 最長無重複字元的子串

[LEETCODE]#3 Longest Substring Without Repeating Characters 最長不重複的子串長度, Sliding Window, 滑動視窗

Leet Code 3. Longest Substring Without Repeating Characters (最長的沒有重複字元的子字串)

【LeetCode】3.Longest Substring Without Repeating Characters 無重複字元的最長子串

Leetcode 3. Longest Substring Without Repeating Characters 無重複字元的最長子串

[LeetCode] 3. Longest Substring Without Repeating Characters(無重複字元的最長子串)-滑動視窗法

3. Longest Substring Without Repeating Characters無重復字符的最長子串

3. Longest Substring Without Repeating Characters 無重復字符的最長子串

3. Longest Substring Without Repeating Characters尋找不重復的最大子串

LeetCode 3. Longest Substring Without Repeating Characters 給定一個字串，找到它的沒有重複字元的最大子串

3. Longest Substring Without Repeating Characters（求最長的不重複的連續的子序列。）

【LeetCode & 劍指offer刷題】字串題15：48 最長不含重複字元的子字串（3. Longest Substring Without Repeating Characters）

[LeetCode] Longest substring without repeating characters 最長無重復子串

3. Longest Substring Without Repeating Characters

Leetcode 3: Longest Substring Without Repeating Characters

3.Longest Substring Without Repeating Characters

LeetCode解題筆記 - 3. Longest Substring Without Repeating Characters

Leetcode 3. Longest Substring Without Repeating Characters

LeetCode 3. Longest Substring Without Repeating Characters（medium難度）【精】

3. Longest Substring Without Repeating Characters 最長的子串不重復字符

相關推薦