Solved, iterate through dict K number of times and remove highest value each time beat 93% memory
This commit is contained in:
parent
1350865573
commit
2cec78857e
@ -11,9 +11,10 @@ def topKFrequent(nums, k):
|
||||
frequency[x] = 1
|
||||
else:
|
||||
frequency[x] += 1
|
||||
for y in frequency:
|
||||
if frequency[y] >= k:
|
||||
elements.append(y)
|
||||
for i in range(k):
|
||||
maxKey = max(frequency, key=frequency.get)
|
||||
elements.append(maxKey)
|
||||
del frequency[maxKey]
|
||||
return elements
|
||||
|
||||
|
||||
|
||||
Loading…
Reference in New Issue
Block a user