<qiyuangong>003_Longest_Substring_Without_Repeating_Characters_2.java
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;
    }
public int sample_funcname ( String var_1 ) {
  int [ ] var_3 = new int [ 256 ] ;
  Arrays . fill ( var_3 , - 1 ) ;
  int var_8 = 0 , var_9 = 0 ;
  for ( int var_10 = 0 ;
  var_10 < var_1 . length ( ) ;
  var_10 ++ ) {
    if ( var_3 [ var_1 . charAt ( var_10 ) ] >= var_8 ) {
      var_8 = var_3 [ var_1 . charAt ( var_10 ) ] + 1 ;
    }
    var_3 [ var_1 . charAt ( var_10 ) ] = var_10 ;
    var_9 = Math . max ( var_10 - var_8 + 1 , var_9 ) ;
  }
  return var_9 ;
}
