comefrom: <awangdev>Longest Substring Without Repeating Characters_2.java
code: public int lengthOfLongestSubstring(String s) {
          if (s == null || s.length() == 0) {
              return 0;
          }
          HashMap<Character, Integer> map = new HashMap<>();
          char[] arr = s.toCharArray();
          int rst = Integer.MIN_VALUE;
          for (int i = 0; i < arr.length; i++) {
              char c = arr[i];
              if (map.containsKey(c)) {
                  i = map.get(c); 
                  map = new HashMap<>();
              } else {
                  map.put(c, i);
              }
              rst = Math.max(rst, map.size());
          }
          return rst == Integer.MIN_VALUE ? 0 : rst;
      }
masked: public int sample_funcname ( String var_1 ) {
    if ( var_1 == null || var_1 . length ( ) == 0 ) {
      return 0 ;
    }
    HashMap < Character , Integer > var_8 = new HashMap < > ( ) ;
    char [ ] var_10 = var_1 . toCharArray ( ) ;
    int var_12 = Integer . MIN_VALUE ;
    for ( int var_13 = 0 ;
    var_13 < var_10 . length ;
    var_13 ++ ) {
      char var_14 = var_10 [ var_13 ] ;
      if ( var_8 . containsKey ( var_14 ) ) {
        var_13 = var_8 . get ( var_14 ) ;
        var_8 = new HashMap < > ( ) ;
      }
      else {
        var_8 . put ( var_14 , var_13 ) ;
      }
      var_12 = Math . max ( var_12 , var_8 . size ( ) ) ;
    }
    return var_12 == Integer . MIN_VALUE ? 0 : var_12 ;
  }
  