Leetcode ​​面试题 01.04. 回文排列​​

class Solution {
public:
    bool canPermutePalindrome(string s) {
        std::map<char,int> m;
        for(char& ch : s)
        {
            m[ch]++;
        }
        std::map<char,int>::iterator it = m.begin();
        int cnt = 0;
        while(it != m.end())
        {
            if(it->second%2!=0)
            cnt++;
            it++;
        }
        return cnt < 2;
    }
};