lonest substring without repeating characters

class  {
    public int lengthOfLongestSubstring(String s) {
        Map<Character,Integer> map=new HashMap<>();
        int leftBound=0,max=0;
        for(int i=0;i<s.length();i++){
            char c=s.charAt(i);
            leftBound=Math.max(leftBound,map.containsKey(c)?map.get(c)+1:0);
            max=Math.max(max,i-leftBound+1);
            map.put(c,i);
        }
        return max;
    }
}