qak2019
/
career
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

vault backup: 2025-05-11 11:19:59

This commit is contained in:
asskicker0214 2025-05-11 11:19:59 +08:00
parent 10d9fc8c96 c9ad35e3c9
commit 4d01a94e36
1 changed files with 3 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
算法训练/刷题笔记/迭代一.md
View File

@ -17,6 +17,9 @@
- [ ] [106. 从中序与后序遍历序列构造二叉树 - 力扣（LeetCode）](https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) - [ ] [106. 从中序与后序遍历序列构造二叉树 - 力扣（LeetCode）](https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)
- [ ] [501. 二叉搜索树中的众数 - 力扣（LeetCode）](https://leetcode.cn/problems/find-mode-in-binary-search-tree/) - [ ] [501. 二叉搜索树中的众数 - 力扣（LeetCode）](https://leetcode.cn/problems/find-mode-in-binary-search-tree/)
- [ ] [450. 删除二叉搜索树中的节点 - 力扣（LeetCode）](https://leetcode.cn/problems/delete-node-in-a-bst/) - [ ] [450. 删除二叉搜索树中的节点 - 力扣（LeetCode）](https://leetcode.cn/problems/delete-node-in-a-bst/)
- [ ] [40. 组合总和 II - 力扣（LeetCode）](https://leetcode.cn/problems/combination-sum-ii/) 重点是结果去重，技巧
1. 先对 candidates 排序，这样就不会出现 `[[1,2,5], [1,5,2]]` 的情况
2. 在每一个 epoch 中，循环时跳过 visited 元素，这样就不会出现 `[[1,2,5], [1,2,5]]` 的情况