我应该编写一个程序,它接受一串二进制代码和一个数字,并输出原始字符串的汉明距离内的所有字符串。我有一个可以执行所有操作的函数,但在输出中存在列表中的列表。我明白为什么会这样 - 该函数是递归的,有时它会返回可能值的列表。

问题是,我不知道如何更改它以便它输出完整的字符串。例如,对于字符串“0000”和汉明距离“2”,我得到:[“1['100','010','001']”,“01['10','01']”,“001['1']”]

但我想要的是:

1100
1010
1001
0110
0101
0011

代码如下:

def hamming(num, dist):
    if dist == 0:
        return num
    else:
        outputlist = list()
        for item in range(len(num)):
            if len(num[item:]) > dist - 1:
                if num[item] == "0":
                    restoflist = hamming(num[item + 1:], dist - 1)
                    outputlist.append(num[:item] + "1" + str(restoflist))
                else:
                    restoflist = hamming(num[item + 1:], dist - 1)
                    outputlist.append(num[:item] + "0" + str(restoflist))                
        return outputlist
有帮助吗?

解决方案

如果您循环遍历返回的列表 hamming 您应该能够以正确的方式将字符串附加在一起 ​​- 像这样:

def hamming(num, dist):
    if dist == 0:
        return num
    else:
        outputlist = list()
        for item in range(len(num)):
            if len(num[item:]) > dist - 1:
                if num[item] == "0":
                    restoflist = hamming(num[item + 1:], dist - 1)
                    if type(restoflist) is not str
                        for rest in restoflist:
                            outputlist.append(num[:item] + "1" + str(rest))
                    else
                        outputlist.append(num[:item] + "1" + str(restoflist))
                else:
                    restoflist = hamming(num[item + 1:], dist - 1)
                    if type(restoflist) is not str
                        for rest in restoflist:
                            outputlist.append(num[:item] + "0" + str(rest))
                    else
                        outputlist.append(num[:item] + "0" + str(restoflist))                
    return outputlist

其他提示

您可以通过返回来修复它 [num] 比较起来 num 在基本情况和一般情况下,使用以下方式组合递归调用的结果 mapextend 而不是 append:

def hamming(num, dist):
    if dist == 0:
        return [num]
    else:
        outputlist = list()
        for item in range(len(num)):
            if len(num[item:]) > dist - 1:
                if num[item] == "0":
                    restoflist = hamming(num[item + 1:], dist - 1)
                    outputlist.extend(map(lambda x: num[:item] + "1" + x, restoflist))
                else:
                    restoflist = hamming(num[item + 1:], dist - 1)
                    outputlist.extend(map(lambda x: num[:item] + "0" + x, restoflist))                
        return outputlist

>>> hamming('0000', 2)
['1100', '1010', '1001', '0110', '0101', '0011']
>>> 
许可以下: CC-BY-SA归因
不隶属于 StackOverflow
scroll top