Leetcode_003_Longest_Substring_Without_Repeating_Characters

public class Solution {
    public int lengthOfLongestSubstring(String s) {
         int result = Integer.MIN_VALUE;
         int len = s.length();
         if(len == 0 || len == 1) return len;
         int []dp = new int[len];
         dp[0] = 1;
         for(int i = 1; i<len; i++){
             int index = i;
             while(index-1>=0 && s.charAt(i) != s.charAt(index-1)) index--;
             if(index == 0) dp[i] = dp[i-1]+1;
             else dp[i] = Math.min(dp[i-1]+1, i-index+1);
             if(dp[i] > result) result = dp[i];
         }
         return result;
    }
}

DP 2pointers