剑指 Offer 48. 最长不含重复字符的子字符串

  1.         Map<Character, Integer> dic = new HashMap<>();
  2.         int i = -1, res = 0;
  3.         for(int j = 0; j < s.length(); j++) {
  4.             if(dic.containsKey(s.charAt(j)))
  5.                 i = Math.max(i, dic.get(s.charAt(j))); // 更新左指针 i
  6.             dic.put(s.charAt(j), j); // 哈希表记录
  7.             res = Math.max(res, j - i); // 更新结果
  8.         }
  9.         return res;
  11. 作者：jyd
  12. 链接：https://leetcode-cn.com/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof/solution/mian-shi-ti-48-zui-chang-bu-han-zhong-fu-zi-fu-d-9/