Leetcode 找最长不重复子字符串

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.

如题，两种方法，一种暴力，一种动态规划
暴力也能通过，113ms，beat 9%，O(n^3)，特别好想：
以每一个character为起始位置，找最长的不重复substring（如何判断重复？挺傻的办法：maintain一个list，一个一个检查），然后取最长。

动态规划，2ms，beat 99%，O(n)，有点绕：
对应ascii表，建一个128长度的int array，里面储存着每一个character最近一次出现的位置，maintain max length和current length，对于遍历到每一个character，we have：
如果这个character完全没出现过，current length++；
如果这个character离上一次出现的距离大于current length，说明current length可以继续increment by 1
反之如果距离小于等于current length，更新max length，然后设current length为距离。(这一步很重要, consider: “prwewkewab”)
更新该character的最新位置

class Solution2 {
        public int lengthOfLongestSubstring(String s){
            if (s == null || s.length() == 0) return 0;
            int[] arr = new int[128];
            int curLength=0, maxLength=0;
            for (int j = 0; j < 128; j++) arr[j] = -1;
            for (int i = 0; i < s.length(); i++){
                int pos = s.charAt(i);
                int preAppear = arr[pos];
                int dist = i-preAppear;
                if (preAppear == -1 || dist > curLength) curLength++;
                else {
                    if (curLength > maxLength) maxLength = curLength;
                    curLength = dist;
                }
                arr[pos]=i;
            }
            if (curLength > maxLength) maxLength = curLength;
            return maxLength;
        }
    }

好像也可以用双指针来做，O(n^2)的复杂度