LeetCode #266: Palindrome Permutation
β’ 86 words β’ 1 min β’ updated
LeetCode #266: Palindrome Permutation:
python
from collections import Counter
class Solution:
def canPermutePalindrome(self, s: str) -> bool:
c = Counter(s)
# only up to one odd count
return len([v for v in c.values() if v & 1]) <= 1With defaultdict instead of Counter:
python
from collections import defaultdict
class Solution:
def canPermutePalindrome(self, s: str) -> bool:
d = defaultdict(int)
for c in s:
d[c] += 1
# only up to one odd count
return len([v for v in d.values() if v & 1]) <= 1