mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-07 07:35:35 +08:00
0300.最长上升子序列:调整笔误
This commit is contained in:
@ -49,7 +49,7 @@
|
||||
|
||||
3. dp[i]的初始化
|
||||
|
||||
每一个i,对应的dp[i](即最长上升子序列)起始大小至少都是是1.
|
||||
每一个i,对应的dp[i](即最长上升子序列)起始大小至少都是1.
|
||||
|
||||
4. 确定遍历顺序
|
||||
|
||||
|
Reference in New Issue
Block a user