LeetCode 3. Longest Substring Without Repeating Characters

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

Example 1:

Input: "abcabcbb"
Output: 3 
Explanation: The answer is "abc", with the length of 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.

这题暴力解也可，Accepted代码如下：

class Solution {
    public int lengthOfLongestSubstring(String s) {
        int l = s.length();
        int sb = 1;
        if (l > 1) {
            for (int i = 0; i < l - sb; i++) {
                Set<Character> set = new HashSet<>();
                set.add(s.charAt(i));
                int temp = 1;
                for (int j = i + 1; j < l; j++) {
                    if (set.contains(s.charAt(j))) {
                        break;
                    } else {
                        set.add(s.charAt(j));
                        temp++;
                    }
                }
                if (temp > sb) {
                    sb = temp;
                }
            }
            return sb;
        } else if (l == 1){
            return 1;
        } else {
            return 0;
        }
        
    }
}

但这解法仅比13.99%的人快，比32.62%的人用内存少，显然不够优秀，故看到一个：

   public int lengthOfLongestSubstring(String s) {
        if (s.length()==0) return 0;
        HashMap<Character, Integer> map = new HashMap<Character, Integer>();
        int max=0;
        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;
    }

@cbmbbz

此法仅用O(n)的复杂度，思路是我所不及啊。