python课程作业——Leetcode 3. Longest Substring Without Repeating Characters

最新推荐文章于 2021-12-03 15:58:56 发布

yeziqing10

最新推荐文章于 2021-12-03 15:58:56 发布

阅读量114

点赞数

分类专栏： Python课程

本文链接：https://blog.csdn.net/yeziqing10/article/details/80635851

版权

Python课程专栏收录该内容

18 篇文章 0 订阅

订阅专栏

Description

Given a string, find the length of the longest substring without repeating characters.

Solution

维护一个lp, rp和mp，mp表示s(lp,rp]中所有字母-位置的dict，双指针扫描即可

Code

class Solution:
    def lengthOfLongestSubstring(self, s):
        """
        :type s: str
        :rtype: int
        """
        res = 0
        lp = -1
        mp = {}
        for rp in range(0, len(s)):
            if s[rp] in mp:
                nlp = mp[s[rp]]
                for i in range(lp + 1, nlp + 1):
                    mp.pop(s[i])
                lp = nlp
            mp[s[rp]] = rp
            res = max(res, rp - lp)
        return res