无重复字符的最长子串

            package
             leecode;


            class
             Solution {

  
            public
            int
             lengthOfLongestSubstring(String s) {
    
            char[] chars = s.toCharArray();//Converts to an array of charactersint i;
    int Max = 1;//The final resultint max1 = 1;//Ends with the last characterif (chars.length == 0) {//Special case 1return 0;
    }
    if (chars.length == 1) {//Special case 2return 1;
    }
    for (i = 1; i < chars.length; i++) {//Dynamic programmingint k = i - max1;
      for (int j = i - 1; j >= k; j--) {
        if (chars[i] == chars[j]) {//Find the same update pop up
          max1 = i - j;
          break;
        }
        if (j == i - max1) {//update
          max1++;
        }
      }
      if (max1 > Max) {//Whether or not to update
        Max = max1;
      }
    }

    return Max;
  }
}