Given a string, find the length of the longest substring without repeating characters.
Examples:
Given "abcabcbb"
, the answer is "abc"
, which the length is 3.
Given "bbbbb"
, the answer is "b"
, with the length of 1.
Given "pwwkew"
, the answer is "wke"
, with the length of 3. Note that the answer must be a substring, "pwke"
is a subsequence and not a substring.
Subscribe to see which companies asked this question.
public class Solution {
public int lengthOfLongestSubstring(String s) {
int max=0;
for(int i=0;i<s.length();i++){
Set<Character> set=new HashSet<>();
for(int j=i;j<s.length();j++){
if(!set.contains(s.charAt(j))){
set.add(s.charAt(j));
max=Math.max(set.size(),max);
}else {
break;
}
}
}
return max;
}
}