[letecode java]Longest Substring Without Repeating Characters

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.

此题目求未出现重复字符的最长子串长度。需要借助一个HashSet，该set中存储到当前字符为止，不重复的字符序列。以"abcbbd"为了，到'c'是，set中为[abc]；到第二个'b'时，set中为[cb]；到第三个'b'时，set中为[b]。即出现重复字符时，要删去字符串从当前位置倒序第一次出现该重复字符之前的字符。当然用Queue也可以实现这种存储和删除。代码时间复杂度为o(n)，空间复杂度为o(n)。代码如下：

public class Solution {
    public int lengthOfLongestSubstring(String s) {
                int result = 0;
int max = 0;
Set<Character> set = new HashSet<>();
for (int i = 0; i < s.length(); i++) {
if (set.add(s.charAt(i))) {
result++;
} else {
if (max < result) 
max = result;
int repetition=result;
for(int j=1;j<=result;j++){
    if(j>repetition){
set.remove(s.charAt(i-j));
        continue;
   }
if(s.charAt(i-j)==s.charAt(i)){
repetition=j;
continue;
}
}
result=set.size();
}
}
return (max < result) ? result : max;
    }
}