Lintcode 916. Palindrome Permutation (Easy) (Python)

最新推荐文章于 2022-11-05 20:02:18 发布

2Young2Simple

最新推荐文章于 2022-11-05 20:02:18 发布

阅读量164

点赞数

文章标签： Lintcode Python

本文链接：https://blog.csdn.net/weixin_41677877/article/details/81275410

版权

Palindrome Permutation

Description:

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

Example

Given s = “code”, return False.
Given s = “aab”, return True.
Given s = “carerac”, return True.

Code:

class Solution:
    """
    @param s: the given string
    @return: if a permutation of the string could form a palindrome
    """
    def canPermutePalindrome(self, s):
        # write your code here
        dic = {}
        for i in range(len(s)):
            dic[s[i]] = dic[s[i]]+1 if s[i] in dic else 1
        numOfOne = 0
        for i in dic:
            if dic[i]%2 == 1:
                numOfOne += 1
            if numOfOne > 1:
                return False
        return True