File tree Expand file tree Collapse file tree 24 files changed +21
-38
lines changed
Expand file tree Collapse file tree 24 files changed +21
-38
lines changed Original file line number Diff line number Diff line change 1- [ TOC]
1+
2+ - [ 1 时间复杂度、空间复杂度、排序、异或运算] ( #1-------------------- )
3+ * [ 1.1 时间复杂度] ( #11------ )
4+ + [ 1.1.1 排序操作] ( #111----- )
5+ - [ 1.1.1.1 选择排序] ( #1111----- )
6+ - [ 1.1.1.2 冒泡排序] ( #1112----- )
7+ - [ 1.1.1.3 插入排序] ( #1113----- )
8+ * [ 1.2 空间复杂度] ( #12------ )
9+ * [ 1.3 常数项时间复杂度] ( #13--------- )
10+ * [ 1.4 算法最优解] ( #14------ )
11+ * [ 1.5 常见时间复杂度] ( #15-------- )
12+ * [ 1.6 算法和数据结构脉络] ( #16---------- )
13+ * [ 1.7 认识对数器] ( #17------ )
14+ * [ 1.8 认识二分法] ( #18------ )
15+ * [ 1.9 认识异或运算] ( #19------- )
16+
17+
218# 1 时间复杂度、空间复杂度、排序、异或运算
319## 1.1 时间复杂度
420- 常数时间操作:
Original file line number Diff line number Diff line change 1- [ TOC]
21# 1 链表、栈、队列、递归、哈希
32
43## 1.1 链表
Original file line number Diff line number Diff line change 1- [ TOC]
21# 1 归并排序、随机快排
32
43## 1.1 归并排序
@@ -623,4 +622,4 @@ public class Code03_PartitionAndQuickSort {
623622 }
624623
625624}
626- ```
625+ ```
Original file line number Diff line number Diff line change 1- [ TOC]
21# 1 比较器与堆
32
43## 1.1 堆结构
Original file line number Diff line number Diff line change 1- [ TOC]
21# 1 前缀树结构(trie)、桶排序、排序总结
32
43## 1.1 前缀树结构
@@ -763,4 +762,4 @@ public class Code04_RadixSort {
763762
764763> 充分利用O(NlogN)和O(N^2)排序各自的优势:根据样本量底层基于多种排序实现,比如样本量比较小直接选择插入排序。
765764
766- > 比如Java中系统实现的快速排序
765+ > 比如Java中系统实现的快速排序
Original file line number Diff line number Diff line change 1- [ TOC]
21# 1 链表问题
32
43> 面试时链表解题的方法论
Original file line number Diff line number Diff line change 1- [ TOC]
21# 1 二叉树基本算法
32
43## 1.1 二叉树的遍历
@@ -1044,4 +1043,4 @@ public class Code08_PaperFolding {
10441043 printAllFolds(N );
10451044 }
10461045}
1047- ```
1046+ ```
Original file line number Diff line number Diff line change 1- [ TOC]
21# 1 二叉树的递归套路
32
431、 可以解决面试中的绝大部分二叉树(95%以上)的问题,尤其是树形dp问题
@@ -1316,4 +1315,4 @@ public class Code07_lowestAncestor {
13161315}
13171316```
13181317
1319- ==二叉树的递归套路,最终转化为基于X只找可能性即可。即树形DP问题==
1318+ ==二叉树的递归套路,最终转化为基于X只找可能性即可。即树形DP问题==
Original file line number Diff line number Diff line change 1- [ TOC]
2-
31# 1 贪心算法
42
53## 1.1 基本概念
Original file line number Diff line number Diff line change 1- [ TOC]
21# 1 并查集、图相关算法
32
43## 1.1 并查集
You can’t perform that action at this time.
0 commit comments