3. 无重复字符的最长子串

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

 注意右边界也在递增