任意1个字符串, 一共有多少种排列组合

任意1个字符串, 一共有多少种排列组合
例如: “123” 排列组合就是: 123 132 231 213 321 312 # 6种

import itertools


class Solution():
	# 方法1:一行代码
    def func1(self, random_str):
        ret_list = sorted(list(set(map("".join, itertools.permutations(random_str)))))
        print(len(ret_list))
        return ret_list
	
	# 方法2: for循环嵌套
    def func2(self, radom_str):
        iter_obj = itertools.permutations(radom_str)
        ret_list = []
        for item_tup in iter_obj:
            item_str = ""
            for item in item_tup:
                item_str += str(item)
            ret_list.append(item_str)
        print(len(sorted(list(set(ret_list)))))
        return sorted(list(set(ret_list)))


print(Solution().func1("123"))
print(Solution().func2("123"))


# itertools中的排列和组合
s = ["99", "88", "66"]
ret1 = itertools.combinations(s, 2)  # 组合       
# [('99', '88'), ('99', '66'), ('88', '66')] 
ret2 = itertools.permutations(s, 2)  # 排列
# [('99', '88'), ('99', '66'), ('88', '99'), ('88', '66'), ('66', '99'), ('66', '88')]
print(list(ret1), list(ret2))