I have several dictionaries with different and common keys, plus different and common keys in the nested dictionary. Below is a simplified example, the actual dictionaries have thousands of keys.
{1:{"Title":"Chrome","Author":"Google","URL":"http://"}}
{1:{"Title":"Chrome","Author":"Google","Version":"7.0.577.0"}}
{2:{"Title":"Python","Version":"2.5"}}
Which I'd like to merge into a single dictionary.
{1:{"Title":"Chrome","Author":"Google","URL":"http://","Version":"7.0.577.0"},
2:{"Title":"Python","Version":"2.5"}}
I can iterate over both dictionaries, compare keys and update
the nested dictionaries, but there is probably a more efficient, or pythonic, way to do this. If not, which is the most efficient?
Values of the nested dictionary need not be compared.
from collections import defaultdict
mydicts = [
{1:{"Title":"Chrome","Author":"Google","URL":"http://"}},
{1:{"Title":"Chrome","Author":"Google","Version":"7.0.577.0"}},
{2:{"Title":"Python","Version":"2.5"}},
]
result = defaultdict(dict)
for d in mydicts:
for k, v in d.iteritems():
result[k].update(v)
print result
defaultdict(<type 'dict'>,
{1: {'Version': '7.0.577.0', 'Title': 'Chrome',
'URL': 'http://', 'Author': 'Google'},
2: {'Version': '2.5', 'Title': 'Python'}})
From your example, looks like you can do something like:
from collections import defaultdict
mydict = defaultdict(dict)
for indict in listofdicts:
k, v = indict.popitem()
mydict[k].update(v)
来源:https://stackoverflow.com/questions/4235004/merge-nested-dictionaries-by-nested-keys