39 lines
1.4 KiB
Markdown
39 lines
1.4 KiB
Markdown
按序刷完《代码随想录》的每一道题，但暂时跳过每道题的推荐题目
|
||
|
||
# 数组
|
||
|
||
## 总结
|
||
1. 二分查找需要能默写
|
||
|
||
## 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.⻓度最⼩的⼦数组
|
||
>
|
||
> 再学一遍
|
||
|
||
## 二刷
|
||
|
||
以下题目需要再做一遍
|
||
- [ ] [704. 二分查找 - 力扣（LeetCode）](https://leetcode.cn/problems/binary-search/description/)
|
||
- [ ] [209. 长度最小的子数组 - 力扣（LeetCode）](https://leetcode.cn/problems/minimum-size-subarray-sum/description/)
|
||
|
||
# 链表
|
||
|
||
> [!PDF|red] [[2.《代码随想录》链表.（V3.0）.pdf#page=25&selection=34,0,40,4&color=red|2.《代码随想录》链表.（V3.0）, p.25]]
|
||
> > 7. ⾯试题 02.07. 链表相交
|
||
>
|
||
> 很经典
|
||
|
||
|
||
## 二刷
|
||
- [ ] [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/) |