美文网首页
3. Longest Substring Without Rep

3. Longest Substring Without Rep

作者: 与你若只如初见v | 来源:发表于2018-05-23 18:43 被阅读0次

    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;
        }
    }
    

    相关文章

      网友评论

          本文标题:3. Longest Substring Without Rep

          本文链接:https://www.haomeiwen.com/subject/nkkdjftx.html