Go to Qiita Advent Calendar 2024 Top
LoginSignup
0
0

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?

@kudojp(Daiki Kudo)

Python で heapq.nlargest/nsmallest を使う

Last updated at Posted at 2024-04-21

動機

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

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

仕様

image.png

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

使ってみた

image.png

Ref.

0
0
0

Register as a new user and use Qiita more conveniently

  1. You get articles that match your needs
  2. You can efficiently read back useful information
  3. You can use dark theme
What you can do with signing up
Sign upLogin
0
0

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?