简体   繁体   English

在python字典列表中仅选择最大值

[英]Selecting only max value in python list of dicts

I have a list of dicts as follows: 我有以下字典列表:

[{"server":"8.8.8.8", 
  "domains":[{"google.com":[{"time":15, "serial":14}, {"time":78, "serial":14}]},
             {"intuit.com":[{"time":20, "serial":23}, {"time":91, "serial":18}]}
            ]
},
{"server":"8.8.4.4", 
 "domains":[{"google.com":[{"time":19, "serial":45}, {"time":92, "serial":76}]},
            {"intuit.com":[{"time":45, "serial":89}, {"time":93, "serial":74}]}
           ]
},
{"server":"206.67.222.222", 
 "domains":[{"google.com":[{"time":98, "serial":76}, {"time":64, "serial":54}]},
            {"intuit.com":[{"time":43, "serial":21}, {"time":65, "serial":59}]}
           ]
}]

How would I go about creating a structure where I select only the dict for each domain with the max serial number and when I have the same serial number, select the max time so that I am left with the following: 我将如何创建一个结构,在该结构中,我仅选择具有最大序列号的每个域的字典,而当我具有相同的序列号时,选择最大时间,以便剩下以下内容:

[{"server":"8.8.8.8", 
  "domains":[{"google.com":{"time":78, "serial":14}},
             {"intuit.com":{"time":20, "serial":23}}
            ]
 },
 {"server":"8.8.4.4", 
  "domains":[{"google.com":{"time":92, "serial":76}},
             {"intuit.com":{"time":45, "serial":89}}
            ]
 },
 {"server":"206.67.222.222", 
  "domains":[{"google.com":{"time":98, "serial":76}},
             {"intuit.com":{"time":65, "serial":59}}
            ]
 }]

Try this (d is your dict): 试试这个(d是您的字典):

for item in d:
    for i in item["domains"]:
        for k, v in i.items():
            c = sorted([(j["time"], j["serial"]) for j in v], key=lambda x: (x[1], x[0]))
            i[k] = {"time": c[-1][0], "serial": c[-1][1]}

print d

The solution using built-in max() function: 使用内置的max()函数的解决方案:

import json

# l is your initial list of dicts
for item in l:
    for d in item['domains']:
        for k, v in d.items():
            # whether `serial` numbers are unique 
            has_uniq_serial = len(set([i['serial'] for i in v])) > 1
            d[k] = max(v, key=lambda o: o['serial']) if has_uniq_serial else max(v, key=lambda o: o['time'])

# `json.dumps` used for pretty printing of nested dicts
print(json.dumps(l, indent=4))

The output: 输出:

[
    {
        "server": "8.8.8.8",
        "domains": [
            {
                "google.com": {
                    "serial": 14,
                    "time": 78
                }
            },
            {
                "intuit.com": {
                    "serial": 23,
                    "time": 20
                }
            }
        ]
    },
    {
        "server": "8.8.4.4",
        "domains": [
            {
                "google.com": {
                    "serial": 76,
                    "time": 92
                }
            },
            {
                "intuit.com": {
                    "serial": 89,
                    "time": 45
                }
            }
        ]
    },
    {
        "server": "206.67.222.222",
        "domains": [
            {
                "google.com": {
                    "serial": 76,
                    "time": 98
                }
            },
            {
                "intuit.com": {
                    "serial": 59,
                    "time": 65
                }
            }
        ]
    }
]

You can sort your time-serial list for each domain by your requirement and get the first one, let variable data be your input list: 您可以根据需要对每个域的时间序列列表进行排序,并获得第一个域,将变量data作为输入列表:

def domain_sorter(d):
    def compare(x, y):
        k = y['serial'] - x['serial']
        j = y['time'] - x['time']

        return k if k != 0 else j
    return sorted(d, cmp=compare)

def filter_domain(domain):
    for k, v in domain.items():
        return {
            k: domain_sorter(v)[0]
        }

print [{
    "server": e['server'],
    "domains": [filter_domain(domain) for domain in e['domains']]
} for e in data]

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM