当前位置：网站首页>Programmer interview golden code interview question 01.04. palindrome arrangement

Programmer interview golden code interview question 01.04. palindrome arrangement

2022-07-22 19:02:00 【yijun009】

Insert picture description here 

class Solution {
    
public:
    bool canPermutePalindrome(string s) {
    
        int l = s.length();
        if ((l==2)&&(s[0]!=s[1])) return false;
        std::map<char,int> mymap;
        for (int i =0;i<l;i++) mymap[s[i]]=0;
        for (int i =0;i<l;i++) mymap[s[i]]++;
        int count_odd=0;
        for (std::map<char,int>::iterator it=mymap.begin(); it!=mymap.end(); ++it){
    
            if (it->second%2==1) count_odd++;
        }
        if (count_odd>1) return false;
        return true;
    }
};

Insert picture description here

C++ Dictionaries map, When traversing the elements in the dictionary , Be careful if you want to use it key To traverse . The program written is not consistent with the idea .

原网站

版权声明
本文为[yijun009]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/203/202207220920507730.html

边栏推荐

猜你喜欢

随机推荐