diff --git a/README.md b/README.md index 2ac493e8..f7df9db3 100644 --- a/README.md +++ b/README.md @@ -79,7 +79,7 @@
-
+
## :memo: 后记 diff --git a/docs/notes/Docker.md b/docs/notes/Docker.md index c78d3223..ed7226c4 100644 --- a/docs/notes/Docker.md +++ b/docs/notes/Docker.md @@ -91,4 +91,4 @@ Docker 轻量级的特点使得它很适合用于部署、维护、组合微服 - + diff --git a/docs/notes/Git.md b/docs/notes/Git.md index 500f7e88..890c61c1 100644 --- a/docs/notes/Git.md +++ b/docs/notes/Git.md @@ -162,4 +162,4 @@ $ ssh-keygen -t rsa -C "youremail@example.com" - + diff --git a/docs/notes/HTTP.md b/docs/notes/HTTP.md index 17268c17..3596cec7 100644 --- a/docs/notes/HTTP.md +++ b/docs/notes/HTTP.md @@ -881,4 +881,4 @@ DELETE /idX/delete HTTP/1.1 -> Returns 404 - + diff --git a/docs/notes/Java IO.md b/docs/notes/Java IO.md index 4382293f..42bdf491 100644 --- a/docs/notes/Java IO.md +++ b/docs/notes/Java IO.md @@ -622,4 +622,4 @@ NIO 与普通 I/O 的区别主要有以下两点： - + diff --git a/docs/notes/Java 基础.md b/docs/notes/Java 基础.md index 7639f65d..441c4a54 100644 --- a/docs/notes/Java 基础.md +++ b/docs/notes/Java 基础.md @@ -1435,4 +1435,4 @@ Java 注解是附加在代码中的一些元信息，用于一些工具在编译 - + diff --git a/docs/notes/Java 容器.md b/docs/notes/Java 容器.md index 32c66854..9fd4abe2 100644 --- a/docs/notes/Java 容器.md +++ b/docs/notes/Java 容器.md @@ -1113,4 +1113,4 @@ public final class ConcurrentCache { - + diff --git a/docs/notes/Java 并发.md b/docs/notes/Java 并发.md index 7301d197..567d1c99 100644 --- a/docs/notes/Java 并发.md +++ b/docs/notes/Java 并发.md @@ -1638,4 +1638,4 @@ JDK 1.6 引入了偏向锁和轻量级锁，从而让锁拥有了四个状态： - + diff --git a/docs/notes/Java 虚拟机.md b/docs/notes/Java 虚拟机.md index b563ef54..17c2e4a7 100644 --- a/docs/notes/Java 虚拟机.md +++ b/docs/notes/Java 虚拟机.md @@ -760,4 +760,4 @@ public class FileSystemClassLoader extends ClassLoader { - + diff --git a/docs/notes/Leetcode 题解 - 二分查找.md b/docs/notes/Leetcode 题解 - 二分查找.md index 32395aae..1545f5e8 100644 --- a/docs/notes/Leetcode 题解 - 二分查找.md +++ b/docs/notes/Leetcode 题解 - 二分查找.md @@ -293,4 +293,4 @@ private int binarySearch(int[] nums, int target) { - + diff --git a/docs/notes/Leetcode 题解 - 位运算.md b/docs/notes/Leetcode 题解 - 位运算.md index 08f05433..d9d9dd1e 100644 --- a/docs/notes/Leetcode 题解 - 位运算.md +++ b/docs/notes/Leetcode 题解 - 位运算.md @@ -420,4 +420,4 @@ public int[] countBits(int num) { - + diff --git a/docs/notes/Leetcode 题解 - 分治.md b/docs/notes/Leetcode 题解 - 分治.md index 46cccf0a..56b7e07f 100644 --- a/docs/notes/Leetcode 题解 - 分治.md +++ b/docs/notes/Leetcode 题解 - 分治.md @@ -108,4 +108,4 @@ private List generateSubtrees(int s, int e) { - + diff --git a/docs/notes/Leetcode 题解 - 动态规划.md b/docs/notes/Leetcode 题解 - 动态规划.md index 3b5dc43b..95b84333 100644 --- a/docs/notes/Leetcode 题解 - 动态规划.md +++ b/docs/notes/Leetcode 题解 - 动态规划.md @@ -1246,4 +1246,4 @@ public int minSteps(int n) { - + diff --git a/docs/notes/Leetcode 题解 - 双指针.md b/docs/notes/Leetcode 题解 - 双指针.md index 4a9307c1..b15b834b 100644 --- a/docs/notes/Leetcode 题解 - 双指针.md +++ b/docs/notes/Leetcode 题解 - 双指针.md @@ -242,4 +242,4 @@ private boolean isSubstr(String s, String target) { - + diff --git a/docs/notes/Leetcode 题解 - 哈希表.md b/docs/notes/Leetcode 题解 - 哈希表.md index 5665e718..54630a81 100644 --- a/docs/notes/Leetcode 题解 - 哈希表.md +++ b/docs/notes/Leetcode 题解 - 哈希表.md @@ -125,4 +125,4 @@ private int maxCount(Map countForNum) { - + diff --git a/docs/notes/Leetcode 题解 - 图.md b/docs/notes/Leetcode 题解 - 图.md index 24f67841..dc5eb304 100644 --- a/docs/notes/Leetcode 题解 - 图.md +++ b/docs/notes/Leetcode 题解 - 图.md @@ -259,4 +259,4 @@ private class UF { - + diff --git a/docs/notes/Leetcode 题解 - 字符串.md b/docs/notes/Leetcode 题解 - 字符串.md index ef755de3..3ac572b4 100644 --- a/docs/notes/Leetcode 题解 - 字符串.md +++ b/docs/notes/Leetcode 题解 - 字符串.md @@ -227,4 +227,4 @@ public int countBinarySubstrings(String s) { - + diff --git a/docs/notes/Leetcode 题解 - 排序.md b/docs/notes/Leetcode 题解 - 排序.md index 0264f627..595ac416 100644 --- a/docs/notes/Leetcode 题解 - 排序.md +++ b/docs/notes/Leetcode 题解 - 排序.md @@ -232,4 +232,4 @@ private void swap(int[] nums, int i, int j) { - + diff --git a/docs/notes/Leetcode 题解 - 搜索.md b/docs/notes/Leetcode 题解 - 搜索.md index 26cc98d0..0cf87000 100644 --- a/docs/notes/Leetcode 题解 - 搜索.md +++ b/docs/notes/Leetcode 题解 - 搜索.md @@ -1271,4 +1271,4 @@ private void backtracking(int row) { - + diff --git a/docs/notes/Leetcode 题解 - 数学.md b/docs/notes/Leetcode 题解 - 数学.md index a002d51b..eb7503b9 100644 --- a/docs/notes/Leetcode 题解 - 数学.md +++ b/docs/notes/Leetcode 题解 - 数学.md @@ -509,4 +509,4 @@ public int maximumProduct(int[] nums) { - + diff --git a/docs/notes/Leetcode 题解 - 数组与矩阵.md b/docs/notes/Leetcode 题解 - 数组与矩阵.md index f6d138ca..838746cb 100644 --- a/docs/notes/Leetcode 题解 - 数组与矩阵.md +++ b/docs/notes/Leetcode 题解 - 数组与矩阵.md @@ -435,4 +435,4 @@ public int maxChunksToSorted(int[] arr) { - + diff --git a/docs/notes/Leetcode 题解 - 栈和队列.md b/docs/notes/Leetcode 题解 - 栈和队列.md index b4d5e9af..17b707e6 100644 --- a/docs/notes/Leetcode 题解 - 栈和队列.md +++ b/docs/notes/Leetcode 题解 - 栈和队列.md @@ -222,4 +222,4 @@ public int[] nextGreaterElements(int[] nums) { - + diff --git a/docs/notes/Leetcode 题解 - 树.md b/docs/notes/Leetcode 题解 - 树.md index aa33e475..653e90f8 100644 --- a/docs/notes/Leetcode 题解 - 树.md +++ b/docs/notes/Leetcode 题解 - 树.md @@ -1122,4 +1122,4 @@ class MapSum { - + diff --git a/docs/notes/Leetcode 题解 - 目录.md b/docs/notes/Leetcode 题解 - 目录.md index 735e80c5..7b1748e1 100644 --- a/docs/notes/Leetcode 题解 - 目录.md +++ b/docs/notes/Leetcode 题解 - 目录.md @@ -37,4 +37,4 @@ - + diff --git a/docs/notes/Leetcode 题解 - 目录1.md b/docs/notes/Leetcode 题解 - 目录1.md index c8926ccc..2376d6ce 100644 --- a/docs/notes/Leetcode 题解 - 目录1.md +++ b/docs/notes/Leetcode 题解 - 目录1.md @@ -37,4 +37,4 @@ - + diff --git a/docs/notes/Leetcode 题解 - 贪心思想.md b/docs/notes/Leetcode 题解 - 贪心思想.md index 48d0e265..2b9fa8ce 100644 --- a/docs/notes/Leetcode 题解 - 贪心思想.md +++ b/docs/notes/Leetcode 题解 - 贪心思想.md @@ -370,4 +370,4 @@ private int char2Index(char c) { - + diff --git a/docs/notes/Leetcode 题解 - 链表.md b/docs/notes/Leetcode 题解 - 链表.md index 78a05ad3..0bd1fbd1 100644 --- a/docs/notes/Leetcode 题解 - 链表.md +++ b/docs/notes/Leetcode 题解 - 链表.md @@ -345,4 +345,4 @@ public ListNode oddEvenList(ListNode head) { - + diff --git a/docs/notes/Leetcode 题解.md b/docs/notes/Leetcode 题解.md index f436edc4..be9a7f1c 100644 --- a/docs/notes/Leetcode 题解.md +++ b/docs/notes/Leetcode 题解.md @@ -7,4 +7,4 @@ - + diff --git a/docs/notes/Leetcode-Database 题解.md b/docs/notes/Leetcode-Database 题解.md index 16322652..66f2bede 100644 --- a/docs/notes/Leetcode-Database 题解.md +++ b/docs/notes/Leetcode-Database 题解.md @@ -1007,4 +1007,4 @@ ORDER BY - + diff --git a/docs/notes/Linux.md b/docs/notes/Linux.md index bdfcc836..157168c3 100644 --- a/docs/notes/Linux.md +++ b/docs/notes/Linux.md @@ -1247,4 +1247,4 @@ options 参数主要有 WNOHANG 和 WUNTRACED 两个选项，WNOHANG 可以使 w - + diff --git a/docs/notes/MySQL.md b/docs/notes/MySQL.md index 41ea8c3e..497ec4aa 100644 --- a/docs/notes/MySQL.md +++ b/docs/notes/MySQL.md @@ -425,4 +425,4 @@ MySQL 提供了 FROM_UNIXTIME() 函数把 UNIX 时间戳转换为日期，并提 - + diff --git a/docs/notes/Redis.md b/docs/notes/Redis.md index 0f598d75..4a0fe6ae 100644 --- a/docs/notes/Redis.md +++ b/docs/notes/Redis.md @@ -610,4 +610,4 @@ Redis 没有关系型数据库中的表这一概念来将同种类型的数据 - + diff --git a/docs/notes/SQL.md b/docs/notes/SQL.md index d9411abf..e1ac7cc9 100644 --- a/docs/notes/SQL.md +++ b/docs/notes/SQL.md @@ -773,4 +773,4 @@ SET PASSWROD FOR myuser = Password('new_password'); - + diff --git a/docs/notes/Socket.md b/docs/notes/Socket.md index c2019f52..34170482 100644 --- a/docs/notes/Socket.md +++ b/docs/notes/Socket.md @@ -325,4 +325,4 @@ poll 没有最大描述符数量的限制，如果平台支持并且对实时性 - + diff --git a/docs/notes/代码可读性.md b/docs/notes/代码可读性.md index 534d949d..83c9a931 100644 --- a/docs/notes/代码可读性.md +++ b/docs/notes/代码可读性.md @@ -335,4 +335,4 @@ public int findClostElement(int[] arr) { - + diff --git a/docs/notes/代码风格规范.md b/docs/notes/代码风格规范.md index 0026afa3..275c4120 100644 --- a/docs/notes/代码风格规范.md +++ b/docs/notes/代码风格规范.md @@ -9,4 +9,4 @@ - + diff --git a/docs/notes/分布式.md b/docs/notes/分布式.md index 6d94735a..f9b3dd14 100644 --- a/docs/notes/分布式.md +++ b/docs/notes/分布式.md @@ -344,4 +344,4 @@ Raft 也是分布式一致性协议，主要是用来竞选主节点。 - + diff --git a/docs/notes/剑指 Offer 题解 - 10~19.md b/docs/notes/剑指 Offer 题解 - 10~19.md index 25f1de5b..81d109b1 100644 --- a/docs/notes/剑指 Offer 题解 - 10~19.md +++ b/docs/notes/剑指 Offer 题解 - 10~19.md @@ -694,4 +694,4 @@ public boolean match(char[] str, char[] pattern) { - + diff --git a/docs/notes/剑指 Offer 题解 - 20~29.md b/docs/notes/剑指 Offer 题解 - 20~29.md index 84200435..b6db7490 100644 --- a/docs/notes/剑指 Offer 题解 - 20~29.md +++ b/docs/notes/剑指 Offer 题解 - 20~29.md @@ -392,4 +392,4 @@ public ArrayList printMatrix(int[][] matrix) { - + diff --git a/docs/notes/剑指 Offer 题解 - 30~39.md b/docs/notes/剑指 Offer 题解 - 30~39.md index be702c90..436f2223 100644 --- a/docs/notes/剑指 Offer 题解 - 30~39.md +++ b/docs/notes/剑指 Offer 题解 - 30~39.md @@ -472,4 +472,4 @@ public int MoreThanHalfNum_Solution(int[] nums) { - + diff --git a/docs/notes/剑指 Offer 题解 - 3~9.md b/docs/notes/剑指 Offer 题解 - 3~9.md index 69acd6d9..b751df79 100644 --- a/docs/notes/剑指 Offer 题解 - 3~9.md +++ b/docs/notes/剑指 Offer 题解 - 3~9.md @@ -363,4 +363,4 @@ public int pop() throws Exception { - + diff --git a/docs/notes/剑指 Offer 题解 - 40~49.md b/docs/notes/剑指 Offer 题解 - 40~49.md index c51c8096..d47b4de7 100644 --- a/docs/notes/剑指 Offer 题解 - 40~49.md +++ b/docs/notes/剑指 Offer 题解 - 40~49.md @@ -420,4 +420,4 @@ public int GetUglyNumber_Solution(int N) { - + diff --git a/docs/notes/剑指 Offer 题解 - 50~59.md b/docs/notes/剑指 Offer 题解 - 50~59.md index 07878e11..f9491039 100644 --- a/docs/notes/剑指 Offer 题解 - 50~59.md +++ b/docs/notes/剑指 Offer 题解 - 50~59.md @@ -481,4 +481,4 @@ public ArrayList maxInWindows(int[] num, int size) { - + diff --git a/docs/notes/剑指 Offer 题解 - 60~68.md b/docs/notes/剑指 Offer 题解 - 60~68.md index a243e241..1318ee1b 100644 --- a/docs/notes/剑指 Offer 题解 - 60~68.md +++ b/docs/notes/剑指 Offer 题解 - 60~68.md @@ -324,4 +324,4 @@ public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { - + diff --git a/docs/notes/剑指 Offer 题解 - 目录.md b/docs/notes/剑指 Offer 题解 - 目录.md index 1244fcc0..76f6cce3 100644 --- a/docs/notes/剑指 Offer 题解 - 目录.md +++ b/docs/notes/剑指 Offer 题解 - 目录.md @@ -17,4 +17,4 @@ - + diff --git a/docs/notes/剑指 Offer 题解 - 目录1.md b/docs/notes/剑指 Offer 题解 - 目录1.md index 76c97f7e..83780c84 100644 --- a/docs/notes/剑指 Offer 题解 - 目录1.md +++ b/docs/notes/剑指 Offer 题解 - 目录1.md @@ -17,4 +17,4 @@ - + diff --git a/docs/notes/剑指 offer 题解.md b/docs/notes/剑指 offer 题解.md index 3a541a94..480d1171 100644 --- a/docs/notes/剑指 offer 题解.md +++ b/docs/notes/剑指 offer 题解.md @@ -7,4 +7,4 @@ - + diff --git a/docs/notes/攻击技术.md b/docs/notes/攻击技术.md index c5c9794b..1e9bd2c7 100644 --- a/docs/notes/攻击技术.md +++ b/docs/notes/攻击技术.md @@ -195,4 +195,4 @@ ResultSet rs = stmt.executeQuery(); - + diff --git a/docs/notes/数据库系统原理.md b/docs/notes/数据库系统原理.md index aa932871..eab4c13c 100644 --- a/docs/notes/数据库系统原理.md +++ b/docs/notes/数据库系统原理.md @@ -576,4 +576,4 @@ Entity-Relationship，有三个组成部分：实体、属性、联系。 - + diff --git a/docs/notes/构建工具.md b/docs/notes/构建工具.md index 4b9e1cc0..61d0f32e 100644 --- a/docs/notes/构建工具.md +++ b/docs/notes/构建工具.md @@ -143,4 +143,4 @@ A -> C -> X(2.0) - + diff --git a/docs/notes/正则表达式.md b/docs/notes/正则表达式.md index 08536120..ed8e8b9b 100644 --- a/docs/notes/正则表达式.md +++ b/docs/notes/正则表达式.md @@ -390,4 +390,4 @@ aBCd - + diff --git a/docs/notes/消息队列.md b/docs/notes/消息队列.md index 9c2a190d..562464b6 100644 --- a/docs/notes/消息队列.md +++ b/docs/notes/消息队列.md @@ -81,4 +81,4 @@ - + diff --git a/docs/notes/算法 - 其它.md b/docs/notes/算法 - 其它.md index 0050df20..beac1f85 100644 --- a/docs/notes/算法 - 其它.md +++ b/docs/notes/算法 - 其它.md @@ -136,4 +136,4 @@ public class Huffman { - + diff --git a/docs/notes/算法 - 并查集.md b/docs/notes/算法 - 并查集.md index 42af0b8a..7d9d6cb2 100644 --- a/docs/notes/算法 - 并查集.md +++ b/docs/notes/算法 - 并查集.md @@ -194,4 +194,4 @@ public class WeightedQuickUnionUF extends UF { - + diff --git a/docs/notes/算法 - 排序.md b/docs/notes/算法 - 排序.md index d2cd410b..74abbdfe 100644 --- a/docs/notes/算法 - 排序.md +++ b/docs/notes/算法 - 排序.md @@ -584,4 +584,4 @@ Java 主要排序方法为 java.util.Arrays.sort()，对于原始数据类型使 - + diff --git a/docs/notes/算法 - 栈和队列.md b/docs/notes/算法 - 栈和队列.md index 18efd101..cfe163da 100644 --- a/docs/notes/算法 - 栈和队列.md +++ b/docs/notes/算法 - 栈和队列.md @@ -320,4 +320,4 @@ public class ListQueue implements MyQueue { - + diff --git a/docs/notes/算法 - 目录.md b/docs/notes/算法 - 目录.md index 6f1630d0..f1b705eb 100644 --- a/docs/notes/算法 - 目录.md +++ b/docs/notes/算法 - 目录.md @@ -16,4 +16,4 @@ - + diff --git a/docs/notes/算法 - 目录1.md b/docs/notes/算法 - 目录1.md index 4084fe41..bd19055c 100644 --- a/docs/notes/算法 - 目录1.md +++ b/docs/notes/算法 - 目录1.md @@ -16,4 +16,4 @@ - + diff --git a/docs/notes/算法 - 符号表.md b/docs/notes/算法 - 符号表.md index 7c4e6e8d..8a7416dd 100644 --- a/docs/notes/算法 - 符号表.md +++ b/docs/notes/算法 - 符号表.md @@ -942,4 +942,4 @@ public class SparseVector { - + diff --git a/docs/notes/算法 - 算法分析.md b/docs/notes/算法 - 算法分析.md index d039e2b2..456743af 100644 --- a/docs/notes/算法 - 算法分析.md +++ b/docs/notes/算法 - 算法分析.md @@ -238,4 +238,4 @@ public class StopWatch { - + diff --git a/docs/notes/算法.md b/docs/notes/算法.md index a9ddc10e..8ca70f28 100644 --- a/docs/notes/算法.md +++ b/docs/notes/算法.md @@ -7,4 +7,4 @@ - + diff --git a/docs/notes/系统设计基础.md b/docs/notes/系统设计基础.md index f21806ba..25d5a141 100644 --- a/docs/notes/系统设计基础.md +++ b/docs/notes/系统设计基础.md @@ -111,4 +111,4 @@ - + diff --git a/docs/notes/缓存.md b/docs/notes/缓存.md index d1fdb091..3bbd9293 100644 --- a/docs/notes/缓存.md +++ b/docs/notes/缓存.md @@ -310,4 +310,4 @@ Distributed Hash Table（DHT） 是一种哈希分布方式，其目的是为了 - + diff --git a/docs/notes/计算机操作系统 - 内存管理.md b/docs/notes/计算机操作系统 - 内存管理.md index 0dffda0a..a6e658d4 100644 --- a/docs/notes/计算机操作系统 - 内存管理.md +++ b/docs/notes/计算机操作系统 - 内存管理.md @@ -142,4 +142,4 @@ FIFO 算法可能会把经常使用的页面置换出去，为了避免这一问 - + diff --git a/docs/notes/计算机操作系统 - 概述.md b/docs/notes/计算机操作系统 - 概述.md index ecea7bb9..87b01a31 100644 --- a/docs/notes/计算机操作系统 - 概述.md +++ b/docs/notes/计算机操作系统 - 概述.md @@ -124,4 +124,4 @@ Linux 的系统调用主要有以下这些： - + diff --git a/docs/notes/计算机操作系统 - 死锁.md b/docs/notes/计算机操作系统 - 死锁.md index 4796d3a8..f358985e 100644 --- a/docs/notes/计算机操作系统 - 死锁.md +++ b/docs/notes/计算机操作系统 - 死锁.md @@ -144,4 +144,4 @@ - + diff --git a/docs/notes/计算机操作系统 - 目录.md b/docs/notes/计算机操作系统 - 目录.md index 9974bac2..9fbc9e41 100644 --- a/docs/notes/计算机操作系统 - 目录.md +++ b/docs/notes/计算机操作系统 - 目录.md @@ -24,4 +24,4 @@ - + diff --git a/docs/notes/计算机操作系统 - 目录1.md b/docs/notes/计算机操作系统 - 目录1.md index 4a8693e9..ec8293ee 100644 --- a/docs/notes/计算机操作系统 - 目录1.md +++ b/docs/notes/计算机操作系统 - 目录1.md @@ -24,4 +24,4 @@ - + diff --git a/docs/notes/计算机操作系统 - 设备管理.md b/docs/notes/计算机操作系统 - 设备管理.md index 1106f830..319dde2d 100644 --- a/docs/notes/计算机操作系统 - 设备管理.md +++ b/docs/notes/计算机操作系统 - 设备管理.md @@ -61,4 +61,4 @@ - + diff --git a/docs/notes/计算机操作系统 - 进程管理.md b/docs/notes/计算机操作系统 - 进程管理.md index 7bd16668..2009e21b 100644 --- a/docs/notes/计算机操作系统 - 进程管理.md +++ b/docs/notes/计算机操作系统 - 进程管理.md @@ -590,4 +590,4 @@ FIFO 常用于客户-服务器应用程序中，FIFO 用作汇聚点，在客户 - + diff --git a/docs/notes/计算机操作系统 - 链接.md b/docs/notes/计算机操作系统 - 链接.md index 2bbb3bc5..336a7e8f 100644 --- a/docs/notes/计算机操作系统 - 链接.md +++ b/docs/notes/计算机操作系统 - 链接.md @@ -68,4 +68,4 @@ gcc -o hello hello.c - + diff --git a/docs/notes/计算机操作系统.md b/docs/notes/计算机操作系统.md index 46e6c060..a4417376 100644 --- a/docs/notes/计算机操作系统.md +++ b/docs/notes/计算机操作系统.md @@ -7,4 +7,4 @@ - + diff --git a/docs/notes/计算机网络 - 传输层.md b/docs/notes/计算机网络 - 传输层.md index 516b0606..85a1b030 100644 --- a/docs/notes/计算机网络 - 传输层.md +++ b/docs/notes/计算机网络 - 传输层.md @@ -167,4 +167,4 @@ TCP 主要通过四个算法来进行拥塞控制：慢开始、拥塞避免、 - + diff --git a/docs/notes/计算机网络 - 应用层.md b/docs/notes/计算机网络 - 应用层.md index f4df343b..c27cb460 100644 --- a/docs/notes/计算机网络 - 应用层.md +++ b/docs/notes/计算机网络 - 应用层.md @@ -168,4 +168,4 @@ IMAP 协议中客户端和服务器上的邮件保持同步，如果不手动删 - + diff --git a/docs/notes/计算机网络 - 概述.md b/docs/notes/计算机网络 - 概述.md index c40ba132..973c3e12 100644 --- a/docs/notes/计算机网络 - 概述.md +++ b/docs/notes/计算机网络 - 概述.md @@ -134,4 +134,4 @@ TCP/IP 体系结构不严格遵循 OSI 分层概念，应用层可能会直接 - + diff --git a/docs/notes/计算机网络 - 物理层.md b/docs/notes/计算机网络 - 物理层.md index a0246470..f22b8344 100644 --- a/docs/notes/计算机网络 - 物理层.md +++ b/docs/notes/计算机网络 - 物理层.md @@ -22,4 +22,4 @@ - + diff --git a/docs/notes/计算机网络 - 目录.md b/docs/notes/计算机网络 - 目录.md index 8d8fc405..388047bd 100644 --- a/docs/notes/计算机网络 - 目录.md +++ b/docs/notes/计算机网络 - 目录.md @@ -30,4 +30,4 @@ - + diff --git a/docs/notes/计算机网络 - 目录1.md b/docs/notes/计算机网络 - 目录1.md index 16ecce62..d1a65c88 100644 --- a/docs/notes/计算机网络 - 目录1.md +++ b/docs/notes/计算机网络 - 目录1.md @@ -31,4 +31,4 @@ - + diff --git a/docs/notes/计算机网络 - 网络层.md b/docs/notes/计算机网络 - 网络层.md index 41ba86a7..912db731 100644 --- a/docs/notes/计算机网络 - 网络层.md +++ b/docs/notes/计算机网络 - 网络层.md @@ -244,4 +244,4 @@ BGP 只能寻找一条比较好的路由，而不是最佳路由。 - + diff --git a/docs/notes/计算机网络 - 链路层.md b/docs/notes/计算机网络 - 链路层.md index ace4efa9..400e0dc7 100644 --- a/docs/notes/计算机网络 - 链路层.md +++ b/docs/notes/计算机网络 - 链路层.md @@ -198,4 +198,4 @@ MAC 地址是链路层地址，长度为 6 字节（48 位），用于唯一标 - + diff --git a/docs/notes/计算机网络.md b/docs/notes/计算机网络.md index 59eea4af..94ee713d 100644 --- a/docs/notes/计算机网络.md +++ b/docs/notes/计算机网络.md @@ -7,4 +7,4 @@ - + diff --git a/docs/notes/设计模式.md b/docs/notes/设计模式.md index 29bef1ef..d8de6475 100644 --- a/docs/notes/设计模式.md +++ b/docs/notes/设计模式.md @@ -3068,4 +3068,4 @@ public class ImageViewer { - + diff --git a/docs/notes/集群.md b/docs/notes/集群.md index dd5460bf..dbe64264 100644 --- a/docs/notes/集群.md +++ b/docs/notes/集群.md @@ -203,4 +203,4 @@ HTTP 重定向负载均衡服务器使用某种负载均衡算法计算得到服 - + diff --git a/docs/notes/面向对象思想.md b/docs/notes/面向对象思想.md index ff12bef7..512982dd 100644 --- a/docs/notes/面向对象思想.md +++ b/docs/notes/面向对象思想.md @@ -372,4 +372,4 @@ Vihicle .. N - + diff --git a/notes/Docker.md b/notes/Docker.md index 2c357082..19c37765 100644 --- a/notes/Docker.md +++ b/notes/Docker.md @@ -91,4 +91,4 @@ Docker 轻量级的特点使得它很适合用于部署、维护、组合微服 - + diff --git a/notes/Git.md b/notes/Git.md index 9e525f45..45a42594 100644 --- a/notes/Git.md +++ b/notes/Git.md @@ -162,4 +162,4 @@ $ ssh-keygen -t rsa -C "youremail@example.com" - + diff --git a/notes/HTTP.md b/notes/HTTP.md index 1e4d3990..960c8472 100644 --- a/notes/HTTP.md +++ b/notes/HTTP.md @@ -881,4 +881,4 @@ DELETE /idX/delete HTTP/1.1 -> Returns 404 - + diff --git a/notes/Java IO.md b/notes/Java IO.md index edaec5a7..83825ee4 100644 --- a/notes/Java IO.md +++ b/notes/Java IO.md @@ -622,4 +622,4 @@ NIO 与普通 I/O 的区别主要有以下两点： - + diff --git a/notes/Java 基础.md b/notes/Java 基础.md index a28f5bdf..610cd9e8 100644 --- a/notes/Java 基础.md +++ b/notes/Java 基础.md @@ -1435,4 +1435,4 @@ Java 注解是附加在代码中的一些元信息，用于一些工具在编译 - + diff --git a/notes/Java 容器.md b/notes/Java 容器.md index b7b8fea0..aa42a9f4 100644 --- a/notes/Java 容器.md +++ b/notes/Java 容器.md @@ -1113,4 +1113,4 @@ public final class ConcurrentCache { - + diff --git a/notes/Java 并发.md b/notes/Java 并发.md index da91a75a..6bce99c0 100644 --- a/notes/Java 并发.md +++ b/notes/Java 并发.md @@ -1638,4 +1638,4 @@ JDK 1.6 引入了偏向锁和轻量级锁，从而让锁拥有了四个状态： - + diff --git a/notes/Java 虚拟机.md b/notes/Java 虚拟机.md index 1495ca95..73bdd86c 100644 --- a/notes/Java 虚拟机.md +++ b/notes/Java 虚拟机.md @@ -760,4 +760,4 @@ public class FileSystemClassLoader extends ClassLoader { - + diff --git a/notes/Leetcode 题解 - 二分查找.md b/notes/Leetcode 题解 - 二分查找.md index 32395aae..1545f5e8 100644 --- a/notes/Leetcode 题解 - 二分查找.md +++ b/notes/Leetcode 题解 - 二分查找.md @@ -293,4 +293,4 @@ private int binarySearch(int[] nums, int target) { - + diff --git a/notes/Leetcode 题解 - 位运算.md b/notes/Leetcode 题解 - 位运算.md index 08f05433..d9d9dd1e 100644 --- a/notes/Leetcode 题解 - 位运算.md +++ b/notes/Leetcode 题解 - 位运算.md @@ -420,4 +420,4 @@ public int[] countBits(int num) { - + diff --git a/notes/Leetcode 题解 - 分治.md b/notes/Leetcode 题解 - 分治.md index 46cccf0a..56b7e07f 100644 --- a/notes/Leetcode 题解 - 分治.md +++ b/notes/Leetcode 题解 - 分治.md @@ -108,4 +108,4 @@ private List generateSubtrees(int s, int e) { - + diff --git a/notes/Leetcode 题解 - 动态规划.md b/notes/Leetcode 题解 - 动态规划.md index 81f8294e..395fc16a 100644 --- a/notes/Leetcode 题解 - 动态规划.md +++ b/notes/Leetcode 题解 - 动态规划.md @@ -1246,4 +1246,4 @@ public int minSteps(int n) { - + diff --git a/notes/Leetcode 题解 - 双指针.md b/notes/Leetcode 题解 - 双指针.md index 4a9307c1..b15b834b 100644 --- a/notes/Leetcode 题解 - 双指针.md +++ b/notes/Leetcode 题解 - 双指针.md @@ -242,4 +242,4 @@ private boolean isSubstr(String s, String target) { - + diff --git a/notes/Leetcode 题解 - 哈希表.md b/notes/Leetcode 题解 - 哈希表.md index 5665e718..54630a81 100644 --- a/notes/Leetcode 题解 - 哈希表.md +++ b/notes/Leetcode 题解 - 哈希表.md @@ -125,4 +125,4 @@ private int maxCount(Map countForNum) { - + diff --git a/notes/Leetcode 题解 - 图.md b/notes/Leetcode 题解 - 图.md index 24f67841..dc5eb304 100644 --- a/notes/Leetcode 题解 - 图.md +++ b/notes/Leetcode 题解 - 图.md @@ -259,4 +259,4 @@ private class UF { - + diff --git a/notes/Leetcode 题解 - 字符串.md b/notes/Leetcode 题解 - 字符串.md index ef755de3..3ac572b4 100644 --- a/notes/Leetcode 题解 - 字符串.md +++ b/notes/Leetcode 题解 - 字符串.md @@ -227,4 +227,4 @@ public int countBinarySubstrings(String s) { - + diff --git a/notes/Leetcode 题解 - 排序.md b/notes/Leetcode 题解 - 排序.md index 8d64d2a9..c1f843d7 100644 --- a/notes/Leetcode 题解 - 排序.md +++ b/notes/Leetcode 题解 - 排序.md @@ -232,4 +232,4 @@ private void swap(int[] nums, int i, int j) { - + diff --git a/notes/Leetcode 题解 - 搜索.md b/notes/Leetcode 题解 - 搜索.md index c5bfaed6..f97e7600 100644 --- a/notes/Leetcode 题解 - 搜索.md +++ b/notes/Leetcode 题解 - 搜索.md @@ -1271,4 +1271,4 @@ private void backtracking(int row) { - + diff --git a/notes/Leetcode 题解 - 数学.md b/notes/Leetcode 题解 - 数学.md index a002d51b..eb7503b9 100644 --- a/notes/Leetcode 题解 - 数学.md +++ b/notes/Leetcode 题解 - 数学.md @@ -509,4 +509,4 @@ public int maximumProduct(int[] nums) { - + diff --git a/notes/Leetcode 题解 - 数组与矩阵.md b/notes/Leetcode 题解 - 数组与矩阵.md index f6d138ca..838746cb 100644 --- a/notes/Leetcode 题解 - 数组与矩阵.md +++ b/notes/Leetcode 题解 - 数组与矩阵.md @@ -435,4 +435,4 @@ public int maxChunksToSorted(int[] arr) { - + diff --git a/notes/Leetcode 题解 - 栈和队列.md b/notes/Leetcode 题解 - 栈和队列.md index b4d5e9af..17b707e6 100644 --- a/notes/Leetcode 题解 - 栈和队列.md +++ b/notes/Leetcode 题解 - 栈和队列.md @@ -222,4 +222,4 @@ public int[] nextGreaterElements(int[] nums) { - + diff --git a/notes/Leetcode 题解 - 树.md b/notes/Leetcode 题解 - 树.md index 59aef5b4..3c054ea7 100644 --- a/notes/Leetcode 题解 - 树.md +++ b/notes/Leetcode 题解 - 树.md @@ -1122,4 +1122,4 @@ class MapSum { - + diff --git a/notes/Leetcode 题解 - 目录.md b/notes/Leetcode 题解 - 目录.md index 735e80c5..7b1748e1 100644 --- a/notes/Leetcode 题解 - 目录.md +++ b/notes/Leetcode 题解 - 目录.md @@ -37,4 +37,4 @@ - + diff --git a/notes/Leetcode 题解 - 目录1.md b/notes/Leetcode 题解 - 目录1.md index c8926ccc..2376d6ce 100644 --- a/notes/Leetcode 题解 - 目录1.md +++ b/notes/Leetcode 题解 - 目录1.md @@ -37,4 +37,4 @@ - + diff --git a/notes/Leetcode 题解 - 贪心思想.md b/notes/Leetcode 题解 - 贪心思想.md index 48d0e265..2b9fa8ce 100644 --- a/notes/Leetcode 题解 - 贪心思想.md +++ b/notes/Leetcode 题解 - 贪心思想.md @@ -370,4 +370,4 @@ private int char2Index(char c) { - + diff --git a/notes/Leetcode 题解 - 链表.md b/notes/Leetcode 题解 - 链表.md index 78a05ad3..0bd1fbd1 100644 --- a/notes/Leetcode 题解 - 链表.md +++ b/notes/Leetcode 题解 - 链表.md @@ -345,4 +345,4 @@ public ListNode oddEvenList(ListNode head) { - + diff --git a/notes/Leetcode 题解.md b/notes/Leetcode 题解.md index f436edc4..be9a7f1c 100644 --- a/notes/Leetcode 题解.md +++ b/notes/Leetcode 题解.md @@ -7,4 +7,4 @@ - + diff --git a/notes/Leetcode-Database 题解.md b/notes/Leetcode-Database 题解.md index 16322652..66f2bede 100644 --- a/notes/Leetcode-Database 题解.md +++ b/notes/Leetcode-Database 题解.md @@ -1007,4 +1007,4 @@ ORDER BY - + diff --git a/notes/Linux.md b/notes/Linux.md index c7c5f8d0..1e0419ad 100644 --- a/notes/Linux.md +++ b/notes/Linux.md @@ -1247,4 +1247,4 @@ options 参数主要有 WNOHANG 和 WUNTRACED 两个选项，WNOHANG 可以使 w - + diff --git a/notes/MySQL.md b/notes/MySQL.md index 4a6790b3..bf479e83 100644 --- a/notes/MySQL.md +++ b/notes/MySQL.md @@ -425,4 +425,4 @@ MySQL 提供了 FROM_UNIXTIME() 函数把 UNIX 时间戳转换为日期，并提 - + diff --git a/notes/Redis.md b/notes/Redis.md index 94c8c131..c4af2226 100644 --- a/notes/Redis.md +++ b/notes/Redis.md @@ -610,4 +610,4 @@ Redis 没有关系型数据库中的表这一概念来将同种类型的数据 - + diff --git a/notes/SQL.md b/notes/SQL.md index d9411abf..e1ac7cc9 100644 --- a/notes/SQL.md +++ b/notes/SQL.md @@ -773,4 +773,4 @@ SET PASSWROD FOR myuser = Password('new_password'); - + diff --git a/notes/Socket.md b/notes/Socket.md index c6c9718a..9a03bd93 100644 --- a/notes/Socket.md +++ b/notes/Socket.md @@ -325,4 +325,4 @@ poll 没有最大描述符数量的限制，如果平台支持并且对实时性 - + diff --git a/notes/代码可读性.md b/notes/代码可读性.md index 110fd224..01010aa3 100644 --- a/notes/代码可读性.md +++ b/notes/代码可读性.md @@ -335,4 +335,4 @@ public int findClostElement(int[] arr) { - + diff --git a/notes/代码风格规范.md b/notes/代码风格规范.md index 0026afa3..275c4120 100644 --- a/notes/代码风格规范.md +++ b/notes/代码风格规范.md @@ -9,4 +9,4 @@ - + diff --git a/notes/分布式.md b/notes/分布式.md index db66a51f..e5d64364 100644 --- a/notes/分布式.md +++ b/notes/分布式.md @@ -344,4 +344,4 @@ Raft 也是分布式一致性协议，主要是用来竞选主节点。 - + diff --git a/notes/剑指 Offer 题解 - 10~19.md b/notes/剑指 Offer 题解 - 10~19.md index 02b5a399..14d34bad 100644 --- a/notes/剑指 Offer 题解 - 10~19.md +++ b/notes/剑指 Offer 题解 - 10~19.md @@ -694,4 +694,4 @@ public boolean match(char[] str, char[] pattern) { - + diff --git a/notes/剑指 Offer 题解 - 20~29.md b/notes/剑指 Offer 题解 - 20~29.md index 4d8ee693..2eaf5d91 100644 --- a/notes/剑指 Offer 题解 - 20~29.md +++ b/notes/剑指 Offer 题解 - 20~29.md @@ -392,4 +392,4 @@ public ArrayList printMatrix(int[][] matrix) { - + diff --git a/notes/剑指 Offer 题解 - 30~39.md b/notes/剑指 Offer 题解 - 30~39.md index b586d4a7..2d690002 100644 --- a/notes/剑指 Offer 题解 - 30~39.md +++ b/notes/剑指 Offer 题解 - 30~39.md @@ -472,4 +472,4 @@ public int MoreThanHalfNum_Solution(int[] nums) { - + diff --git a/notes/剑指 Offer 题解 - 3~9.md b/notes/剑指 Offer 题解 - 3~9.md index 8192bb06..17097389 100644 --- a/notes/剑指 Offer 题解 - 3~9.md +++ b/notes/剑指 Offer 题解 - 3~9.md @@ -363,4 +363,4 @@ public int pop() throws Exception { - + diff --git a/notes/剑指 Offer 题解 - 40~49.md b/notes/剑指 Offer 题解 - 40~49.md index c51c8096..d47b4de7 100644 --- a/notes/剑指 Offer 题解 - 40~49.md +++ b/notes/剑指 Offer 题解 - 40~49.md @@ -420,4 +420,4 @@ public int GetUglyNumber_Solution(int N) { - + diff --git a/notes/剑指 Offer 题解 - 50~59.md b/notes/剑指 Offer 题解 - 50~59.md index 27d0e2bd..c80f8f72 100644 --- a/notes/剑指 Offer 题解 - 50~59.md +++ b/notes/剑指 Offer 题解 - 50~59.md @@ -481,4 +481,4 @@ public ArrayList maxInWindows(int[] num, int size) { - + diff --git a/notes/剑指 Offer 题解 - 60~68.md b/notes/剑指 Offer 题解 - 60~68.md index 845f1e40..af13d3ef 100644 --- a/notes/剑指 Offer 题解 - 60~68.md +++ b/notes/剑指 Offer 题解 - 60~68.md @@ -324,4 +324,4 @@ public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { - + diff --git a/notes/剑指 Offer 题解 - 目录.md b/notes/剑指 Offer 题解 - 目录.md index 1244fcc0..76f6cce3 100644 --- a/notes/剑指 Offer 题解 - 目录.md +++ b/notes/剑指 Offer 题解 - 目录.md @@ -17,4 +17,4 @@ - + diff --git a/notes/剑指 Offer 题解 - 目录1.md b/notes/剑指 Offer 题解 - 目录1.md index 76c97f7e..83780c84 100644 --- a/notes/剑指 Offer 题解 - 目录1.md +++ b/notes/剑指 Offer 题解 - 目录1.md @@ -17,4 +17,4 @@ - + diff --git a/notes/剑指 offer 题解.md b/notes/剑指 offer 题解.md index 3a541a94..480d1171 100644 --- a/notes/剑指 offer 题解.md +++ b/notes/剑指 offer 题解.md @@ -7,4 +7,4 @@ - + diff --git a/notes/攻击技术.md b/notes/攻击技术.md index c5c9794b..1e9bd2c7 100644 --- a/notes/攻击技术.md +++ b/notes/攻击技术.md @@ -195,4 +195,4 @@ ResultSet rs = stmt.executeQuery(); - + diff --git a/notes/数据库系统原理.md b/notes/数据库系统原理.md index 2c5a3b81..32f34f9e 100644 --- a/notes/数据库系统原理.md +++ b/notes/数据库系统原理.md @@ -576,4 +576,4 @@ Entity-Relationship，有三个组成部分：实体、属性、联系。 - + diff --git a/notes/构建工具.md b/notes/构建工具.md index 4c3e246c..88241960 100644 --- a/notes/构建工具.md +++ b/notes/构建工具.md @@ -143,4 +143,4 @@ A -> C -> X(2.0) - + diff --git a/notes/正则表达式.md b/notes/正则表达式.md index 8b1dfa93..9b2951ed 100644 --- a/notes/正则表达式.md +++ b/notes/正则表达式.md @@ -390,4 +390,4 @@ aBCd - + diff --git a/notes/消息队列.md b/notes/消息队列.md index 5142656e..a19162ec 100644 --- a/notes/消息队列.md +++ b/notes/消息队列.md @@ -81,4 +81,4 @@ - + diff --git a/notes/算法 - 其它.md b/notes/算法 - 其它.md index e7aaed5d..7b6e803c 100644 --- a/notes/算法 - 其它.md +++ b/notes/算法 - 其它.md @@ -136,4 +136,4 @@ public class Huffman { - + diff --git a/notes/算法 - 并查集.md b/notes/算法 - 并查集.md index 5487935e..2ef29c45 100644 --- a/notes/算法 - 并查集.md +++ b/notes/算法 - 并查集.md @@ -194,4 +194,4 @@ public class WeightedQuickUnionUF extends UF { - + diff --git a/notes/算法 - 排序.md b/notes/算法 - 排序.md index 33bca09d..bf9f1ac0 100644 --- a/notes/算法 - 排序.md +++ b/notes/算法 - 排序.md @@ -584,4 +584,4 @@ Java 主要排序方法为 java.util.Arrays.sort()，对于原始数据类型使 - + diff --git a/notes/算法 - 栈和队列.md b/notes/算法 - 栈和队列.md index 18efd101..cfe163da 100644 --- a/notes/算法 - 栈和队列.md +++ b/notes/算法 - 栈和队列.md @@ -320,4 +320,4 @@ public class ListQueue implements MyQueue { - + diff --git a/notes/算法 - 目录.md b/notes/算法 - 目录.md index 6f1630d0..f1b705eb 100644 --- a/notes/算法 - 目录.md +++ b/notes/算法 - 目录.md @@ -16,4 +16,4 @@ - + diff --git a/notes/算法 - 目录1.md b/notes/算法 - 目录1.md index 4084fe41..bd19055c 100644 --- a/notes/算法 - 目录1.md +++ b/notes/算法 - 目录1.md @@ -16,4 +16,4 @@ - + diff --git a/notes/算法 - 符号表.md b/notes/算法 - 符号表.md index a440c193..9d449893 100644 --- a/notes/算法 - 符号表.md +++ b/notes/算法 - 符号表.md @@ -942,4 +942,4 @@ public class SparseVector { - + diff --git a/notes/算法 - 算法分析.md b/notes/算法 - 算法分析.md index d039e2b2..456743af 100644 --- a/notes/算法 - 算法分析.md +++ b/notes/算法 - 算法分析.md @@ -238,4 +238,4 @@ public class StopWatch { - + diff --git a/notes/算法.md b/notes/算法.md index a9ddc10e..8ca70f28 100644 --- a/notes/算法.md +++ b/notes/算法.md @@ -7,4 +7,4 @@ - + diff --git a/notes/系统设计基础.md b/notes/系统设计基础.md index f21806ba..25d5a141 100644 --- a/notes/系统设计基础.md +++ b/notes/系统设计基础.md @@ -111,4 +111,4 @@ - + diff --git a/notes/缓存.md b/notes/缓存.md index ae270862..3467ba63 100644 --- a/notes/缓存.md +++ b/notes/缓存.md @@ -310,4 +310,4 @@ Distributed Hash Table（DHT） 是一种哈希分布方式，其目的是为了 - + diff --git a/notes/计算机操作系统 - 内存管理.md b/notes/计算机操作系统 - 内存管理.md index 30b0ca15..d9fcdb12 100644 --- a/notes/计算机操作系统 - 内存管理.md +++ b/notes/计算机操作系统 - 内存管理.md @@ -142,4 +142,4 @@ FIFO 算法可能会把经常使用的页面置换出去，为了避免这一问 - + diff --git a/notes/计算机操作系统 - 概述.md b/notes/计算机操作系统 - 概述.md index af5cdf55..396478dd 100644 --- a/notes/计算机操作系统 - 概述.md +++ b/notes/计算机操作系统 - 概述.md @@ -124,4 +124,4 @@ Linux 的系统调用主要有以下这些： - + diff --git a/notes/计算机操作系统 - 死锁.md b/notes/计算机操作系统 - 死锁.md index ab169cb7..95aa484b 100644 --- a/notes/计算机操作系统 - 死锁.md +++ b/notes/计算机操作系统 - 死锁.md @@ -144,4 +144,4 @@ - + diff --git a/notes/计算机操作系统 - 目录.md b/notes/计算机操作系统 - 目录.md index 9974bac2..9fbc9e41 100644 --- a/notes/计算机操作系统 - 目录.md +++ b/notes/计算机操作系统 - 目录.md @@ -24,4 +24,4 @@ - + diff --git a/notes/计算机操作系统 - 目录1.md b/notes/计算机操作系统 - 目录1.md index 4a8693e9..ec8293ee 100644 --- a/notes/计算机操作系统 - 目录1.md +++ b/notes/计算机操作系统 - 目录1.md @@ -24,4 +24,4 @@ - + diff --git a/notes/计算机操作系统 - 设备管理.md b/notes/计算机操作系统 - 设备管理.md index ef2d9c66..4e42bfb9 100644 --- a/notes/计算机操作系统 - 设备管理.md +++ b/notes/计算机操作系统 - 设备管理.md @@ -61,4 +61,4 @@ - + diff --git a/notes/计算机操作系统 - 进程管理.md b/notes/计算机操作系统 - 进程管理.md index 25c99735..40fb83d2 100644 --- a/notes/计算机操作系统 - 进程管理.md +++ b/notes/计算机操作系统 - 进程管理.md @@ -590,4 +590,4 @@ FIFO 常用于客户-服务器应用程序中，FIFO 用作汇聚点，在客户 - + diff --git a/notes/计算机操作系统 - 链接.md b/notes/计算机操作系统 - 链接.md index 6ba77fea..1e6c95fc 100644 --- a/notes/计算机操作系统 - 链接.md +++ b/notes/计算机操作系统 - 链接.md @@ -68,4 +68,4 @@ gcc -o hello hello.c - + diff --git a/notes/计算机操作系统.md b/notes/计算机操作系统.md index 46e6c060..a4417376 100644 --- a/notes/计算机操作系统.md +++ b/notes/计算机操作系统.md @@ -7,4 +7,4 @@ - + diff --git a/notes/计算机网络 - 传输层.md b/notes/计算机网络 - 传输层.md index 6645072b..270ea743 100644 --- a/notes/计算机网络 - 传输层.md +++ b/notes/计算机网络 - 传输层.md @@ -167,4 +167,4 @@ TCP 主要通过四个算法来进行拥塞控制：慢开始、拥塞避免、 - + diff --git a/notes/计算机网络 - 应用层.md b/notes/计算机网络 - 应用层.md index eab568e3..545b5709 100644 --- a/notes/计算机网络 - 应用层.md +++ b/notes/计算机网络 - 应用层.md @@ -168,4 +168,4 @@ IMAP 协议中客户端和服务器上的邮件保持同步，如果不手动删 - + diff --git a/notes/计算机网络 - 概述.md b/notes/计算机网络 - 概述.md index 2c12deaa..59eb905a 100644 --- a/notes/计算机网络 - 概述.md +++ b/notes/计算机网络 - 概述.md @@ -134,4 +134,4 @@ TCP/IP 体系结构不严格遵循 OSI 分层概念，应用层可能会直接 - + diff --git a/notes/计算机网络 - 物理层.md b/notes/计算机网络 - 物理层.md index 51cb179f..76a7a55a 100644 --- a/notes/计算机网络 - 物理层.md +++ b/notes/计算机网络 - 物理层.md @@ -22,4 +22,4 @@ - + diff --git a/notes/计算机网络 - 目录.md b/notes/计算机网络 - 目录.md index 8d8fc405..388047bd 100644 --- a/notes/计算机网络 - 目录.md +++ b/notes/计算机网络 - 目录.md @@ -30,4 +30,4 @@ - + diff --git a/notes/计算机网络 - 目录1.md b/notes/计算机网络 - 目录1.md index 16ecce62..d1a65c88 100644 --- a/notes/计算机网络 - 目录1.md +++ b/notes/计算机网络 - 目录1.md @@ -31,4 +31,4 @@ - + diff --git a/notes/计算机网络 - 网络层.md b/notes/计算机网络 - 网络层.md index fd679d2e..6204eb94 100644 --- a/notes/计算机网络 - 网络层.md +++ b/notes/计算机网络 - 网络层.md @@ -244,4 +244,4 @@ BGP 只能寻找一条比较好的路由，而不是最佳路由。 - + diff --git a/notes/计算机网络 - 链路层.md b/notes/计算机网络 - 链路层.md index fd02eb58..9014a26e 100644 --- a/notes/计算机网络 - 链路层.md +++ b/notes/计算机网络 - 链路层.md @@ -198,4 +198,4 @@ MAC 地址是链路层地址，长度为 6 字节（48 位），用于唯一标 - + diff --git a/notes/计算机网络.md b/notes/计算机网络.md index 59eea4af..94ee713d 100644 --- a/notes/计算机网络.md +++ b/notes/计算机网络.md @@ -7,4 +7,4 @@ - + diff --git a/notes/设计模式.md b/notes/设计模式.md index 5d8fcf7f..90a1657c 100644 --- a/notes/设计模式.md +++ b/notes/设计模式.md @@ -3068,4 +3068,4 @@ public class ImageViewer { - + diff --git a/notes/集群.md b/notes/集群.md index c4adcd78..c2394311 100644 --- a/notes/集群.md +++ b/notes/集群.md @@ -203,4 +203,4 @@ HTTP 重定向负载均衡服务器使用某种负载均衡算法计算得到服 - + diff --git a/notes/面向对象思想.md b/notes/面向对象思想.md index a592423f..f54893e4 100644 --- a/notes/面向对象思想.md +++ b/notes/面向对象思想.md @@ -372,4 +372,4 @@ Vihicle .. N - + diff --git a/other/download.md b/other/download.md index 613af45b..28a67a47 100644 --- a/other/download.md +++ b/other/download.md @@ -30,5 +30,5 @@ 离线版本由公众号 **CyC2018** 发布，最新版本也会在上面及时发布，在公众号后台回复 **离线下载** 即可获取下载链接。 -
+