leetcode刷题_OJ 3

Given a string, find the length of the longest substring without repeating characters.

Example 1:

Input: "abcabcbb"
Output: 3 
Explanation: The answer is "abc", which the length is 3.
Example 2:

Input: "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.
Example 3:

Input: "pwwkew"
Output: 3
Explanation: 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.

题目的意思：从字符串内找出不含重复字母的最长子字符串的长度。

用HashMap来存储已经访问过的字母，一旦重复，从重复字母的下一个开始重新计算。计算长度用当前正在遍历的下标减去重复字母的下一位(即开始计算长度的地方)

class Solution {
    public int lengthOfLongestSubstring(String s) {
        int max=0;
        HashMap<Character,Integer> map=new HashMap<Character,Integer>();//注意是character类型而不是string

        for(int i=0,j=0;i<s.length();i++){
            if(map.containsKey(s.charAt(i))){
                j=Math.max(j,map.get(s.charAt(i))+1);
            }
            map.put(s.charAt(i),i);
            max=Math.max(max,i-j+1);
        }
        return max;
    }
}

关于s.charAt(i)+1可能有些人为什么疑惑会加1，我觉得下面的说得挺好的