Skip to content

Commit cf9c770

Browse files
committed
fix: change relative link to absolute link
1 parent 513b780 commit cf9c770

File tree

2 files changed

+2
-2
lines changed

2 files changed

+2
-2
lines changed

solution/0600-0699/0673.Number of Longest Increasing Subsequence/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -31,7 +31,7 @@
3131

3232
<!-- 这里可写通用的实现逻辑 -->
3333

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]` 结尾的最长子序列的个数
3535

3636
<!-- tabs:start -->
3737

solution/0600-0699/0673.Number of Longest Increasing Subsequence/README_EN.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -37,7 +37,7 @@
3737

3838
## Solutions
3939

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)
4141

4242
`cnt` array records the number of longest sequence ending in `nums[i]`
4343

0 commit comments

Comments
 (0)