Longest Repeating Character Replacement#139
Open
tom4649 wants to merge 2 commits into
Open
Conversation
nodchip
reviewed
Jun 23, 2026
| count = collections.defaultdict(int) | ||
| left = 0 | ||
| length_of_longest = 0 | ||
| heap = [] |
There was a problem hiding this comment.
heap に何が入っているのか、処理が追いづらく感じました。変数名に、要素がどのようなものかを表す英単語・英語句を付けるとよいと思いました。
Owner
Author
There was a problem hiding this comment.
コメントを加えました。heap だけではなく stack などにも適用できる点だと思うので頭にいれておきます。
ついでに heapq モジュールの機能を使って max heap を実現しました。
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.
https://leetcode.com/problems/longest-repeating-character-replacement/description/