comefrom: <awangdev>266. Palindrome Permutation_2.java
code: public boolean canPermutePalindrome(String s) {
          if (s == null || s.length() == 0) {
              return true;
          }
          HashMap<String, Integer> map = new HashMap<String, Integer>();
          for (int i = 0; i < s.length(); i++) {
              String str = s.charAt(i) + "";
              if (!map.containsKey(str)) {
                  map.put(str, 1);
              } else {
                  map.put(str, map.get(str) + 1);
              }
          }
          int countOdd = 0; 
          for (HashMap.Entry<String, Integer> entry : map.entrySet()) {
              if (entry.getValue() % 2 == 1) {
                  countOdd++;
              }
              if (countOdd > 1) {
                  return false;
              }
          }
          return true;
      }
masked: public boolean var_0 ( String var_2 ) {
    if ( var_2 == null || var_2 . length ( ) == 0 ) {
      return true ;
    }
    HashMap < String , Integer > var_8 = new HashMap < String , Integer > ( ) ;
    for ( int var_9 = 0 ;
    var_9 < var_2 . length ( ) ;
    var_9 ++ ) {
      String var_12 = var_2 . charAt ( var_9 ) + "" ;
      if ( ! var_8 . containsKey ( var_12 ) ) {
        var_8 . put ( var_12 , 1 ) ;
      }
      else {
        var_8 . put ( var_12 , var_8 . get ( var_12 ) + 1 ) ;
      }
    }
    int var_17 = 0 ;
    for ( HashMap . Entry < String , Integer > var_19 : var_8 . entrySet ( ) ) {
      if ( var_19 . getValue ( ) % 2 == 1 ) {
        var_17 ++ ;
      }
      if ( var_17 > 1 ) {
        return false ;
      }
    }
    return true ;
  }
  