comefrom: <awangdev>266. Palindrome Permutation_1.java
code: public boolean canPermutePalindrome(String s) {
          if (s == null || s.length() == 0) return false;
          int[] chars = new int[256];
          for (char c : s.toCharArray()) chars[c]++;
          int countOdd = 0;
          for (int i = 0; i < chars.length; i++) {
              countOdd += chars[i] % 2;
              if (countOdd > 1) return false;
          }
          return true;
      }
masked: public boolean var_0 ( String var_1 ) {
    if ( var_1 == null || var_1 . length ( ) == 0 ) return false ;
    int [ ] var_2 = new int [ 256 ] ;
    for ( char var_3 : var_1 . toCharArray ( ) ) var_2 [ var_3 ] ++ ;
    int var_4 = 0 ;
    for ( int var_5 = 0 ;
    var_5 < var_2 . length ;
    var_5 ++ ) {
      var_4 += var_2 [ var_5 ] % 2 ;
      if ( var_4 > 1 ) return false ;
    }
    return true ;
  }
  