寻找最长不重复子串

最新推荐文章于 2024-06-29 23:00:55 发布

Jay__Feng

最新推荐文章于 2024-06-29 23:00:55 发布

阅读量372

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode leetcode题目解析文章标签： python算法 leetcode

本文链接：https://blog.csdn.net/github_37953781/article/details/72858072

LeetCode 同时被 2 个专栏收录

27 篇文章

订阅专栏

leetcode题目解析

22 篇文章

订阅专栏

寻找最长不重复子串

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

思路(时间复杂度为O(n))

遍历字符串，过程中将出现过的字符存入字典，key为字符，value为字符下标
用maxLength保存遍历过程中找到的最大不重复子串的长度
用start保存最长子串的开始下标
如果字符已经出现在字典中，更新start的值
如果字符不在字典中，更新maxLength的值
return maxLength

代码

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        """
        :type s: str
        :rtype: int
        """
        start = maxLength = 0
        usedChar = {}

        for i in range(len(s)):
            if s[i] in usedChar and start <= usedChar[s[i]]:
                start = usedChar[s[i]] + 1
            else:
                maxLength = max(maxLength, i - start + 1)
            usedChar[s[i]] = i

        return maxLength