将无限长基数2 ^ 32数转换为可打印基数10的算法

def gray_code(n):
    if n == 0:
        return [0]
    elif n == 1:
        return [0, 1]
    else:
        gray_code = [0, 1]
        for i in range(2, n):
            next_code = [bit + gray_code[i-1] for bit in range(1, i)] + [gray_code[i-1]]
            gray_code.append(next_code)
        return gray_code

def convert_to_decimal(binary):
    decimal = 0
    for digit in binary:
        decimal = decimal*2 + int(digit)
    return decimal

binary_number = [1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1]
gray_code = gray_code(len(binary_number))
decimal_number = [convert_to_decimal(binary) for binary in gray_code]
print(decimal_number)