【算法基础】排列组合算例

import numpy as np
d={}
for i in range(26):
    d[i+1]=chr(97+i)

from itertools import product  
from itertools import combinations  
import itertools  

d={}
for i in range(26):
    d[i+1]=chr(97+i)

def func1(num_list):   
    res_list=[]  
    for i in range(len(num_list)+1):  
        res_list+=list(combinations(num_list, i))   
    return res_list

def fun2(digit):
    l=list(str(digit))
    l1=func1(l)
    ss=set(l1)
    l2=[]
    for s in ss:
        if not s or len(set(s))==1:
            continue
        else:
            l3=[]
            for  i in s:
                m=int(i)
                n=d[m]
                l3.append(str(n))
            elem=''.join(l3)
            l2.append(elem)
    return l2

digit=1213
print(fun2(digit))