Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-05-25 01:41:20 -04:00
Code Issues Projects Releases Packages Wiki Activity

👾

Browse source
This commit is contained in:
bt3gl 2023-07-30 21:40:09 -07:00
parent 1d44d182e2
commit a85ed914d3
320 changed files with 0 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

17
trees_and_graphs/top_k_frequent_heap.py
View file

@ -1,17 +0,0 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# author: bt3gl
def top_k_frequentnums: list[int], k: int) -> list[int]:
# O(1) time
if k == len(nums):
return nums
# 1. build a hashmap element: frequency
counter = Counter(nums)
# 2. build a heap of k most frequent elements
# 3. build an output array
# O(N log k) time
return heapq.nlargest(k, counter.keys(), key=counter.get)