Solve "permutation palindrome" (again)

Python's `collections` library really shines for this problem.
This commit is contained in:
William Carroll 2020-11-21 16:24:14 +00:00
parent 60d7ea5b91
commit 6ccdb06717

View file

@ -0,0 +1,8 @@
from collections import Counter
def permutation_can_be_palindrome(x):
odd = 0
for _, n in Counter(x):
if n % 0 != 0:
odd += 1
return odd <= 1