wllllllll

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(S):
    data = []
    for i in S:
        data.append(i)

    if not data:
        None
    def find(li,u):
        if len(path) == len(li):
            ans.append(path[:])
            return 
        for i in range(0,len(li)):
            if not u[i]:
                if i > 0 and li[i] == li[i-1] and not u[i-1]:
                    continue
                u[i] = 1
                path.append(li[i])
                find(li,u)
                path.pop()
                u[i] = 0
    ans = []
    path = []
    use = [0]*len(data)
    find(sorted(data),use)

    result_0 = []
    for i in ans:
        re = ''
        for j in i:
            re += str(j)
        result_0.append(re) # 所有排列str

    result_1 = []
    for k in result_0:
        for i in range(len(k)):
            for j in range(len(k) - i):
                result_1.append(k[j:j+i+1])
    priny(result_1)
    result = [] # 回文排列
    def tf_huiwen(s):
        if str(s) == str(s)[::-1]:	#str[::-1]表示字符串反转
            result.append(int(s))
    for i in result_i:
        tf_huiwen(i)
        print(result)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48