LeetCode 算法刷题(3)

最新推荐文章于 2019-06-01 08:53:29 发布

wenanshi

最新推荐文章于 2019-06-01 08:53:29 发布

阅读量688

点赞数 1

CC 4.0 BY-SA版权

分类专栏： leetcode算法

本文链接：https://blog.youkuaiyun.com/wenanshi/article/details/52024483

leetcode算法专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一种求解字符串中最长无重复字符子串长度的方法，并提供了详细的代码实现。通过遍历字符串并使用ArrayList来记录当前不重复的字符，算法能够有效地找到最长的不包含重复字符的子串。

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

3. Longest Substring Without Repeating Characters

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.

public class Test3 {
    public static void main(String[] args) {

        Test3 t3 = new Test3();
        t3.lengthOfLongestSubstring("dvdf");
    }

    public int lengthOfLongestSubstring(String s) {
        char[] s1 = s.toCharArray();

        ArrayList<Character> s2 = new ArrayList<Character>();
        int max = 0;
        for(int i=0;i<s1.length;i++){
            int j = 0;
            for(;j<s2.size();j++){
                if(s1[i]==s2.get(j)){
                    if(max<s2.size()){
                        max = s2.size();
                    }
                    int k =0;
                    while(k<=j){
                        s2.remove(0);
                        k++;
                    }

                    break;
                }
            }

            s2.add(s1[i]);
            if(max<s2.size()){
                max = s2.size();
            }

        }

        return max;
    }
}