Stagg - 2 years ago 151
Python Question

# Sum the values that have the same key in a dictionary

I have this list of dictionaries:

``````[{'Total Incidents': '1', 'CrimeTime': '19'},
{'Total Incidents': '1', 'CrimeTime': '19'},
{'Total Incidents': '1', 'CrimeTime': '19'},
{'Total Incidents': '1', 'CrimeTime': '20'},
{'Total Incidents': '1', 'CrimeTime': '20'},
{'Total Incidents': '1', 'CrimeTime': '21'},
{'Total Incidents': '1', 'CrimeTime': '21'}]
``````

I need to convert the value of 'Total Incidents' to int, and sum them up, for each incident that occured in the same hour (the minutes and seconds are irrelevant). The output should be something like this:

``````[{'Total Incidents': 3, 'CrimeTime': '19'},
{'Total Incidents': 2, 'CrimeTime': '20'},
{'Total Incidents': 2, 'CrimeTime': '21'}]
``````

I have used this method:

`````` [{ 'CrimeTime':       g[0],
'Total Incidents': sum(map(lambda x: int(x['Total Incidents']), g[1])) }
for g in itertools.groupby(mydata, lambda x: x['CrimeTime']) ]
``````

But unfortunately, sometimes it repeats 'CrimeTime' so I get two dictionaries with the same 'CrimeTime', instead of only one with the summed incidents. The original list is a lot bigger, I just used a short version to explain myself better.

Feel free to ask if you don't understand my question so that I can explain myself a bit better.

In most contexts (as in yours), `itertools.groupby` works best if the data is sorted by the grouping key because it only groups adjacent elements:
``````key = lambda x: x['CrimeTime']
Using the generator expression instead of the `map`-`lambda` is mostly a matter of taste, but, at least in Python 2, saves you some resources by not building an intermediate `list`.