mirror of
https://github.com/krahets/hello-algo.git
synced 2026-11-11 00:11:00 +08:00
7257641e0e
* Retranslate the complete Japanese online edition from Chinese * Fit Japanese homepage labels and localize heading permalinks * Point Japanese contribution instructions to the Japanese preview * Replace locale conditionals with multilingual UI tables
40 lines
1.1 KiB
Python
40 lines
1.1 KiB
Python
"""
|
|
File: top_k.py
|
|
Created Time: 2023-06-10
|
|
Author: krahets (krahets@163.com)
|
|
"""
|
|
|
|
import sys
|
|
from pathlib import Path
|
|
|
|
sys.path.append(str(Path(__file__).parent.parent))
|
|
from modules import print_heap
|
|
|
|
import heapq
|
|
|
|
|
|
def top_k_heap(nums: list[int], k: int) -> list[int]:
|
|
"""ヒープを使って配列内の大きいほうから k 個の要素を求める"""
|
|
# 最小ヒープを初期化する
|
|
heap = []
|
|
# 配列の先頭 k 個の要素をヒープに挿入する
|
|
for i in range(k):
|
|
heapq.heappush(heap, nums[i])
|
|
# k+1 番目の要素から始め、ヒープの長さを k に保つ
|
|
for i in range(k, len(nums)):
|
|
# 現在の要素がヒープの先頭要素より大きい場合、先頭要素を取り出し、現在の要素を挿入する
|
|
if nums[i] > heap[0]:
|
|
heapq.heappop(heap)
|
|
heapq.heappush(heap, nums[i])
|
|
return heap
|
|
|
|
|
|
"""実行用コード"""
|
|
if __name__ == "__main__":
|
|
nums = [1, 7, 6, 3, 2]
|
|
k = 3
|
|
|
|
res = top_k_heap(nums, k)
|
|
print(f"大きいほうから {k} 個の要素は")
|
|
print_heap(res)
|