File tree 2 files changed +2
-0
lines changed
2 files changed +2
-0
lines changed Original file line number Diff line number Diff line change @@ -548,6 +548,7 @@ leetcode 题解,记录自己的 leetcode 解题之路。
548
548
- [ 2209. 用地毯覆盖后的最少白色砖块] ( ./problems/2209.minimum-white-tiles-after-covering-with-carpets.md ) 👍
549
549
- [ 2281. 巫师的总力量和] ( ./problems/2281.sum-of-total-strength-of-wizards.md )
550
550
- [ 2306. 公司命名] ( ./problems/2306.naming-a-company.md ) 枚举优化好题
551
+ - [ 2842. 统计一个字符串的 k 子序列美丽值最大的数目] ( ./problems/2842.count-k-subsequences-of-a-string-with-maximum-beauty.md )
551
552
- [ 5254. 卖木头块] ( ./problems/5254.selling-pieces-of-wood.md ) 动态规划经典题
552
553
- [ 5999. 统计数组中好三元组数目] ( ./problems/5999.count-good-triplets-in-an-array.md ) 👍
553
554
Original file line number Diff line number Diff line change 365
365
- [ 2102. 序列顺序查询] ( ./problems/2102.sequentially-ordinal-rank-tracker.md )
366
366
- [ 2209. 用地毯覆盖后的最少白色砖块] ( ./problems/2209.minimum-white-tiles-after-covering-with-carpets.md )
367
367
- [ 2281.sum-of-total-strength-of-wizards] ( ./problems/2281.sum-of-total-strength-of-wizards.md )
368
+ - [ 2842. 统计一个字符串的 k 子序列美丽值最大的数目] ( ./problems/2842.count-k-subsequences-of-a-string-with-maximum-beauty.md )
368
369
- [ 2306. 公司命名] ( ./problems/2306.naming-a-company.md ) 枚举优化好题
369
370
- [ 5254. 卖木头块] ( ./problems/5254.selling-pieces-of-wood.md ) 动态规划经典题
370
371
- [ 5999. 统计数组中好三元组数目] ( ./problems/5999.count-good-triplets-in-an-array.md ) 👍
You can’t perform that action at this time.
0 commit comments