标签：char long ret find return sts class set for
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.
public class Solution {
public int lengthOfLongestSubstring(String s) {
if (s==null || s.length()==0) return 0;
HashSet<Character> set = new HashSet<>();;
int l = 0, r = 0;
int maxLen = 0;
while (r < s.length()) {
char cur = s.charAt(r);
if (!set.contains(cur)) {
set.add(cur);
maxLen = Math.max(maxLen, r-l+1);
r++;
}
else {
set.remove(s.charAt(l));
l++;
}
}
return maxLen;
}
}
Longest Substring Without Repeating Characters
标签：char long ret find return sts class set for
原文地址：http://www.cnblogs.com/apanda009/p/7258501.html
