Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation could be form. 先用map來整理出所有char的個數，檢查一下char是否有兩個以上的奇數，若是的話 ...
# A permutation refers to an arrangement of elements. e.g. [3, 2, 1] is a permutation of [1, 2, 3] and vice-versa. # The NumPy Random module provides two methods for this: shuffle() and permutation().
Some results have been hidden because they may be inaccessible to you
Show inaccessible results