Leetcode:Longest Substring Without Repeating Characters

来源:互联网 发布:嘀哩嘀哩软件下载 编辑:程序博客网 时间:2024/06/04 19:58

这题目比较简单,遍历整个s,比较是否重复即可。

class Solution(object):    def lengthOfLongestSubstring(self, s):        sub,t = set(),[]        i,n,longest,L = 0,len(s),0,0        offset = 0        while i<n:            ch = s[i]            if ch not in sub:                sub.add(ch)                t.append(ch)                i,L=i+1,L+1                if L-offset>longest:longest = L-offset            else:                x,offset = t[offset],offset+1                sub.remove(x)        return longest
0 0
原创粉丝点击