python哈夫曼压缩与解压算法

python哈夫曼压缩与解压算法

压缩

#encoding: utf-8
from bitarray import bitarray
import random
import json

class Node(object):
	"""docstring for Node"""
	left=None
	right=None
	times=0
	char = ''
	parent=None
	def __init__(self):
		super(Node, self).__init__()
# 获取带有权重的字符 的字典
def countTimes(str):
	times = {
   }
	for i in range(0,len(str)):
		if (not str[i] in times):
			times[str[i]]=1
		else:
			times[str[i]]+=1
	return sorted(times.items(),key = lambda x:x[1])

# 将带有次数以及字符的数据转换成一颗树
def getTree(data):
	temp=data[:]
	head= None  #拿到 head 就相当于拿到了整棵树
	nodes = []
	# 都变成 Node
	for x in temp:
		tempNode = Node()
		tempNode.char = x[0]
		tempNode.times = x[1]
		nodes.append(tempNode)
	while len(nodes)>=2:
		# 需要把nodes都排序好，然后再操作第1,2个，因为是他们最小
		nodes = sorted(nodes,key= lambda x:x.times)
		nums = nodes[