小白笔记----------------------------------------leetcode 3. Longest Substring Without Repeating Characte

最新推荐文章于 2024-12-17 14:13:22 发布

原创最新推荐文章于 2024-12-17 14:13:22 发布 · 297 阅读

0 ·

CC 4.0 BY-SA版权

算法设计专栏收录该内容

56 篇文章

订阅专栏

本文介绍了一种使用HashSet容器解决寻找字符串中最长无重复字符子串长度的问题的方法。通过迭代和条件判断，实现了有效避免重复字符出现的功能，并给出了具体实现代码。

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

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容器，就简单了许多。。。。

public class Solution {
    public int lengthOfLongestSubstring(String s) {
        char[] a = s.toCharArray();
        HashSet b = new HashSet();
        int count = 0;
        int max = 0;
        for(int i = 0;i < a.length;i++){
            for(int j = i;j < a.length;j++){
                if(!b.add(a[j])){
                    if(count >= max){
                        max = count;
                    }
                    count = 0;
                    b.clear();
                    break;   
                    
                }else{
                    count++;
                }
            }
        }
        if(a.length == 1){
            max = 1;
        }
        return max;
    }
}