Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 12:16:14 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update and rename top_k_frequent_heap.py to top_k_frequent.py

Browse Source
This commit is contained in:
bt3gl 2023-08-08 16:44:03 -07:00 committed by GitHub
parent e7d19505dc
commit bf35809bb2
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 13 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
heaps/top_k_frequent.py Normal file
View File

@ -0,0 +1,13 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# author: bt3gl
def top_k_frequent_values(list, k):
if k == len(nums):
return nums
# hashmap element: frequency
counter = Counter(nums)
return heapq.nlargest(k, counter.keys(), key=counter.get)

17
heaps/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)