Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update check_permutation_strings_is_palindrome.py

Browse Source
This commit is contained in:
marina 2023-08-07 17:29:58 -07:00 committed by GitHub
parent b81ccd579b
commit 2fe4c94c7f
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
arrays_and_strings/check_permutation_strings_is_palindrome.py
View File

@ -2,8 +2,6 @@
# -*- coding: utf-8 -*- # -*- coding: utf-8 -*-
# author: bt3gl # author: bt3gl
# given a string, write a function to check if it's a permutation of palindromes
def is_permutation_of_palindromes(some_string): def is_permutation_of_palindromes(some_string):
@ -11,27 +9,13 @@ def is_permutation_of_palindromes(some_string):
for c in some_string.strip(): for c in some_string.strip():
# note: you could use a Counter dict here
if c in aux_dict.keys(): if c in aux_dict.keys():
aux_dict[c] -= 1 aux_dict[c] -= 1
else: else:
aux_dict[c] = 1 aux_dict[c] = 1
for v in aux_dict.values(): for v in aux_dict.values():
if v != 0: if v != 0:
return False return False
else:
return True return True
if __name__ == "__main__":
string1 = "abba"
string2 = "ab f ab"
string3 = "e f ba"
assert(is_permutation_of_palindromes(string1) == True)
assert(is_permutation_of_palindromes(string2) == True)
assert(is_permutation_of_palindromes(string3) == False)