时间戳

首页 > 解决方案 > 查找嵌套列表中每个列表的最大总和，然后打印最高列表

python - 查找嵌套列表中每个列表的最大总和，然后打印最高列表

问题描述

所以我有这个任务要在嵌套列表中找到总和最高的列表，我被卡住了。到目前为止我已经尝试过：

list_1 = []
list_2 = []
total = 0
limit = int(input('Number of Lists: '))

for i in range(0,limit):
    numbs = [int(x) for x in input('Enter List: ').split()]
    list_1.append(numbs)
for y in range(0, len(list_1[0])):
    for z in range(0, len(list_1)):
        total = total + list_1[z][y]
        list_2.append(total)
print(list_1)
print(list_2)

我得到的输出：

[[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]]
[22, 48, 78]
Why is there even three values? I have four sublists

我需要的输出：

[[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]]
[6, 15, 24, 33]

标签： pythonpython-3.xsummax

解决方案

IIUC，你可以这样做for-loop：

>>> list_1 = [[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]]
>>> list_2 = [sum(l) for l in list_1]
>>> list_2
[6, 15, 24, 33]

# finding max in each list
>>> lst_mx = [max(l) for l in list_1]
>>> lst_mx
[3, 6, 9, 12]

# list have maximun sum
>>> max(list_1, key=sum)
[10, 11, 12]

您可以使用dictionary以下方法执行此操作：

>>> dct = {sum(l) : l for l in list_1}
>>> dct
{6: [1, 2, 3], 15: [4, 5, 6], 24: [7, 8, 9], 33: [10, 11, 12]}

>>> dct[max(dct)]
[10, 11, 12]

推荐阅读