Create 0276-paint-fence.md #35
Open
Conversation
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
nodchip
reviewed
Oct 26, 2025
|
|
||
| - アルゴリズムの選択 | ||
| - 支柱の個数nを1から増やしていくような動的計画法（bottom-up）で解く。 | ||
| - 状態はk+1個あれば十分そうだが、これだとkが大きい時にかさむのと、本質的に異なる色を区別する意味がない（対等性が成り立つ）ので、削減したい。 |
There was a problem hiding this comment.
ありがとうございます。
同意です。
大学受験の数学で見た記憶だったのですが、調べたら「対等性」という用語は存在しないとのことで、お恥ずかしい限りです。
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
この問題（premium）：https://leetcode.com/problems/paint-fence/
代替ページ：https://www.lintcode.com/problem/514/
次の問題：https://leetcode.com/problems/longest-increasing-subsequence/