41 lines
2.8 KiB
Markdown
41 lines
2.8 KiB
Markdown
按序刷完《代码随想录》的每一道题，但暂时跳过每道题的推荐题目
|
||
|
||
- [ ] [704. 二分查找 - 力扣（LeetCode）](https://leetcode.cn/problems/binary-search/description/) 需要能默写
|
||
- [ ] [209. 长度最小的子数组 - 力扣（LeetCode）](https://leetcode.cn/problems/minimum-size-subarray-sum/description/)
|
||
- [ ] [206. 反转链表 - 力扣（LeetCode）](https://leetcode.cn/problems/reverse-linked-list/)
|
||
- [ ] 递归
|
||
- [ ] 迭代
|
||
- [ ] **头插**
|
||
- [ ] [面试题 02.07. 链表相交 - 力扣（LeetCode）](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/solutions/1395092/lian-biao-xiang-jiao-by-leetcode-solutio-2kne/)
|
||
- [ ] [239. 滑动窗口最大值 - 力扣（LeetCode）](https://leetcode.cn/problems/sliding-window-maximum/solutions/543426/hua-dong-chuang-kou-zui-da-zhi-by-leetco-ki6m/)
|
||
- [ ] 堆
|
||
- [ ] 单调队列
|
||
- [ ] [102. 二叉树的层序遍历 - 力扣（LeetCode）](https://leetcode.cn/problems/binary-tree-level-order-traversal/) 注意是二维数组，可以延伸出很多其他题的解法必须很熟悉
|
||
- [ ] [101. 对称二叉树 - 力扣（LeetCode）](https://leetcode.cn/problems/symmetric-tree/solutions/2361627/101-dui-cheng-er-cha-shu-fen-zhi-qing-xi-8oba/)
|
||
- [ ] [222. 完全二叉树的节点个数 - 力扣（LeetCode）](https://leetcode.cn/problems/count-complete-tree-nodes/solutions/495655/wan-quan-er-cha-shu-de-jie-dian-ge-shu-by-leetco-2/)
|
||
- [ ] [110. 平衡二叉树 - 力扣（LeetCode）](https://leetcode.cn/problems/balanced-binary-tree/solutions/377216/ping-heng-er-cha-shu-by-leetcode-solution/)
|
||
- [ ] [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/)
|
||
- [ ] [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]]` 的情况
|
||
|
||
|
||
|
||
## PDF 标注
|
||
|
||
> [!PDF|yellow] [[1.《代码随想录》数组（V3.0）.pdf#page=8&selection=37,0,39,4&color=yellow|1.《代码随想录》数组（V3.0）, p.8]]
|
||
> > 1. 移除元素
|
||
>
|
||
> 相似的题目是移除数组中的所有 0
|
||
|
||
> [!PDF|red] [[1.《代码随想录》数组（V3.0）.pdf#page=15&selection=3,0,4,8&color=red|1.《代码随想录》数组（V3.0）, p.15]]
|
||
> > 5.⻓度最⼩的⼦数组
|
||
>
|
||
> 再学一遍
|
||
|
||
> [!PDF|red] [[2.《代码随想录》链表.（V3.0）.pdf#page=25&selection=34,0,40,4&color=red|2.《代码随想录》链表.（V3.0）, p.25]]
|
||
> > 7. ⾯试题 02.07. 链表相交
|
||
>
|
||
> 很经典
|