https://leetcode.com/problems/longest-substring-without-repeating-characters/#/description
代码如下:
public class Solution {
public int lengthOfLongestSubstring(String s) {
Set<Character> set=new HashSet<>();
int max=0,j=0,i=0;
while(j<s.length())
{
if(!set.contains(s.charAt(j)))
{
set.add(s.charAt(j++));
// j++;
max=Math.max(max,set.size());
}else
{
//j++;
set.remove(s.charAt(i++));
}
}
return max;
}
}