滑动窗口--动态规划--面试题48. 最长不含重复字符的子字符串同-3. 无重复字符的最长子串

 滑动窗口 

class Solution {
    public int lengthOfLongestSubstring(String s) {
        if(s.length()==0) return 0;
        int left=0,res=0;
        HashMap<Character,Integer>mp=new HashMap<>();
        for(int i=0;i<s.length();i++){
            if(mp.containsKey(s.charAt(i)))
                left=Math.max(left,mp.get(s.charAt(i))+1);
            mp.put(s.charAt(i),i);
            res=Math.max(res,i-left+1);    
        }
        return res;
    }
}

 

String类的charAt(index)方法：charAt() 方法用于返回指定索引处的字符。

参考博客链接：

https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/solution/hua-dong-chuang-kou-by-powcai/

https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/solution/hua-jie-suan-fa-3-wu-zhong-fu-zi-fu-de-zui-chang-z/