300. Longest Increasing Subsequence#29
Open
hiro111208 wants to merge 1 commit into
Open
Conversation
nodchip
reviewed
May 12, 2026
|
|
||
| - 漸化式を作れなかった | ||
| - [NeetCode](https://www.youtube.com/watch?v=cjWnW0hdF1Y)の解法を見た | ||
| - LIS[i] を「nums[i] から始まる最長増加部分列の長さ」と定義する |
There was a problem hiding this comment.
ある長さの最長増加部分列の末尾の値の最小値を考えることにより、 O(n log n) で解くこともできます。ほかの方の解答を参照されるとよいと思います。
| ```python | ||
| class Solution: | ||
| def lengthOfLIS(self, nums: List[int]) -> int: | ||
| LIS = [1] * len(nums) |
There was a problem hiding this comment.
LIS という名前は定数っぽく感じます。 i 番目の数字で終わる最長増加部分列の長さの最大値が格納されますので、 tail_index_to_max_length はいかがでしょうか？
| ```python | ||
| class Solution: | ||
| def lengthOfLIS(self, nums: List[int]) -> int: | ||
| lis_from_i = [1] * len(nums) |
There was a problem hiding this comment.
格納されるのが最大の長さのため、 lis とするのは、中身と名前がずれているように思いました。
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.
This problem: 300. Longest Increasing Subsequence
Next problem: 62. Unique Paths