LeetCode Java First 400 题解-003

最新推荐文章于 2025-04-21 22:09:55 发布

Felomeng

最新推荐文章于 2025-04-21 22:09:55 发布

阅读量231

点赞数

CC 4.0 BY-SA版权

分类专栏：刷题

本文链接：https://blog.csdn.net/felomeng/article/details/102699142

刷题专栏收录该内容

34 篇文章

订阅专栏

本文介绍了一种解决最长无重复子字符串问题的高效算法，采用滑动窗口技术，通过维护一个字符映射表来跟踪已出现的字符及其索引，实现O(n)的时间复杂度。示例代码展示了如何计算给定字符串中最长无重复子串的长度。

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

Longest Substring Without Repeating Characters 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.

public int lengthOfLongestSubstring(String s) {
    char[] sc = s.toCharArray();
    Map<Character, Integer> cm = new HashMap<Character, Integer>();
    int j = 0, maxLen = 0;
    for (int i = 0; i < sc.length; ++i) {
        char cur = sc[i];
        if (cm.containsKey(cur)) {
            maxLen = Math.max(i - j, maxLen);
            j = Math.max(j, cm.get(cur) + 1);
        }
        cm.put(cur, i);
    }
    return Math.max(sc.length - j, maxLen);
}