开发笔记:leetcode3.LongestSubstringWithoutRepeatingCharacters[java]

篇首语：本文由编程笔记#小编为大家整理，主要介绍了leetcode 3. Longest Substring Without Repeating Characters [java]相关的知识，希望对你有一定的参考价值。

public int lengthOfLongestSubstring(String s) {
int i = 0, j = 0, max = 0;
Set set = new HashSet<>();

while(j if(! set.contains(s.charAt(j)) ){
set.add(s.charAt(j++));
max = Math.max(max, set.size());
}else{
set.remove(s.charAt(i++));
}
}
return max;
}