回文排列——python

class Solution(object):
    def canPermutePalindrome(self, s):
        """
        :type s: str
        :rtype: bool
        """
        length=len(s)
        word=dict()
        for i in s:
            if i in word:
                word[i]+=1
            else:
                word[i]=1
        word_val=list(word.values())
        odd=0
        for val in word_val:
            if val%2==1:
                odd+=1
                if odd>1:
                    return False
        return True

s=Solution()
word="aabbccc"
res=s.canPermutePalindrome(word)
print(res)