14 python dictionary
这是我目前的代码
pN ={'dave': 10, 'jacinta': 10, 'james': 8, 'john': 6, 'jack': 3, 'sam': 2}
highestCount = max(pN.values())
for k, v in pN.items():
if v == highestCount:
print(v,k)
Run Code Online (Sandbox Code Playgroud)
但是,这仅打印顶级用户,如果共享该位置,则再次打印它
10 dave
10 jacinta
Run Code Online (Sandbox Code Playgroud)
我需要能够打印任意数量的顶级用户(n)并将其格式化为例如n = 5:
10 john, jacinta,
8 james
6 john
3 jack
2 sam
Run Code Online (Sandbox Code Playgroud)
use*_*203 11
使用a collections.defaultdict,交换你的keys和values
from collections import defaultdict
dct = defaultdict(list)
for k, v in pN.items():
dct[v].append(k)
# defaultdict(<class 'list'>, {10: ['dave', 'jacinta'], 8: ['james'], 6: ['john'], 3: ['jack'], 2: ['sam']})
Run Code Online (Sandbox Code Playgroud)
使用sorted的输出:
for k, v in sorted(dct.items(), reverse=True):
print(k, ', '.join(v))
# Result
10 dave, jacinta
8 james
6 john
3 jack
2 sam
Run Code Online (Sandbox Code Playgroud)
function返回顶级n用户(将关系视为一个条目):
def top_n(d, n):
dct = defaultdict(list)
for k, v in d.items():
dct[v].append(k)
return sorted(dct.items())[-n:][::-1]
top_n(pN, 3)
# [(10, ['dave', 'jacinta']), (8, ['james']), (6, ['john'])]
Run Code Online (Sandbox Code Playgroud)
defaultdict简单快速,这里有一些时间来证明它:将定时的功能
def chris_z(d, n):
dct = defaultdict(list)
for k, v in d.items():
dct[v].append(k)
return sorted(dct.items())[-n:][::-1]
def tim_lombard(score_dict, n):
lot = [(k,v) for k, v in score_dict.items()] #make list of tuple from scores dict
nl = []
while len(lot)> 0:
nl.append(max(lot, key=lambda x: x[1]))
lot.remove(nl[-1])
def ajax(d, n:'n_users', top = True):
_ranks = sorted(d.values())
_ranks = _ranks[-n:] if top else _ranks[:n]
return {i:[a for a, b in d.items() if b == i] for i in _ranks}
Run Code Online (Sandbox Code Playgroud)
结果
x = [''.join(i) for i in itertools.permutations('chrisz', 6)]
y = [random.randint(0, 100) for _ in range(720)]
z = dict(zip(x, y))
In [40]: %timeit chris_z(z, 500)
110 µs ± 259 ns per loop (mean ± std. dev. of 7 runs, 10000 loops each)
In [42]: %timeit tim_lombard(z, 500)
26.2 ms ± 60 µs per loop (mean ± std. dev. of 7 runs, 10 loops each)
In [43]: %timeit ajax(z, 500)
15.3 ms ± 227 µs per loop (mean ± std. dev. of 7 runs, 100 loops each)
Run Code Online (Sandbox Code Playgroud)