几乎递增序列编码问题

import heapq

def huffman_encoding(data):
    freq = {}
    for char in data:
        if char in freq:
            freq[char] += 1
        else:
            freq[char] = 1
    
    heap = [[weight, [char, ""]] for char, weight in freq.items()]
    heapq.heapify(heap)
    
    while len(heap) > 1:
        lo = heapq.heappop(heap)
        hi = heapq.heappop(heap)
        for pair in lo[1:]:
            pair[1] = '0' + pair[1]
        for pair in hi[1:]:
            pair[1] = '1' + pair[1]
        heapq.heappush(heap, [lo[0] + hi[0]] + lo[1:] + hi[1:])
    
    huffman_code = dict(heapq.heappop(heap)[1:])
    encoded_data = ''.join(huffman_code[char] for char in data)
    return encoded_data, huffman_code

def almost_increasing_sequence_encode(seq):
    diffs = [seq[i+1] - seq[i] for i in range(len(seq) - 1)]
    encoded_diffs, _ = huffman_encoding(diffs)
    return encoded_diffs

# 示例使用
original_seq = [1, 2, 4, 5, 7, 8, 10]
encoded_result = almost_increasing_sequence_encode(original_seq)
print("Encoded Result:", encoded_result)