3. Longest Substring Without Repeating Characters

最新推荐文章于 2024-01-06 13:50:14 发布

weixin_45405128

最新推荐文章于 2024-01-06 13:50:14 发布

阅读量81

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/weixin_45405128/article/details/104328575

版权

Leetcode 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

#import itertools as it
class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        mlen=0
        n=len(s)
        for i in range(n):
            zd={} #字典比list运算快许多
            for ele in s[i:]:
                if ele not in zd:
                    zd[ele]=1
                else:
                    break
            length=len(zd)
            #print(length)
            if length >mlen:
                mlen=length
        return mlen


class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        output=0
        track=''#用str的运算速度也比list快
        
        for c in s:
            if c in track:
                while True:        ####从左边开始判断重复，确定新的起点 
                    if  track[0]==c:
                        track=track[1:]
                        track+=c
                        break
                    else:
                        track=track[1:]
            else:
                track+=c
            
            if len(track)>output:
                output=len(track)
        return output

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        track, output, start = {}, 0, 0
        for i, v in enumerate(s):
            if v not in track or track[v] < start: #v不在track中或者在开始计数的字符之前
                output = max(output, i - start + 1)
            else:
                start = track[v] + 1 #更新开始计数的初始字符位置
            track[v] = i
        return output