leetcode_3_LengthOfLongestSubstring

阿田要加油

于 2019-02-12 16:59:04 发布

阅读量251

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/allen1993ll/article/details/87098982

LeetCode 专栏收录该内容

5 篇文章

订阅专栏

本文详细解析了寻找字符串中最长无重复字符子串的算法实现，通过具体示例展示了如何利用HashSet数据结构和双指针技术高效解决此问题。文章提供了完整的Java代码示例，深入探讨了算法的时间复杂度和空间复杂度。

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

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

Example 1:

Input: "abcabcbb"
Output: 3 
Explanation: The answer is "abc", with the length of 3. 

Example 2:

Input: "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

Example 3:

Input: "pwwkew"
Output: 3
Explanation: 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.

MyAnswer

class Solution {
    public int lengthOfLongestSubstring(String s) {
         int i=0,j=0,max=0;
        Set<Character> set = new HashSet<>();
        while (j<s.length()){
            if (!set.contains(s.charAt(j))){
                set.add(s.charAt(j++));
                max = Math.max(max,set.size());
            }else {
                set.remove(s.charAt(i++));
            }
        }
        return max;
    }
}