comefrom: <awangdev>String Permutation_1.java
code: public boolean Permutation(String A, String B) {
          if (A == null || B == null || A.length() != B.length()) {
              return false;
          }
          final Map<Character, Integer> strMap = new HashMap<>();
          for (int i = 0; i < A.length(); i++) {
              final char charA = A.charAt(i);
              final char charB = B.charAt(i);
              if (!strMap.containsKey(charA)) {
                  strMap.put(charA, 0);
              }
              strMap.put(charA, strMap.get(charA) + 1);
              if (!strMap.containsKey(charB)) {
                  strMap.put(charB, 0);
              }
              strMap.put(charB, strMap.get(charB) - 1);
          }
          for (Map.Entry<Character, Integer> entry : strMap.entrySet()) {
              if (entry.getValue() != 0) {
                  return false;
              }
          }
          return true;
      }
masked: public boolean var_0 ( String var_1 , String var_2 ) {
    if ( var_1 == null || var_2 == null || var_1 . length ( ) != var_2 . length ( ) ) {
      return false ;
    }
    final Map < Character , Integer > var_3 = new HashMap < > ( ) ;
    for ( int var_4 = 0 ;
    var_4 < var_1 . length ( ) ;
    var_4 ++ ) {
      final char var_5 = var_1 . charAt ( var_4 ) ;
      final char var_6 = var_2 . charAt ( var_4 ) ;
      if ( ! var_3 . containsKey ( var_5 ) ) {
        var_3 . put ( var_5 , 0 ) ;
      }
      var_3 . put ( var_5 , var_3 . get ( var_5 ) + 1 ) ;
      if ( ! var_3 . containsKey ( var_6 ) ) {
        var_3 . put ( var_6 , 0 ) ;
      }
      var_3 . put ( var_6 , var_3 . get ( var_6 ) - 1 ) ;
    }
    for ( Map . Entry < Character , Integer > var_7 : var_3 . entrySet ( ) ) {
      if ( var_7 . getValue ( ) != 0 ) {
        return false ;
      }
    }
    return true ;
  }
  