简单Huffman编码求解器

该Huffman编码求解器可以输入Huffman编码的分布a和元数base，输出对应的Huffman编码以及平均Huffman编码的长度

import copy
import math
a=[0.16,0.14,0.13,0.12,0.10,0.09,0.08,0.07,0.06,0.05]##在这里输入需要求Huffman编码的分布a

##checker
sum=0
for i in a:
    sum+=i
if(sum!=1):
    print("输入可能出现错误，和不为1")

#setting for base number, default=3
base=3##在这里输入需要求Huffman编码的元数

#Huffman Coding
a.sort(reverse=True)
mema=copy.deepcopy(a)
k=len(a)
dk=k
s=(k-1)%(base-1)+1
temp_parent=[[]]*k##记录每个a中概率值当前对应的节点列表
for i in range(k):
    temp_parent[i]=[i]
flag=k
temp_code=[""]*k
while flag>1:
    tempflag=flag-s
    sum=0
    b=[]
    print(s, tempflag, flag)
    for i in range(tempflag,flag):
        sum+=a[tempflag]
        for j in temp_parent[i]:
            temp_code[j]=str(i-tempflag)+temp_code[j]
        b=b+temp_parent[i]
    temp_parent[tempflag]=b
    a[tempflag]=sum
    s=base
    flag=tempflag
    a=a[:flag+1]
    k=0
    temp=a[flag]
    temppar=temp_parent[flag]
    while(k<flag):
        if a[k]<temp:
            break
        k=k+1
    a[k+1:]=a[k:-1]
    temp_parent[k+1:]=temp_parent[k:-1]
    a[k]=temp
    temp_parent[k]=temppar
    flag=flag+1

print("Huffman Coding:")
avg=0
for i in range(dk):
    print(mema[i],":",temp_code[i])
    avg=avg+mema[i]*len(temp_code[i])
print("avglen:",avg)