3. Longest Substring Without Repeating Characters

最新推荐文章于 2025-05-18 01:04:12 发布

authorized_keys

最新推荐文章于 2025-05-18 01:04:12 发布

阅读量119

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/authorized_keys/article/details/89957722

博客围绕求字符串中无重复字符的最长子串问题展开。给出了题目描述及示例，介绍使用滑动窗口（Sliding Window）方法求解，还评价滑动窗口是常用搜索方法。

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

题目

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.

解法

Sliding Window

class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        res=''
        for i in range(len(s)):
            temp = s[i]
            for j in s[i+1:]:
                if j in temp:
                    break
                else:
                    temp += j
            res = temp if len(res)<len(temp) else res
        return len(res)