3. Longest Substring Without Repeating Characters 最长的子串不重复字符

Posted Long Long Journey

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了3. Longest Substring Without Repeating Characters 最长的子串不重复字符相关的知识，希望对你有一定的参考价值。

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.


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
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)







以上是关于3. Longest Substring Without Repeating Characters 最长的子串不重复字符的主要内容，如果未能解决你的问题，请参考以下文章

longest-substring-with-at-least-k-repeating-characters

LeetCode 395. Longest Substring with At Least K Repeating Characters

395. Longest Substring with At Least K Repeating Characters

3. Longest Substring Without Repeating Characters

Leetcode: Longest Substring with At Least K Repeating Characters

395. Longest Substring with At Least K Repeating Characters