3.无重复字符的最长子串（过程分析）

class Solution {
    public int lengthOfLongestSubstring(String s) {
        // 哈希集合，记录每个字符是否出现过
        Set<Character> occ = new HashSet<Character>();
        int n = s.length();
        // 右指针，初始值为 -1，相当于我们在字符串的左边界的左侧，还没有开始移动。rk = -1 比 rk = 0 更形象。
        int rk = -1, ans = 0;
	// ++i 比i++效率高，对结果没什么影响。
        for (int i = 0; i < n; ++i) {
            if (i != 0) {
                // 左指针向右移动一格，移除一个字符
                occ.remove(s.charAt(i - 1));
            }
            while (rk + 1 < n && !occ.contains(s.charAt(rk + 1))) {
                // 不断地移动右指针
                occ.add(s.charAt(rk + 1));
                ++rk;
            }
            // 第 i 到 rk 个字符是一个极长的无重复字符子串
            ans = Math.max(ans, rk - i + 1);
        }
        return ans;
    }
}

题解过程：
abcabcbb
i = 0 occ = []
rk + 1 = 0 => a 不在occ中 => occ = [a]
rk + 1 = 1 => b 不在occ中 => occ = [(a), (b)]
rk + 1 = 2 => c 不在occ中 => occ = [(a), (b), (c)]
rk + 1 = 3 => a 在occ中   => occ = [(a), (b), (c)] => length = 3

i = 1 移除i = 0的元素 => occ = [(b), (c)] 
rk + 1 = 3 => a 不在occ中 => occ = [(b), (c), (a)]
rk + 1 = 4 => b 在occ中   => occ = [(b), (c), (a)] => length = 3

i = 2 移除i = 1的元素 => occ = [(c), (a)] 
rk + 1 = 4 => b 不在occ中 => occ = [(c), (a), (b)]
rk + 1 = 5 => c 在occ中   => occ = [(c), (a), (b)] => length = 3

i = 3 移除i = 2的元素 => occ = [(a), (b)] 
rk + 1 = 5 => c 不在occ中 => occ = [(a), (b), (c)]
rk + 1 = 6 => b 在occ中   => occ = [(a), (b), (c)] => length = 3

i = 4 移除i = 3的元素 => occ = [(b), (c)] 
rk + 1 = 6 => c 在occ中 => occ = [(b), (c)] => length = 2

i = 5 移除i = 4的元素 => occ = [(c)] 
rk + 1 = 6 => c 不在occ中 => occ = [(c), (b)]
rk + 1 = 7 => c 在occ中   => occ = [(c), (b)] => length = 2

i = 6 移除i = 5的元素 => occ = [(b)] 
rk + 1 = 7 => b 在occ中 => occ = [(b)] => length = 1

i = 7 移除i = 6的元素 => occ = [] 
rk + 1 = 7 => b 不在occ中 => occ = [(b)]
rk + 1 = 8 => 不存在退出  => occ = [(b)] => length = 1

=> ans = 3

时间复杂度 O(n)
空间复杂度 O(可能出现的字符集)

HashSet的存储原理 - maoyl - 博客园  https://www.cnblogs.com/maoyali/p/8806388.html
++i和i++的效率孰优孰劣 - 我本成魔 - 博客园  https://www.cnblogs.com/xiemingjun/p/9633647.html