书坊尚

关注

Leecode | 3 Longest Substring Without Repeating Characters

书坊尚

关注

阅读 76

2022-03-31

在这里插入图片描述

class Solution:
    def lengthOfLongestSubstring(self, s: str):
        start = -1
        max   = 0
        d ={}
        
        for i in range(len(s)):
            if s[i] in d and d[s[i]] > start:
                start = d[s[i]]
                d[s[i]] = i
            else:
                d[s[i]] = i
                if i - start > max:
                    max = i - start
        return max

相关推荐

蛇发女妖

Longest Substring Without Repeating Characters

蛇发女妖 68 0 0

zhoulujun

3. Longest Substring Without Repeating Characters

zhoulujun 71 0 0

青鸾惊鸿

3. Longest Substring Without Repeating Characters**

青鸾惊鸿 78 0 0

前端王祖蓝

Leetcode 3. Longest Substring Without Repeating Characters

前端王祖蓝 99 0 0

elvinyang

[LeetCode]Longest Substring Without Repeating Characters

elvinyang 124 0 0

小迁不秃头

[LeetCode]3.Longest Substring Without Repeating Characters (medium)

小迁不秃头 101 0 0

鱼满舱

LeetCode 3 : Longest Substring Without Repeating Characters ---- 不重复的子串

鱼满舱 197 0 0

高子歌

LeetCode Top 100 Liked Questions 3. Longest Substring Without Repeating Characters(Java版; Hard)

高子歌 92 0 0

禾木瞎写

算法: 没有重复字符的最长字符串3. Longest Substring Without Repeating Characters

禾木瞎写 48 0 0

是归人不是过客

LeetCode第三题(Longest Substring Without Repeating Characters)三部曲之二:编码实现

是归人不是过客 65 0 0

精彩评论(0)

0 0 举报