20200329-剑指offer-面试题48. 最长不含重复字符的子字符串（滑动窗口）

最新推荐文章于 2022-06-27 12:57:24 发布

oldwong77

最新推荐文章于 2022-06-27 12:57:24 发布

阅读量308

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_37360631/article/details/105233642

版权

leetcode 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

传送门
借鉴的评论区的思路，滑动窗口
在这里插入图片描述

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        """
        :type s: str
        :rtype: int
        """
        maxx = 1
        if len(s) == 0:
            return 0
        # 双指针
        lcur = 0
        rcur = 1
        size = 1
        while size >= 1:
            if rcur < len(s):
                if s.find(s[rcur], lcur, rcur) == -1:
                    size = rcur - lcur + 1
                    maxx = max(size, maxx)
                else:
                    for i in range(rcur - 1, lcur - 1, -1):
                        if s[i] == s[rcur]:
                            lcur = i + 1
                            size = rcur - lcur + 1
                            break
                rcur = rcur + 1
            else:
                rcur = min(rcur, len(s)-1)
                maxx = max(maxx, rcur - lcur + 1)
                break
        return maxx