comefrom: <awangdev>Longest Substring Without Repeating Characters_1.java
code: public int lengthOfLongestSubstring(String s) {
          if (s == null || s.length() == 0) {
              return 0;
          }
          boolean[] chars = new boolean[256]; 
          int rst = 0;
          int start = 0;
          int end = 0;
          while (start < s.length()) {
              while (end < s.length() && !chars[s.charAt(end)]) {
                  chars[s.charAt(end)] = true;
                  rst = Math.max(rst, end - start + 1);
                  end++;
              }
              chars[s.charAt(start)] = false;
              start++;
          }
          return rst;
      }
masked: public int sample_funcname ( String var_1 ) {
    if ( var_1 == null || var_1 . length ( ) == 0 ) {
      return 0 ;
    }
    boolean [ ] var_7 = new boolean [ 256 ] ;
    int var_8 = 0 ;
    int var_9 = 0 ;
    int var_10 = 0 ;
    while ( var_9 < var_1 . length ( ) ) {
      while ( var_10 < var_1 . length ( ) && ! var_7 [ var_1 . charAt ( var_10 ) ] ) {
        var_7 [ var_1 . charAt ( var_10 ) ] = true ;
        var_8 = Math . max ( var_8 , var_10 - var_9 + 1 ) ;
        var_10 ++ ;
      }
      var_7 [ var_1 . charAt ( var_9 ) ] = false ;
      var_9 ++ ;
    }
    return var_8 ;
  }
  