В соответствии с результатами синхронизации (обновление ниже в ответе) быстрый метод может быть с помощью collections.defaultdict
. Пример -
from collections import defaultdict
result_dic = defaultdict(list)
for a,b in original_list:
result_dic[a].append(b)
Демо -
>>> original_list = [['a',1],['a',2],['a',3],['b',5],['a',4],['b',6],['c',7],['c',8],['c',9],['c',0]]
>>>
>>> from collections import defaultdict
>>> result_dic = defaultdict(list)
>>> for a,b in original_list:
... result_dic[a].append(b)
...
>>> result_dic
defaultdict(<class 'list'>, {'b': [5, 6], 'c': [7, 8, 9, 0], 'a': [1, 2, 3, 4]})
Другой метод может быть использование itertools.groupby
для этого. Пример -
from itertools import groupby
result_dict = {key:list(b for a,b in group) for key,group in groupby(sorted(original_list),key=lambda x:x[0])}
Демо -
>>> original_list = [['a',1],['a',2],['a',3],['b',5],['a',4],['b',6],['c',7],['c',8],['c',9],['c',0]]
>>> from itertools import groupby
>>> result_dict = {key:list(b for a,b in group) for key,group in groupby(sorted(original_list),key=lambda x:x[0])}
>>> result_dict
{'b': [5, 6], 'c': [0, 7, 8, 9], 'a': [1, 2, 3, 4]}
результаты Timing -
In [21]: %paste
def func1():
original_list = [['a',1],['a',2],['a',3],['b',5],['a',4],['b',6],['c',7],['c',8],['c',9],['c',0]]
return {key:list(b for b in group) for key,group in groupby(sorted(original_list),key=lambda x:x[0])}
def func2():
original_list = [['a',1],['a',2],['a',3],['b',5],['a',4],['b',6],['c',7],['c',8],['c',9],['c',0]]
result_dic = defaultdict(list)
for a,b in original_list:
result_dic[a].append(b)
return result_dic
def func3():
original_list = [['a',1],['a',2],['a',3],['b',5],['a',4],['b',6],['c',7],['c',8],['c',9],['c',0]]
result = {}
for x in original_list: result.setdefault(x[0], []).append(x[1])
return result
## -- End pasted text --
In [22]: %timeit func1()
The slowest run took 4.56 times longer than the fastest. This could mean that an intermediate result is being cached
100000 loops, best of 3: 12.1 µs per loop
In [23]: %timeit func2()
100000 loops, best of 3: 3.82 µs per loop
In [24]: %timeit func3()
The slowest run took 4.77 times longer than the fastest. This could mean that an intermediate result is being cached
100000 loops, best of 3: 4.31 µs per loop
Ваш вывод не является допустимым списком python. Что именно вы хотите? Список списка, содержащий символ и список номеров? –
opss sorry я отредактирую – momokjaaaaa
hint: setdefault, defaultdict –