Palindrome Permutation

Given a string, determine if a permutation of the string could form a palindrome.

Example 1:

Input: "code" Output: false

Example 2:

Input: "aab" Output: true

Example 3:

Input: "carerac" Output: true

 

class Solution {
public:
    bool canPermutePalindrome(string s) {
        map<char, int> hmap;
        for(int i = 0; i < s.length(); i++)
        {
            char ch = s.at(i);
            if(hmap.find(ch) != hmap.end())
            {
                hmap.erase(ch);
            }
            else
            {
                hmap[ch] = 1;
            }
        }
        return hmap.size() <= 1;
    }
};