DAY3：leetcode #3 Longest Substring Without Repeating Characters

最新推荐文章于 2016-12-02 12:09:42 发布

路人甲wttttt

最新推荐文章于 2016-12-02 12:09:42 发布

阅读量260

点赞数

CC 4.0 BY-SA版权

分类专栏：算法文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/zcy19941015/article/details/51075918

算法专栏收录该内容

76 篇文章

订阅专栏

本文探讨如何在给定字符串中找到最长的无重复字符子串，通过实例解析算法解决这一经典问题。

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.

Subscribe to see which companies asked this question

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        """
        :type s: str
        :rtype: int
        """
        result = []
        test_start = 0
        test_end = 0
        if len(s) == 1:
            return 1
        while True:
            test_end += 1
            if test_end < len(s):
                if s[test_end] in s[test_start:test_end]:
                    result.append(s[test_start:test_end])
                    test_start = s[test_start:test_end].index(s[test_end]) + test_start + 1
            else:
                result.append(s[test_start:])
                break
        max_len = 0
        for str_temp in result:
            if len(str_temp) > max_len:
                max_len = len(str_temp)
        return max_len

这道题目主要是各种边界条件比较坑，思考的时候一定要冷静，想清楚在开始编程序