Skip to content

Commit

Permalink
feat: $3428
Browse files Browse the repository at this point in the history
  • Loading branch information
robot committed Feb 22, 2025
1 parent f3470fb commit 81049a3
Show file tree
Hide file tree
Showing 2 changed files with 3 additions and 0 deletions.
2 changes: 2 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -449,6 +449,8 @@ leetcode 题解,记录自己的 leetcode 解题之路。
- [2939. 最大异或乘积](./problems/2939.maximum-xor-product.md)
- [3377. 使两个整数相等的数位操作](./problems/3377.digit-operations-to-make-two-integers-equal.md)
- [3404. 统计特殊子序列的数目](./problems/3404.count-special-subsequences.md)
- [3428. 至多 K 个子序列的最大和最小和](./problems/3428.maximum-and-minimum-sums-of-at-most-size-k-subsequences.md)

### 困难难度题目合集

困难难度题目从类型上说多是:
Expand Down
1 change: 1 addition & 0 deletions SUMMARY.md
Original file line number Diff line number Diff line change
Expand Up @@ -285,6 +285,7 @@
- [2939. 最大异或乘积](./problems/2939.maximum-xor-product.md)
- [3377. 使两个整数相等的数位操作](./problems/3377.digit-operations-to-make-two-integers-equal.md)
- [3404. 统计特殊子序列的数目](./problems/3404.count-special-subsequences.md)
- [3428. 至多 K 个子序列的最大和最小和](./problems/3428.maximum-and-minimum-sums-of-at-most-size-k-subsequences.md)

- [第六章 - 高频考题(困难)](collections/hard.md)

Expand Down

0 comments on commit 81049a3

Please sign in to comment.