-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathshzu_training.html
More file actions
46 lines (44 loc) · 3.52 KB
/
Copy pathshzu_training.html
File metadata and controls
46 lines (44 loc) · 3.52 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
<!doctype html><html><head><meta charset="utf-8">
<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/github-markdown-css/2.10.0/github-markdown.min.css">
<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/highlight.js/9.13.1/highlight.min.js">
<link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/katex@0.10.0/dist/katex.min.css" integrity="sha384-9eLZqc9ds8eNjO3TmqPeYcDj8n+Qfa4nuSiGYa6DjLNcv9BtN69ZIulL9+8CqC9Y" crossorigin="anonymous">
<link rel="stylesheet" href="https://gitcdn.xyz/repo/goessner/mdmath/master/css/texmath.css">
<link rel="stylesheet" href="https://gitcdn.xyz/repo/goessner/mdmath/master/css/vscode-texmath.css">
</head><body class="markdown-body">
<h2 id="e4b880--e59fbae69cace7ae97e6b395-3" data-line="0" class="code-line code-line code-line" id="e4b880--e59fbae69cace7ae97e6b395-4" id="e4b880--e59fbae69cace7ae97e6b395-5">一 . 基本算法</h2>
<ul>
<li data-line="1" class="code-line code-line code-line">枚举与模拟</li>
<li data-line="2" class="code-line code-line code-line">贪心</li>
<li data-line="3" class="code-line code-line code-line">递推</li>
<li data-line="4" class="code-line code-line code-line">递归与分治</li>
</ul>
<h2 id="e4ba8c--e59fbae7a180e695b0e68daee7bb93e69e84-3" data-line="6" class="code-line code-line code-line" id="e4ba8c--e59fbae7a180e695b0e68daee7bb93e69e84-4" id="e4ba8c--e59fbae7a180e695b0e68daee7bb93e69e84-5">二 . 基础数据结构</h2>
<ul>
<li data-line="7" class="code-line code-line code-line">数组 vector</li>
<li data-line="8" class="code-line code-line code-line">队列 queue</li>
<li data-line="9" class="code-line code-line code-line">栈 stack</li>
<li data-line="10" class="code-line code-line code-line">链表 list</li>
<li data-line="11" class="code-line code-line code-line">并查集</li>
<li data-line="12" class="code-line code-line code-line">树状数组</li>
</ul>
<h2 id="e4b889--e7ae80e58d95e6909ce7b4a2-3" data-line="14" class="code-line code-line code-line" id="e4b889--e7ae80e58d95e6909ce7b4a2-4" id="e4b889--e7ae80e58d95e6909ce7b4a2-5">三 . 简单搜索</h2>
<ul>
<li data-line="15" class="code-line code-line code-line">深度优先搜索</li>
<li data-line="16" class="code-line code-line code-line">广度优先搜索</li>
<li data-line="17" class="code-line code-line code-line">简单搜索技巧和技巧</li>
<li data-line="18" class="code-line code-line code-line">A* , 迭代加深搜索 , IDA*</li>
</ul>
<h2 id="e59b9b--e59bbee8aebae585a5e997a8-3" data-line="20" class="code-line code-line code-line" id="e59b9b--e59bbee8aebae585a5e997a8-4" id="e59b9b--e59bbee8aebae585a5e997a8-5">四 . 图论入门</h2>
<ul>
<li data-line="21" class="code-line code-line code-line">最短路径</li>
<li data-line="22" class="code-line code-line code-line">最小生成树</li>
<li data-line="23" class="code-line code-line code-line">拓扑排序</li>
</ul>
<h2 id="e4ba94--e58aa8e68081e8a784e58892e585a5e997a8-3" data-line="25" class="code-line code-line code-line" id="e4ba94--e58aa8e68081e8a784e58892e585a5e997a8-4" id="e4ba94--e58aa8e68081e8a784e58892e585a5e997a8-5">五 . 动态规划入门</h2>
<ul>
<li data-line="26" class="code-line code-line code-line">记忆化搜索</li>
<li data-line="27" class="code-line code-line code-line">背包问题</li>
<li data-line="28" class="code-line code-line code-line">LCS与LIS</li>
</ul>
<h2 id="e585ad--e680bbe7bb93e6b58be8af95-3" data-line="30" class="code-line code-line code-line" id="e585ad--e680bbe7bb93e6b58be8af95-4" id="e585ad--e680bbe7bb93e6b58be8af95-5">六 . 总结测试</h2>
</body></html>