algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 00:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

0300.最长上升子序列：调整笔误

Browse Source
This commit is contained in:
qyg
2021-12-28 10:02:16 +08:00
parent 94d1320fff
commit 09f9682792
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0300.最长上升子序列.md
View File

@ -49,7 +49,7 @@
3. dp[i]的初始化 3. dp[i]的初始化
每一个i，对应的dp[i]（即最长上升子序列）起始大小至少都是是1. 每一个i，对应的dp[i]（即最长上升子序列）起始大小至少都是1.
4. 确定遍历顺序 4. 确定遍历顺序