-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'master' of github.com:xjq7/blog
- Loading branch information
Showing
3 changed files
with
62 additions
and
5 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,11 +1,37 @@ | ||
[[toc]] | ||
|
||
# 数据结构 | ||
|
||
## 图论 | ||
|
||
### 深搜 | ||
### 最短路径 | ||
|
||
### 广搜 | ||
- [2385. 感染二叉树需要的总时间](https://leetcode.cn/problems/amount-of-time-for-binary-tree-to-be-infected/) | ||
|
||
最短路径 | ||
先走 深搜 构造无向图 | ||
然后从 start 节点开始走 广搜 寻找最短路径 | ||
|
||
## 二叉树 | ||
|
||
## 多叉树 | ||
|
||
## 数组 | ||
|
||
## 链表 | ||
|
||
### 双链表 | ||
|
||
- [146. LRU 缓存](https://leetcode.cn/problems/lru-cache/description/) | ||
|
||
构造双链表存储节点, 每新增一个新数添加到头部, 已存在则更新 value 以及移动到头部 | ||
构造 map 存储每个链表节点, 方便在 get 时直接取到对应链表节点, 然后做移动到头节点动作 | ||
|
||
# 算法 | ||
|
||
## 双指针 | ||
|
||
## 哈希表 | ||
|
||
n 数之和 | ||
|
||
## 单调栈 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters