Longest string

最新推荐文章于 2024-11-07 18:48:34 发布

AndrewDengpf

最新推荐文章于 2024-11-07 18:48:34 发布

阅读量309

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 系列

本文链接：https://blog.youkuaiyun.com/andrewDengpf/article/details/53676456

leetcode 系列专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一种算法，用于找出给定字符串中长度最长的无重复字符子串及其长度。通过使用HashSet来记录已出现的字符，并遍历字符串进行判断，确保子串内不包含重复字符。

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

/**
 * Created by kobe73er on 16/12/9.
 * <p>
 * Examples:
 * <p>
 * Given "abcabcbb", the answer is "abc", which the length is 3.
 * <p>
 * Given "bbbbb", the answer is "b", with the length of 1.
 * <p>
 * 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.
 * <p>
 * Subscribe to see which companies asked this question
 */

   public static int lengthOfLongestSubstring(String s) {
        if (s.equals("")) {
            return 0;
        }
        if (s.length() == 1) {
            return 1;
        }
        Set set = new HashSet();
        int currentMax = 0;
        for (int m = 0; m < s.length(); m++) {
            int length = 0;
            for (int i = m; i < s.length(); i++) {
                if (set.contains(s.charAt(i))) {
                    set.clear();
                    break;
                } else {
                    set.add(s.charAt(i));
                    length++;

                }
                currentMax = length > currentMax ? length : currentMax;

            }

        }
        return currentMax;
    }