最长无重复字符的子串 lintcode

"abcabcbb"

"abc"

3

"bbbbb"

"b"

1

<pre name="code" class="java">public class Solution {
/**
* @param s: a string
* @return: an integer
*/
public int lengthOfLongestSubstring(String s) {
// write your code here
int res = 0;
String resStr = "";
if(s == null || s.length() == 0)return res;
if(s.length() == 1)return res+1;
int len = s.length();
int[] tmp = new int[len];
Set<Character> set = new HashSet<>();
res = 1;
for(int i = 1; i < len; i++){
if(!set.isEmpty())set.clear();
int tmpLen = 0;
for(int j = i; ; j--){
if(j < 0){
res = Math.max(tmpLen, res);
break;
}
if(!set.contains(s.charAt(j))){
set.add(s.charAt(j));
tmpLen++;
}else{
res = Math.max(tmpLen, res);
break;
}
}

}

return res;
}
}