如何更有效地获得最小项目？

Question

我有一个列表包括像(id, cost, clicks, views)这样的元组项目，如下所示：

statistic_data_list = [(12324, 9, 6, 9), (12325, 11, 5, 3), (12326, 10, 7, 2)] 

我希望得到符合以下条件的项目ID：

• 1当并非所有项目的cost都等于0时，得到cost最低的项目ID。
• 2当项目的所有cost等于0时，如果不是项目的所有clicks都等于0，则得到clicks最低的项目id。
• 3当项目的所有clicks等于0时，如果不是项目的所有views都等于0，则得到views最低的项目id。

# (1)
#  input:  
[(12324, 9, 6, 9), (12325, 11, 5, 3), (12326, 10, 7, 2)]
#  expected result: 
12324 # (whose cost is lowest) 

# (2)
#  input:  
[(12324, 0, 6, 9), (12325, 0, 5, 3), (12326, 0, 7, 2)]
#  expected result:
12325 #  (whose clicks is lowest when all cost is 0)

# (3)
#  input:  
[(12324, 0, 0, 9), (12325, 0, 0, 3), (12326, 0, 0, 2)]
#  expected result: 
12326  #  (whose views is lowest when all cost is 0 also clicks)

如何更有效地获取指定项目的ID？

# My attemp so far

cost_clicks_views_list = [(12324, 9, 6, 9), (12325, 11, 5, 3), (12326, 10, 7, 2)]

len_cost_not_0 = len(list(filter(lambda item: item[1], cost_clicks_views_list)))
len_clicks_not_0 = len(list(filter(lambda item: item[2], cost_clicks_views_list)))
len_views_not_0 = len(list(filter(lambda item: item[3], cost_clicks_views_list)))


if len_cost_not_0:
    min_cost_id_list = [ item[0] for item in cost_clicks_views_list if item[1]==min([i[1] for i in cost_clicks_views_list]) ]
    print(min_cost_id_list) # [(12324]

else:
    if len_clicks_not_0:
        min_clicks_id_list = [item[0] for item in cost_clicks_views_list if item[2] == min([i[2] for i in cost_clicks_views_list])]
        print(min_clicks_id_list) # [(12325]

    else:
        if len_views_not_0:
            min_views_id_list = [item[0] for item in cost_clicks_views_list if item[3] == min([i[3] for i in cost_clicks_views_list])]
            print(min_views_id_list)  # [12326]

任何评论都非常受欢迎。十分感谢。

Answer 1

您可以使用列表推导来检查这些。当所有项目中至少有一个cost不等于零时，要获得id最低的项目cost，请尝试：

sdl = [(12324, 10, 0.6, 9), (12325, 11, 0.5, 3), (12326, 10, 0.7, 2)]
a = [j[0] for j in sdl if j[1]==min([k[1] for k in sdl if all([True if i[1] != 0 else False for i in sdl])])]

输出：

a = [12324, 12326]

这里所有三个项目都有非零cost和最低成本是10对应的有两个id 12324和12326。