蓝桥杯真题（python）——不同子串（填空题）

蓝桥杯真题（python）——不同子串

一个字符串的非空子串是指字符串中长度至少为 1 的连续的一段字符组成 的串。例如，字符串aaab 有非空子串a, b, aa, ab, aaa, aab, aaab，一共 7 个。 注意在计算时，只算本质不同的串的个数。

请问，字符串0100110001010001 有多少个不同的非空子串？

解题思路：子串长度有1，2，3，4…，字符串长度，依次在不同长度下从左到右取相同长度的值即可

chars="0100110001010001 "
b=set()
length=len(chars)
for j in range(length):
    for i in range(length):
        if i+j<length:
            b.add(chars[i:i+j])
#print(b)
print(len(b)-1)#set集合会计算一个空的字符串所以减去1

{’’, ‘0001010001’, ‘10011000’, ‘00110001010001’, ‘0100110’, ‘0101’, ‘000101000’, ‘00’, ‘01100010100’, ‘01100’, ‘11’, ‘11000101’, ‘1100010100’, ‘011’, ‘0110001010’, ‘10001010001’, ‘001100’, ‘01001100010100’, ‘01000’, ‘00110’, ‘00110001’, ‘10001010’, ‘011000’, ‘1000101000’, ‘1’, ‘0010100’, ‘1100’, ‘010’, ‘0010’, ‘010100’, ‘010011000101000’, ‘110001010’, ‘001010001’, ‘100110001010’, ‘100’, ‘10001’, ‘01010’, ‘0110’, ‘0011000101’, ‘1001100010’, ‘001010’, ‘10’, ‘00101000’, ‘10011000101000’, ‘01001100010’, ‘100010’, ‘10011’, ‘0001010’, ‘000101’, ‘1001100’, ‘100110001’, ‘100110’, ‘1000101’, ‘0’, ‘110’, ‘01001’, ‘010011’, ‘0110001010001’, ‘101000’, ‘01100010’, ‘01’, ‘10100’, ‘001100010’, ‘100010100’, ‘11000101000’, ‘011000101000’, ‘101’, ‘000’, ‘001100010100’, ‘0011000101000’, ‘01001100’, ‘00101’, ‘10011000101’, ‘0100110001010’, ‘1010’, ‘1100010’, ‘010011000’, ‘011000101’, ‘0100110001’, ‘0100110001010001’, ‘0110001’, ‘1010001’, ‘0011000’, ‘0011’, ‘010001’, ‘00010100’, ‘0101000’, ‘001’, ‘00110001010’, ‘0100’, ‘01010001’, ‘1001100010100’, ‘100110001010001’, ‘010011000101’, ‘00010’, ‘110001’, ‘1001’, ‘110001010001’, ‘11000’, ‘1000’, ‘0001’}
100