algorithm/CS-Notes
1
0
Fork 0
mirror of https://github.com/CyC2018/CS-Notes.git synced 2025-07-09 20:32:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #435 from zhulinn/patch-2

Browse Source 
上升子序列
This commit is contained in:
郑永川
2018-09-23 23:04:44 +08:00
committed by GitHub
parent 3a604c23e8 5eaf1daec1
commit cd14f64ce8
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
notes/Leetcode 题解.md
View File

@ -2781,7 +2781,7 @@ return ret;
定义一个 tails 数组，其中 tails[i] 存储长度为 i + 1 的最长递增子序列的最后一个元素。对于一个元素 x，
- 如果它大于 tails 数组所有的值，那么把它添加到 tails 后面，表示最长递增子序列长度加 1；
- 如果 tails[i-1] < x <= tails[i]，那么更新 tails[i-1] = x。
- 如果 tails[i-1] < x <= tails[i]，那么更新 tails[i] = x。
例如对于数组 [4,3,6,5]，有：