leetcode03 Longest Substring Without Repeating Characters 最长不重复子串

最新推荐文章于 2024-01-25 23:17:44 发布

原创最新推荐文章于 2024-01-25 23:17:44 发布 · 1.6k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #算法 #python #substring

python 同时被 2 个专栏收录

68 篇文章

订阅专栏

leetcode

8 篇文章

订阅专栏

本文介绍了一种求解字符串中最长无重复字符子串长度的方法，并通过一个Python类实现了解决方案。示例中使用了不同的输入字符串来展示算法的有效性和正确性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 subsequence and not a substring.

解法：

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        """
        :type s: str
        :rtype: int
        """
        max_length = 0
        substring = []
        for v in s:
            # 如果不一样 就一直加上去 如果一样 就取'一样'后面的 比如 abcdb 就取cdb
            if v in substring:
                substring = substring[substring.index(v) + 1:]

            substring.append(v)
            max_length = max(max_length, len(substring))

        return max_length


print Solution().lengthOfLongestSubstring('abaadaffafcd')