300. Longest Increasing Subsequence #32
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
oda
reviewed
Oct 2, 2024
| - `end_minimums_of_is`, `sub_seq_minimums`, `smallest_value_of_subseq` など候補 | ||
| - これらを考慮して `end_minimums_of_subsequence` が個人的に良さそう | ||
| - https://github.com/fhiyo/leetcode/pull/32 | ||
|
|
There was a problem hiding this comment.
この辺類題です。一応、見ていないかもしれないので。
https://discord.com/channels/1084280443945353267/1201211204547383386/1241981541802840228
sakupan102
reviewed
Oct 3, 2024
| ```python | ||
| class Solution: | ||
| def lengthOfLIS(self, nums: List[int]) -> int: | ||
| n = len(nums) |
Owner
Author
There was a problem hiding this comment.
n とか ans とか書いてしまう悪い癖が戻ってしまっていました。ご指摘ありがとうございます。
sakupan102
reviewed
Oct 3, 2024
| ```python | ||
| class Solution: | ||
| def lengthOfLIS(self, nums: List[int]) -> int: | ||
| end_minimums_of_subsequence = [math.inf] * len(nums) |
There was a problem hiding this comment.
最初は空の配列を用意して、配列の右端より大きいnumが出てきたらappendする方法でもよい気がしますね
nodchip
reviewed
Oct 7, 2024
| - Step2で復習する | ||
| - セグメント木による解法もあるが、セグメント木を何も見ずに書ける自信なし、、 | ||
| - Step2でソラで書けるように練習する | ||
| - Step1ではセグメント木をライブラリとして使ってやってみる |
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.
問題へのリンク
https://leetcode.com/problems/longest-increasing-subsequence/description/
次に解く問題
53. Maximum Subarray
README.mdへ頭の中の言語化と記録をしています。