comefrom: <qiyuangong>003_Longest_Substring_Without_Repeating_Characters_2.java
code: public int lengthOfLongestSubstring(String s) {
      	int[] charMap = new int[256];
      	Arrays.fill(charMap, -1);
      	int i = 0, maxLen = 0;
      	for (int j = 0; j < s.length(); j++) {
      		if (charMap[s.charAt(j)] >= i) {
      			i = charMap[s.charAt(j)] + 1;
      		}
      		charMap[s.charAt(j)] = j;
      		maxLen = Math.max(j - i + 1, maxLen);
      	}
      	return maxLen;
      }
masked: public int sample_funcname ( String var_0 ) {
    int [ ] var_1 = new int [ 256 ] ;
    Arrays . fill ( var_1 , - 1 ) ;
    int var_2 = 0 , var_3 = 0 ;
    for ( int var_4 = 0 ;
    var_4 < var_0 . length ( ) ;
    var_4 ++ ) {
      if ( var_1 [ var_0 . charAt ( var_4 ) ] >= var_2 ) {
        var_2 = var_1 [ var_0 . charAt ( var_4 ) ] + 1 ;
      }
      var_1 [ var_0 . charAt ( var_4 ) ] = var_4 ;
      var_3 = Math . max ( var_4 - var_2 + 1 , var_3 ) ;
    }
    return var_3 ;
  }
  