无重复字符的最长子串(java)

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