leetcode 03 无重复字符的最长子串

最新推荐文章于 2024-09-12 16:31:59 发布

wh_585

最新推荐文章于 2024-09-12 16:31:59 发布

阅读量109

点赞数

分类专栏：算法及数据结构文章标签： leetcode 03;无重复字符最长子串

本文链接：https://blog.csdn.net/wh_585/article/details/102614117

版权

算法及数据结构专栏收录该内容

38 篇文章 0 订阅

订阅专栏

#3 leetcode 03 无重复字符的最长子串

class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        if s == '':
            m = 0
            return m
        hash_map = {}
        len_arr = [1 for i in range(len(s))]
        m = 1
        for index, val in enumerate(s):
            if not val in hash_map:
                if index != 0:
                    len_arr[index] = len_arr[index - 1] + 1
            else:
                if (hash_map[s[index - 1]] - len_arr[index - 1] + 1) <= hash_map[val]:
                    len_arr[index] = hash_map[s[index - 1]] - hash_map[val] + 1
                else:
                    len_arr[index] = len_arr[index - 1] + 1
            m = len_arr[index] if len_arr[index] >= m else m
            hash_map[val] = index
        return m