Similarly, the only constraint on the dictionaries’ values is that they can be compared against one another. Also note that our code is general: it makes no presumptions about the dictionaries’ keys - they need not be strings nor of any other particular type. This, along with a good docstring, makes our code easy to read, understand, and debug. Note the use of simple and descriptive variables (e.g. we use the variable name key when we iterate over the keys of a dictionary). Parameters - dict1 : Dict dict2 : Dict Returns - Dict The merged dictionary """ merged = dict ( dict1 ) for key in dict2 : if key not in merged or dict2 > merged : merged = dict2 return merged From 3.7, that insertion order has been guaranteed. As a side effect of the compact dictionary implementation in Python 3.6, dictionaries started to conserve insertion order. Thus calling this function will mutate (change) the state of dict1, as demonstrated here:ĭef simple_merge_max_mappings ( dict1, dict2 ): """ Merges two dictionaries based on the largest value in a given mapping. Escriba código personalizado para comparar dos diccionarios en Python. A Python dictionary is an implementation of the hash table, which is traditionally an unordered data structure. Recall that dictionaries are mutable objects and that the statement merged = dict1 simply assigns a variable that references dict1 rather than creating a new copy of the dictionary. The problem with our function is that we inadvertently merge dict2 into dict1, rather than merging the two dictionaries into a new dictionary. Merged is initialized to have the same mappings as dict1, this is a correct algorithm for merging our two dictionaries based on max-value. We then set a key-value from dict2 mapping in merged if that key doesn’t exist in merged or if the value is larger than the one stored in existing mapping. Thus for key in dict2 loops over every key in dict2. Recall that iterating over a dictionary will produce each of its keys one-by-one. Let’s first see what this function does right. Any semantics of dict.values () (dict identity, sequence, set, and multiset) wouldn’t work the case. Def buggy_merge_max_mappings ( dict1, dict2 ): # create the output dictionary, which contains all # the mappings from `dict1` merged = dict1 # populate `merged` with the mappings in dict2 if: # - the key doesn't exist in `merged` # - the value in dict2 is larger for key in dict2 : if key not in merged or dict2 > merged : merged = dict2 return merged In your use case, strait compare of the dicts or d1.items () d2.items () are the right solution.
0 Comments
Leave a Reply. |