Leetcode 3. Longest Substring Without Repeating Characters

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

SniperMarus

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

阅读量92

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/SniperMarus/article/details/89047868

版权

Leetcode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

题目：https://leetcode.com/problems/longest-substring-without-repeating-characters/
简介：又是一推范围条件判断。。。

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        """
        :type s: str
        :rtype: int
        """
        substring = ''
        tmp_substring = ''
        for index, sub_s in enumerate(s):
            if index == 0:
                tmp_substring = sub_s
            elif sub_s not in tmp_substring:
                tmp_substring += sub_s
            elif sub_s in tmp_substring:
                index_tmp = tmp_substring.index(sub_s)
                if index_tmp != len(tmp_substring) - 1:
                    new_tmp_substring = tmp_substring[index_tmp+1:] + sub_s
                    if len(tmp_substring) >= len(substring):
                        substring = tmp_substring
                        tmp_substring = new_tmp_substring
                    else:
                        tmp_substring = new_tmp_substring
                else:
                    new_tmp_substring = sub_s
                    if len(tmp_substring) >= len(substring):
                        substring = tmp_substring
                        tmp_substring = new_tmp_substring
                    else:
                        tmp_substring = new_tmp_substring
        if len(tmp_substring) >= len(substring):
            substring = tmp_substring
                    
        return len(substring)