comefrom: <qiyuangong>003_Longest_Substring_Without_Repeating_Characters_1.java
code: 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; 
       }
masked: public int sample_funcname ( String var_0 ) {
    boolean [ ] var_1 = new boolean [ 256 ] ;
    int var_2 = 0 , var_3 = 0 ;
    for ( int var_4 = 0 ;
    var_4 < var_0 . length ( ) ;
    var_4 ++ ) {
      while ( var_1 [ var_0 . charAt ( var_4 ) ] ) {
        var_1 [ var_0 . charAt ( var_2 ) ] = false ;
        var_2 ++ ;
      }
      var_1 [ var_0 . charAt ( var_4 ) ] = true ;
      var_3 = Math . max ( var_4 - var_2 + 1 , var_3 ) ;
    }
    return var_3 ;
  }
  