<qiyuangong>003_Longest_Substring_Without_Repeating_Characters_1.java
public int lengthOfLongestSubstring(String s) {
     	boolean[] exist = new boolean[256];
     	int i = 0, maxLen = 0;
     	for (int j = 0; j < s.length(); j++) {
     		while (exist[s.charAt(j)]){
     			exist[s.charAt(i)] = false;
     			i++;
     		}
     		exist[s.charAt(j)] = true;
     		maxLen = Math.max(j - i + 1, maxLen);
     	}
     	return maxLen; 
     }
public int sample_funcname ( String var_1 ) {
  boolean [ ] var_4 = new boolean [ 256 ] ;
  int var_6 = 0 , var_7 = 0 ;
  for ( int var_8 = 0 ;
  var_8 < var_1 . length ( ) ;
  var_8 ++ ) {
    while ( var_4 [ var_1 . charAt ( var_8 ) ] ) {
      var_4 [ var_1 . charAt ( var_6 ) ] = false ;
      var_6 ++ ;
    }
    var_4 [ var_1 . charAt ( var_8 ) ] = true ;
    var_7 = Math . max ( var_8 - var_6 + 1 , var_7 ) ;
  }
  return var_7 ;
}
