<awangdev>266. Palindrome Permutation_1.java
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;
    }
public boolean var_0 ( String var_2 ) {
  if ( var_2 == null || var_2 . length ( ) == 0 ) return false ;
  int [ ] var_7 = new int [ 256 ] ;
  for ( char var_9 : var_2 . toCharArray ( ) ) var_7 [ var_9 ] ++ ;
  int var_10 = 0 ;
  for ( int var_11 = 0 ;
  var_11 < var_7 . length ;
  var_11 ++ ) {
    var_10 += var_7 [ var_11 ] % 2 ;
    if ( var_10 > 1 ) return false ;
  }
  return true ;
}
