使用嵌套列表索引列表

Question

我有一个频率列表（即 freq_lst），需要通过嵌套列表检索才能进行计算。使用freq_lst和r_freq进行计算，如下图所示：

freq_lst = [0.03571429, 0.03571429, 0.07142857, 0.07142857, 0.10714286, 0.07142857, 0.07142857, 0.03571429, 0.07142857, 0.03571429, 0.03571429, 0.03571429, 0.07142857, 0.03571429, 0.03571429, 0.03571429, 0.03571429, 0.03571429, 0.03571429, 0.03571429]

nested_lst = [['R0','F1','F3','F5','F7','F9','F10'],
['R1','F0','F4','F7','F10','F16'],
['R2','F6','F7','F9','F13','F17','F18'],
['R3','F2','F8','F10','F18','F19'],
['R4','F10','F11','F12','F14','F15','F16']]

r_lst = ['R0','R1','R2','R3','R4']
r_freq = [0.1, 0.2, 0.2, 0.2, 0.3]

def mating_func():
    mating = []
    for k in range(len(r_lst)):
        for k1 in range(len(nested_lst)):
            zgt = 0
            if r_lst[k] == nested_lst[k1][0]:        
                print(freq_lst.index(nested_lst[k1][k2+1] for k2 in range(len(nested_lst[k1]))))
                zgt += r_freq[k] * freq_lst.index(nested_lst[k1][k2+1] for k2 in range(len(nested_lst[k1])))
        mating.append(zgt)
    return mating

但是它没有获取频率，而是只打印了以下内容：

<generator object mating_func.<locals>.<genexpr> at 0x0000020C1D1A8620>
<generator object mating_func.<locals>.<genexpr> at 0x0000020C1D1A8620>
<generator object mating_func.<locals>.<genexpr> at 0x0000020C1D1A8620>
<generator object mating_func.<locals>.<genexpr> at 0x0000020C1D1A8620>
<generator object mating_func.<locals>.<genexpr> at 0x0000020C1D1A8620>

我也试过以下方法：

(nested for-loops shown as before)
for k2 in range(len(nested_lst[k1])):
    if rnase_list[k] == zygotes[k1][0]
        zgt += r_freq[k] * freq_lst.index(nested_lst[k1][k2+1])

出现以下错误：

ValueError: 'F1' is not in list

Answer 1

这是您要找的吗：

mating = []
for k in range(len(r_lst)):
    for k1 in range(len(nested_lst)):
        if r_lst[k] == nested_lst[k1][0]:
            zgt = 0
            zgt+= sum([r_freq[k] * freq_lst[x] for x in [int(i[1:]) for i in nested_lst[k1][1:]]])
    mating.append(zgt)

输出：

[0.028571430000000002,
 0.05000000400000001,
 0.05000000400000001,
 0.050000002,
 0.07500000600000001]

Answer 2

mating = []
for k in range(len(r_lst)):
    for lst in nested_lst:
        if r_lst[k] == lst[0]:
            zgt = 0
            zgt+= sum([r_freq[k] * freq_lst[int(i[1:])] for i in lst[1:]])
    mating.append(zgt)

请允许我稍微简化一下。

使用嵌套列表索引列表

Index a list using a nested list

python

simulation

recursion

nested-lists

genetic-algorithm