3. Longest Substring Without Rep

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.

Solution

class Solution {
    public int lengthOfLongestSubstring(String s) {
        char[] ca = s.toCharArray();
        int max = 0;
        for(int i = 0; i < ca.length; i++){
            int index = i;
            Set<Character> set = new HashSet<Character>();
            int len = -1;
            while(len != set.size()){
                len = set.size();
                if(index < ca.length){
                    set.add(ca[index]);
                }
                index++;
            }
            int strlen = index - i - 1;
            max = Math.max(max,strlen);
        }
        return max;
    }
}