leetcode 3. Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters class Solution { public int lengthOfLongestSubstring(String s) { int max=1; int length = s.length(); if(length==0){ return 0; } for(int i=0;i<length;i++){ HashSet<String> hs = new HashSet<String>(); hs.add(s.charAt(i)+""); for(int j =i+1;j<length;j++){ if(!hs.contains(s.charAt(j)+"")){ hs.add(s.charAt(j)+""); max=(j-i+1)>max?(j-i+1):max; //System.out.println(i+"->"+j+": "+max); }else{ break; } }} return max; } }