力扣-03 无重复字符的最长子串

题目：

代码：

    public static int lengthOfLongestSubstring(String s) {
        int start = 0;
        int maxlength = 0;
        Map<Character, Integer> hash = new HashMap<>();
        char[] charArray = s.toCharArray();
        for (int end = 0; end < charArray.length; end++) {
            if (hash.containsKey(charArray[end]) && hash.get(charArray[end]) > start) {
                start = hash.get(charArray[end]) + 1;
            } else if (end - start + 1 > maxlength) {
                maxlength = end - start + 1;
            }
            hash.put(charArray[end], end);
        }
        return maxlength;
    }