Question

我想创建一个包含公共密钥及其值总和的finalDic

myDic = [{2:1, 3:1, 5:2}, {3:4, 6:4, 2:3}, {2:5, 3:6}, ...]

首先找到公共密钥

commonkey = [{2:1, 3:1}, {2:3, 3:4}, {2:5, 3:6}]

然后按其值排序和排序

finalDic= {3:11, 2,9}

我试过这个，甚至没有关闭我想要的东西

import collections

myDic = [{2:1, 3:1, 5:2}, {3:4, 6:4, 2:3}, {2:5, 3:6}]

def commonKey(x):
    i=0
    allKeys = []
    while i<len(x):
        for key in x[0].keys():
            allKeys.append(key)
        i=i+1
    commonKeys = collections.Counter(allKeys)
    commonKeys = [i for i in commonKeys if commonKeys[i]>len(x)-1]
    return commonKeys

print commonKey(myDic)

由于

Answer 1

以下是我的表现：

my_dict = [{2:1, 3:1, 5:2}, {3:4, 6:4, 2:3}, {2:5, 3:6}]

# Finds the common keys
common_keys = set.intersection(*map(set, my_dict))

# Makes a new dict with only those keys and sums the values into another dict
summed_dict = {key: sum(d[key] for d in my_dict) for key in common_keys}

或者作为一个疯狂的单行：

{k: sum(d[k] for d in my_dict) for k in reduce(set.intersection, map(set, my_dict))}

Answer 2

只有一些指示：

从每个目录获取密钥，然后将它们转换为set（）并计算 intersection（）或所有键集。这将为您提供公共密钥。
现在迭代原始数据并总结每个字典的匹配值很直接

实施留给OP作为练习。

Answer 3

l = [{2:1, 3:1, 5:2}, {3:4, 6:4, 2:3}, {2:5, 3:6}]

new_dict = {}

def unique_key_value(a,b):
    return set(a).intersection(set(b))

def dict_sum(k, v):
    if k not in new_dict.keys():
        new_dict[k] = v
    else:
        new_dict[k] = new_dict[k] + v

for i in reduce(unique_key_value, l):
    for k in l:
        if i in k.keys():
            dict_sum(i, k[i])

print new_dict

希望这会有所帮助。：）

Answer 4

python 3.2

from collections import defaultdict
c=defaultdict(list)
for i in myDic:
     for m,n in i.items():
            c[m].append(n)
new_dic={i:sum(v) for i,v in c.items()if len(v)==len(myDic)}
print(new_dic)

如何在dicts列表中查找公共密钥并按值对其进行排序？

4 个答案: