在一个位串的前面加0,在n次迭代的位串的末尾加1

好的,问题在下面的总结中:

你 是 做以下总结

full_b_tree += inc_zero

这意味着什么 full_b_tree = full_b_tree + inc_zero 这将增加 0 到最后。

你 应该 做

full_b_tree = inc_zero + full_b_tree

它将附加 零 前面,这就是你想要的。我也换了 range(n) 通过 range(n+1) 因为 range(3) 只会上升到 2 .

n = 3
bit_str = ""
for i in range(n+1): # n replaced by n+1
    if i == 0: 
        full_b_tree = "1"
        print(full_b_tree)
    else:
        inc_one = "1"
        full_b_tree += inc_one
        inc_zero = "0"
        full_b_tree = inc_zero + full_b_tree # The summation corrected
        print(full_b_tree)

1
011
00111
0001111

这应该有帮助-

N=3
bit_string = '1'
for i in range(N):
    bit_string = '0' + bit_string + '1'
    print(bit_string)

输出-

011
00111
0001111

试试这个代码:

bit_str = ""
for i in range(n+1):
    if i == 0: 
        full_b_tree = "1"
        print(full_b_tree)
    else:
        inc_one = "1"
        full_b_tree = full_b_tree+inc_one
        inc_zero = "0"
        full_b_tree = inc_zero + full_b_tree
        print(full_b_tree)

尝试以下代码:

def genBitStr(n):
    """ n: number of iteration"""
    for i in range(n):
        yield '1'.join(map(lambda e:e*i,['0', '1']))

for i, bit_str in enumerate(genBitStr(10)):
    print(i, bit_str)

0 1 1 011 2 00111 3 0001111 4 000011111 5 00000111111 6 0000001111111 7 000000011111111 8 00000000111111111 9 0000000001111111111