Question

这里给出了一个嵌套列表：

nl = [['Harsh', 20], ['Beria', 20], ['Varun', 19], ['Kakunami', 19], ['Vikas', 21]]

现在我必须通过第二个值找到嵌套列表中的第二个最低列表。并将第二个最低列表附加到另一个列表中。

所以输出应该是：

['Harsh', 20], ['Beria', 20]

我编写了以下代码，但它不起作用：

nl = [['Harsh', 20], ['Beria', 20], ['Varun', 19], ['Kakunami', 19], ['Vikas', 21]]

result=[]

temp=max(nl, key=lambda x: x[1])

largest, larger = temp[1], temp[1]
for num in nl:
    if num[1] < largest:
        largest, larger = num[1], largest
    elif num[1] < larger:
        larger = num[1]
        result.append(larger)
print(result)

Answer 1

获取总元素的min，使用有效值进行过滤，然后获得剩余的最小值并保持元素等于剩余的最小值：

from operator import itemgetter
# min of all elements
mn = min(nl, key=itemgetter(1))[1]

# remove elements equal to min
filtered = [x for x in nl if x[1] != mn]

# get min of remaining
mn_fil = min(filtered,key=itemgetter(1))[1]

# filter remaining
out = [x for x in filtered if x[1] == mn_fil]
print(out)

[['Harsh', 20], ['Beria', 20]]

适用于您的两种情况：

In [19]: nl = [['Prashant', 32], ['Pallavi', 36], ['Dheeraj', 39], ['Shivam', 40]]    
In [20]: from operator import itemgetter    
In [21]: mn = min(nl, key=itemgetter(1))[1]    
In [22]: filtered = [x for x in nl if x[1] != mn]    
In [23]: mn_fil = min(filtered,key=itemgetter(1))[1]    
In [24]: out = [x for x in filtered if x[1] == mn_fil]    
In [25]: out
Out[25]: [['Dheeraj', 36]]

使用单个for循环，如果我们找到一个较低的元素，我们会删除临时列表中的所有元素，如果我们找到并且同样低一个我们追加它：

mn = min(nl, key=itemgetter(1))[1]
temp = []
best = float("inf")
for ele in nl:
    if mn < ele[1] < best:
        best = ele[1]
        temp = []
        out.append(ele)
    elif ele[1] == best:
        temp.append(ele)
print(temp)

Answer 2

我这样做是通过使用集合找到第二个最低值，然后从列表中选择具有相同值的元素。

#ordering by value
nl.sort(key = lambda x: x[1])

values_set = set()
for value in nl:
    values_set.add(value[1])

values_list = list(values_set)
#ordering
values_list.sort()
#getting second lowest values
lowest_values = [lowest for lowest in nl if lowest[1] == values_list[1] ]

Answer 3

这是一个方便的小功能，包含heapq.nlargest：

返回包含数据集中

import heapq
num = heapq.nlargest(2, [key for item, key in nl])[-1]
print [item for item in nl if item[-1] == num] #[['Harsh', 20], ['Beria', 20]]

Answer 4

您可以尝试以下代码。很好。

lst=[['Harry',37.21],['Berry',37.21],['Tina',37.2],['Akriti',41],['Harsh',39]]
names=[]
lowest = lst[0].__getitem__(1)
second_lowest=0
for l in lst:
    if l[1] < lowest:
        second_lowest = lowest
        lowest = l[1]
    elif l[1]<=second_lowest:
        second_lowest=l[1]
for l in lst:
    if l[1]==second_lowest:
        names.append(l[0])


print(lowest)
print(second_lowest)
print(names)

Answer 5

if __name__ == '__main__':
arr = []
for _ in range(int(input())):
    name = input()
    score = float(input())
    arr1 = [name, score]
    arr.append(arr1)
arr.sort(key=lambda x: x[1])
# print(arr)
# print(min(arr,key=lambda x:x[1]))
arr.remove(min(arr,key=lambda x:x[1]))
# print(arr)
minimum = min(arr,key=lambda x:x[1])
# print(minimum[1])
a=[]
minimum = minimum[1]
for i  in arr:
    if(i[1] == minimum):
        a.append(i[0])
a.sort()
for i in a:
    print(i)

Answer 6

您的示例可以简化为：

second_lowest = sorted(set(v[1] for v in nl))[1]
result = [v for v in nl if v[1] == second_lowest]
print(result) # [['Harsh', 20], ['Beria', 20]]

我使用您的值集来查找第二个唯一的最低值。要拥有此文件，请在nl中找到与找到的值匹配的元素。

Answer 7

我遇到过类似的问题，在参考此页面后，我有了一些想法并能够解决它。

nl = [['Harsh', 20], ['Beria', 20], ['Varun', 19], ['Kakunami', 19], ['Vikas', 21]]

second = max(nl, key= lambda x: x[1])[1]
first = min(nl, key= lambda x: x[1])[1]
    
for i in range(len(nl)):
    if nl[i][1] <= second and nl[i][1] != first:
        second = nl[i][1]
    
for i in range(len(nl)):
    if second == nl[i][1]:
        print(nl[i], end=", ")

如何通过第二个值找到嵌套列表中的第二低列表？

7 个答案: