K Closest Points To Origin#81
Open
Yuto729 wants to merge 1 commit into
Open
Conversation
nodchip
reviewed
Jun 23, 2026
| k_closest_points = [] | ||
| for point in points: | ||
| x, y = point[0], point[1] | ||
| heapq.heappush(k_closest_points, ((- (x ** 2 + y ** 2), x, y))) |
There was a problem hiding this comment.
イメージ的に累乗の計算は遅そうに感じます。 x * x 等、より軽そうな書き方ができるのであれば、そちらで書いたほうが良いように思います。ただ、 CPython の実装を読んでみないと実際に重いかどうかは分かりません。また、定数倍の差しかないため、そこを気にするのであれば Python より速い言語で書き直すことを視野に入れたほうが良いのだとも思います。
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
解く問題
K Closest Points To Origin
次に解く問題
Balanced Binary Tree