The longest substring that cannot have repeating characters in a leetcode/substring

代码

package com.xcrj;

import java.util.HashSet;
import java.util.Set;

/** * 剑指 Offer II 016. 不含重复字符的最长子字符串 * Substrings cannot have repeating characters * 给定一个字符串 s ,请你找出其中不含有重复字符的 最长连续子字符串 的长度. */
public class Solution16 {
    

    /** * 双指针+set散列表 * 由set是否包含字符,Determines the right movement of the left and right pointers * set<Character> set.contains()Whether to contain repeating characters * 不contains repeating characters right右移 * contains repeating characters left右移 */
    public int lengthOfLongestSubstring1(String s) {
    
        Set<Character> set = new HashSet<>(s.length());
        int i = 0;
        int maxLen = 0;
        for (int j = 0; j < s.length(); j++) {
    
            // 不contains repeating characters The right pointer moves all the way to the right
            while (i < s.length() && !set.contains(s.charAt(i))) {
    
                set.add(s.charAt(i));
                i++;
            }
            // contains repeating characters The left pointer moves all the way to the right(Try to remove the repeated character)
            set.remove(s.charAt(j));
            maxLen = Math.max(maxLen, i - j);
        }

        return maxLen;
    }

    public static void main(String[] args) {
    
        Solution16 solution16 = new Solution16();
        System.out.println(solution16.lengthOfLongestSubstring1("abc"));
    }
}

参考

作者：LeetCode-Solution
链接：https://leetcode.cn/problems/wtcaE1/solution/bu-han-zhong-fu-zi-fu-de-zui-chang-zi-zi-4g7m/
来源：力扣（LeetCode）