File tree Expand file tree Collapse file tree 2 files changed +2
-2
lines changed
solution/0600-0699/0673.Number of Longest Increasing Subsequence Expand file tree Collapse file tree 2 files changed +2
-2
lines changed Original file line number Diff line number Diff line change 31
31
32
32
<!-- 这里可写通用的实现逻辑 -->
33
33
34
- [ 最长递增子序列] ( ../.. /0300-0399/0300.Longest%20Increasing%20Subsequence/README.md) 的变形题,除了原有的 ` dp ` 数组之外,另加了 ` cnt ` 数组记录以 ` nums[i] ` 结尾的最长子序列的个数
34
+ [ 最长递增子序列] ( /solution /0300-0399/0300.Longest%20Increasing%20Subsequence/README.md) 的变形题,除了原有的 ` dp ` 数组之外,另加了 ` cnt ` 数组记录以 ` nums[i] ` 结尾的最长子序列的个数
35
35
36
36
<!-- tabs:start -->
37
37
Original file line number Diff line number Diff line change 37
37
38
38
## Solutions
39
39
40
- similar problem: [ LIS] ( ../.. /0300-0399/0300.Longest%20Increasing%20Subsequence/README_EN.md)
40
+ similar problem: [ LIS] ( /solution /0300-0399/0300.Longest%20Increasing%20Subsequence/README_EN.md)
41
41
42
42
` cnt ` array records the number of longest sequence ending in ` nums[i] `
43
43
You can’t perform that action at this time.
0 commit comments