forked from thatguyintech/100-day-coding-challenge
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtopKFrequent.py
49 lines (42 loc) · 1.46 KB
/
topKFrequent.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
def topKFrequent(nums, k):
if len(nums) == 0:
return []
freqs = dict()
for num in nums:
if num in freqs:
freqs[num] += 1
else:
freqs[num] = 1
buckets = [None for i in xrange(max(freqs.values())+1)]
for num in freqs:
freq = freqs[num]
if buckets[freq]:
buckets[freq].append(num)
else:
buckets[freq] = [num]
ret = []
i = len(buckets)-1
addedCount = 0
offset = 0
while addedCount < k and i-offset > 0:
while not buckets[i-offset]:
offset += 1
ret += buckets[i-offset]
addedCount += len(buckets[i-offset])
offset += 1
return ret
def testTopKFrequent():
assert set(topKFrequent([], 0)) == set([])
assert set(topKFrequent([1], 1)) == set([1])
assert set(topKFrequent([-1, -1], 1)) == set([-1])
assert set(topKFrequent([1,1,1,2,2,3], 2)) == set([1, 2])
assert set(topKFrequent([-1,-1,-1,2,2,3], 2)) == set([-1, 2])
assert set(topKFrequent([1,1,1,2,2,3], 3)) == set([1, 2, 3])
assert set(topKFrequent([1,1,1,2,2,2,3,3,3], 3)) == set([1, 2, 3])
assert set(topKFrequent([1, 2, 3, 4, 5], 1)) == set([1, 2, 3, 4, 5])
assert set(topKFrequent([4,1,-1,2,-1,2,3], 2)) == set([-1, 2])
assert set(topKFrequent([3,2,3,1,2,4,5,5,6,7,7,8,2,3,1,1,1,10,11,5,6,2,4,7,8,5,6], 10)) == set([1,2,5,3,7,6,4,8,10,11])
def main():
testTopKFrequent()
if __name__ == "__main__":
main()