【LeetCode】3. Longest Substring Without Repeating Characters

最新推荐文章于 2020-01-11 04:54:12 发布

原创最新推荐文章于 2020-01-11 04:54:12 发布 · 1.3k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #Python

python 同时被 2 个专栏收录

72 篇文章

订阅专栏

LeetCode

15 篇文章

订阅专栏

本文详细介绍了如何寻找字符串中最长的无重复字符子串的长度，通过具体实例展示了算法的实现过程，包括abcabcbb、bbbbb和pwwkew等案例的分析。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Introduce

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

Input: "abcabcbb"
Output: 3 
Explanation: The answer is "abc", with the length of 3.

Example 2:

Input: "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

Example 3:

Input: "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3. 
             Note that the answer must be a substring, "pwke" is a subsequence and not a substring.

Solution

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        """
        :type s: str
        :rtype: int
        """
        max_value = 0
        if len(s) <= 1:
            return len(s)
        else:
            for i in range(len(s)):
                res_list = [s[i]]
                for j in range(i+1, len(s)):
                    if s[j] not in res_list:
                        res_list.append(s[j])
                        max_value = max(max_value, len(res_list))
                    else:
                        max_value = max(max_value, len(res_list))
                        break
            return max_value