vault backup: 2025-04-06 18:57:44

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

@@ -1,9 +1,16 @@
 按序刷完《代码随想录》的每一道题，但暂时跳过每道题的推荐题目
 
-# 数组
+- [ ] [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/)
+	- [ ] 堆
+	- [ ] 单调队列
  
-## 总结
-1. 二分查找需要能默写
 
 ## PDF 标注
 
@@ -17,23 +24,7 @@
 > 
 > 再学一遍
 
-## 二刷
-
-以下题目需要再做一遍
-- [ ] [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/)