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

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

Browse Source
This commit is contained in:
qyg
2021-12-27 09:54:39 +08:00
parent eb2b5e756a
commit e1b489d34c
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

@ -55,7 +55,7 @@
dp[i] 是有0到i-1各个位置的最长升序子序列 推导而来，那么遍历i一定是从前向后遍历。
j其实就是0到i-1，遍历i的循环里外层，遍历j则在内层，代码如下：
j其实就是0到i-1，遍历i的循环在外层，遍历j则在内层，代码如下：
```CPP
for (int i = 1; i < nums.size(); i++) {