Why not login to Qiita and try out its useful features?

We'll deliver articles that match you.

You can read useful information later.

0

@kudojp(Daiki Kudo)

Python で heapq.nlargest/nsmallest を使う

Python

Last updated at 2024-04-21Posted at 2024-04-21

動機

ある配列の top largest/smallest K elements を得たい場合、

sort だと time = O(NlogN)かかってしまう。
自前で heapを使って実装するのはめんどくさい。

仕様

TODO: 返される配列はkeyでソートされてそう？
TODO: タイの場合はどのelementが選ばれるのだろう？元のindexが最も小さいものか？

使ってみた

Ref.

0

Register as a new user and use Qiita more conveniently

You get articles that match your needs
You can efficiently read back useful information
You can use dark theme

What you can do with signing up

Qiita Conference 2025 will be held!: 4/23(wed) - 4/25(Fri)

Qiita Conference is the largest tech conference in Qiita!

Keynote Speaker

ymrl、Masanobu Naruse, Takeshi Kano, Junichi Ito, uhyo, Hiroshi Tokumaru, MinoDriven, Minorun, Hiroyuki Sakuraba, tenntenn, drken, konifar

View event details

0