Longest Substring Without Repeating Characters Leetcode Python Java

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

原创最新推荐文章于 2025-05-18 01:04:12 发布 · 275 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java #leetcode #python

java 同时被 3 个专栏收录

79 篇文章

订阅专栏

python

32 篇文章

订阅专栏

Leetcode

17 篇文章

订阅专栏

本文探讨了如何找出给定字符串中最长的无重复字符子串，并提供了使用Python及Java实现的具体示例代码。

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

Longest Substring Without Repeating Characters

Total Accepted: 159876 Total Submissions: 710693 Difficulty: Medium

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

Examples:

Given "abcabcbb", the answer is "abc", which the length is 3.

Given "bbbbb", the answer is "b", with the length of 1.

Given "pwwkew", 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.

基本上没有什么技术含量，使用set就能简单的解决：

Python:

#Python:
class Solution:
        def longestSubString(self,s):
                subnum=len(set(s))
                return subnum
if __name__=="__main__":
        print Solution().longestSubString("yboyubasfbh")

Java:

Java:
public class Solution{
        public int longestSubString(String s){
                Set<Character> set=new HashSet<Character>();
                for(int i=0;i<s.length;i++){
                        set.add(s.CharAt(i));
                }
                return set.size();
        }
}