Leetcode-3: Longest Substring Without Repeating Characters

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

Examples:

Given “abcabcbb”, the answer is “abc”, which the length is 3.

Given “bbbbb”, the answer is “b”, with the length of 1.

Given “pwwkew”, 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.

思路：
1. 遍历子串，找到最长的那个：复杂度$O (n^3)$
2. 用一个哈希表维hashMap护字符串中每个字符的位置，两个指针head和tail指向目前访问字符串的头和尾，一个变量maxLength记录当前发现的最长不重复子串； 首先保证head和tail之间的字符都是不重复的，如果*tail存在hashMap中，而且索引k在[head, tail)之间（说明重复）此时：a) head = k + 1, b) 更新tail在hashMap中的索引；反之，k不在[head, tail)之间，那么a) maxLength = max{maxLength, tail - head + 1}，b) 更新tail在hashMap中的索引。

public class Solution {
    public int lengthOfLongestSubstring(String s) {
        if (s.length() == 0)
            return 0;
        int maxLength = 0;
        Map<Character, Integer> map = new HashMap<>();
        for (int head = 0, tail = 0; tail < s.length(); ++ tail) {
            if (map.containsKey(s.charAt(tail))) {
                head = Math.max(head, map.get(s.charAt(tail)) + 1);
            }
            maxLength = Math.max(maxLength, tail - head + 1);
            map.put(s.charAt(tail), tail);
        }
        return maxLength;
    }
}