Use sets to find all equivalents:
for (key, value) in set(aa.items()) & set(bb.items()):
print '%s: %s is present in both aa and bb' % (key, value)
The &
operator here gives you the intersection of both sets; alternatively you could write:
set(aa.items()).intersection(set(bb.items()))
Note that this does create full copies of both dicts so if these are very large you this may not be the best approach.
A shortcut would be to only test the keys:
for key in set(aa) & set(bb):
if aa[key] == bb[key]:
print '%s: %s is present in both aa and bb' % (key, value)
Here you only copy the keys of each dict to reduce the memory footprint.
When using Python 2.7, the dict type includes additional methods to create the required sets directly:
for (key, value) in aa.viewitems() & bb.viewitems():
print '%s: %s is present in both aa and bb' % (key, value)
These are technically dictionary views but for the purposes of this problem they act the same.
与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…