数据结构哈夫曼求译码

哈夫曼编码是一种用于数据压缩的编码方式，它通过将出现频率较高的字符用较短的编码表示，从而实现对数据的压缩。而哈夫曼译码则是将经过哈夫曼编码压缩后的数据进行解码，恢复为原始数据。

下面是一个演示哈夫曼译码的例子：

# 定义哈夫曼编码结构体
class HCodeType:
    def __init__(self, bit, start, ch_value):
        self.bit = bit  # 该字符的哈夫曼编码
        self.start = start  # 该编码在数组bit中的开始位置
        self.ch_value = ch_value  # 对应字符

# 哈夫曼译码函数
def huffman_decode(encoded_data, huffman_codes):
    decoded_data = ""
    current_code = ""
    for bit in encoded_data:
        current_code += bit
        for code in huffman_codes:
            if current_code == code.bit[code.start:code.start+len(current_code)]:
                decoded_data += code.ch_value
                current_code = ""
                break
    return decoded_data

# 示例数据
encoded_data = "101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010110001101101001011000110110100101100011011010010