[leetcode] Longest Substring Without Repeating Characters

最新推荐文章于 2025-12-03 23:35:37 发布

原创最新推荐文章于 2025-12-03 23:35:37 发布 · 487 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一种使用动态规划解决字符串中寻找最长无重复字符子串长度的问题，并提供了一个Python实现示例。

Q: Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length is 3. For “bbbbb” the longest substring is “b”, with the length of 1.

解题思路：动态规划

class Solution:
    # @param {string} s
    # @return {integer}
     def lengthOfLongestSubstring(self, s):
        if s is None or len(s)==0:
            return 0
        if len(s)==1:
            return 1
        dic = {}
        maxcount,startindex = 0,-1
        for index,i in enumerate(s):
            if i in dic and startindex<dic[i]:
                startindex = dic[i]
            if index-startindex>maxcount:
                maxcount = index-startindex
            dic[i]=index
        return maxcount