小白笔记----------------------------------------leetcode 3. Longest Substring Without Repeating Characte

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 asubstring, "pwke" is a subsequence and not a substring.

这里我用了set容器，就简单了许多。。。。

public class Solution {    public int lengthOfLongestSubstring(String s) {        char[] a = s.toCharArray();        HashSet b = new HashSet();        int count = 0;        int max = 0;        for(int i = 0;i < a.length;i++){            for(int j = i;j < a.length;j++){                if(!b.add(a[j])){                    if(count >= max){                        max = count;                    }                    count = 0;                    b.clear();                    break;                                       }else{                    count++;                }            }        }        if(a.length == 1){            max = 1;        }        return max;    }}

---