java 266. Palindrome Permutation（1st）.java

Posted 2021-05-08

public class Solution {
    public boolean canPermutePalindrome(String s) {
        Set<Character> set = new HashSet<Character>();
        for(int i = 0; i < s.length(); i++) {
            char temp = s.charAt(i);
            if(!set.add(temp)) {
                set.remove(temp);
            }
        }
        return set.size() == 0 || set.size() == 1;
    }
}

public class Solution {
    public boolean canPermutePalindrome(String s) {
        int []cnt=new int[128];
        char []ss=s.toCharArray();
        int n = ss.length,odd=0;
        for(char c:ss)
            cnt[c]++;
        for(int i=0;i<128;++i){
            if((cnt[i]&0x1)!=0)
                odd++;
            if(odd>1)
                return  false;
        }
        return true;
    }
}