diff --git a/docs/notes/Docker.md b/docs/notes/Docker.md index b92ec80d..c78d3223 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 4cf1180f..500f7e88 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 520c786a..17268c17 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 f76d05be..4382293f 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 9b5e507e..7639f65d 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 effb1f01..32c66854 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 7178d356..7301d197 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 9c52a00e..b563ef54 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 956ab853..32395aae 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 d84d242a..08f05433 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 71cd4791..46cccf0a 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 8a3262a3..3b5dc43b 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 efe90a11..4a9307c1 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 5fa392a8..5665e718 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 d0c11504..24f67841 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 29546d42..ef755de3 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 f126e00e..0264f627 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 8706d678..26cc98d0 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 70fd61bf..a002d51b 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 b0b94010..f6d138ca 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 7f354a44..b4d5e9af 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 32212a27..aa33e475 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 aee75e3a..735e80c5 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 db521b52..c8926ccc 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 dc194537..48d0e265 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 56d6dcf9..78a05ad3 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 dc20c006..f436edc4 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 8a017576..16322652 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 dbbd8212..bdfcc836 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 319fa90a..41ea8c3e 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 1b3f53d4..c057e3bb 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 93aac8bd..d9411abf 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 51c0e5d2..c2019f52 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 5e7dcfb8..534d949d 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 8c0eaa99..0026afa3 100644 --- a/docs/notes/代码风格规范.md +++ b/docs/notes/代码风格规范.md @@ -9,4 +9,4 @@ - + diff --git a/docs/notes/分布式.md b/docs/notes/分布式.md index 1cc8e579..6d94735a 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 f9dcd729..25f1de5b 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 45278331..84200435 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 413a5de5..be702c90 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 12259bc9..69acd6d9 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 c45352e0..c51c8096 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 45ef793e..07878e11 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 73e10f2e..a243e241 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 8fc29141..1244fcc0 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 78a50152..76c97f7e 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 1e3382c0..3a541a94 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 24fb4be3..c5c9794b 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 c828c7cd..aa932871 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 1c9dd7e4..4b9e1cc0 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 83d4fa40..08536120 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 b3c3fff7..9c2a190d 100644 --- a/docs/notes/消息队列.md +++ b/docs/notes/消息队列.md @@ -81,4 +81,4 @@ - + diff --git a/docs/notes/算法 - 其它.md b/docs/notes/算法 - 其它.md index 669e8c61..0050df20 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 6ed31071..42af0b8a 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 c4b1ef70..d2cd410b 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 70c519c4..18efd101 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 d76ed7ab..6f1630d0 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 118de6d5..4084fe41 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 c8b99804..7c4e6e8d 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 a8df2822..d039e2b2 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 c905bec3..a9ddc10e 100644 --- a/docs/notes/算法.md +++ b/docs/notes/算法.md @@ -7,4 +7,4 @@ - + diff --git a/docs/notes/系统设计基础.md b/docs/notes/系统设计基础.md index b667949c..f21806ba 100644 --- a/docs/notes/系统设计基础.md +++ b/docs/notes/系统设计基础.md @@ -111,4 +111,4 @@ - + diff --git a/docs/notes/缓存.md b/docs/notes/缓存.md index 349216a8..d1fdb091 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 3e613abe..0dffda0a 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 0be0b0c2..ecea7bb9 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 392bbede..4796d3a8 100644 --- a/docs/notes/计算机操作系统 - 死锁.md +++ b/docs/notes/计算机操作系统 - 死锁.md @@ -144,4 +144,4 @@ - + diff --git a/docs/notes/计算机操作系统 - 目录.md b/docs/notes/计算机操作系统 - 目录.md index 924ee84e..9974bac2 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 7e124b0a..4a8693e9 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 d5b4fa59..1106f830 100644 --- a/docs/notes/计算机操作系统 - 设备管理.md +++ b/docs/notes/计算机操作系统 - 设备管理.md @@ -61,4 +61,4 @@ - + diff --git a/docs/notes/计算机操作系统 - 进程管理.md b/docs/notes/计算机操作系统 - 进程管理.md index 1a073988..7bd16668 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 24075458..2bbb3bc5 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 cace093e..46e6c060 100644 --- a/docs/notes/计算机操作系统.md +++ b/docs/notes/计算机操作系统.md @@ -7,4 +7,4 @@ - + diff --git a/docs/notes/计算机网络 - 传输层.md b/docs/notes/计算机网络 - 传输层.md index dc4558ae..516b0606 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 08f647eb..f4df343b 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 b5286330..c40ba132 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 29620ae1..a0246470 100644 --- a/docs/notes/计算机网络 - 物理层.md +++ b/docs/notes/计算机网络 - 物理层.md @@ -22,4 +22,4 @@ - + diff --git a/docs/notes/计算机网络 - 目录.md b/docs/notes/计算机网络 - 目录.md index f5f41ea3..8d8fc405 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 7db42895..16ecce62 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 d770d885..41ba86a7 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 1aecaefe..ace4efa9 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 a36f9f35..59eea4af 100644 --- a/docs/notes/计算机网络.md +++ b/docs/notes/计算机网络.md @@ -7,4 +7,4 @@ - + diff --git a/docs/notes/设计模式.md b/docs/notes/设计模式.md index 7e7e50af..29bef1ef 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 94667826..dd5460bf 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 a1a96cc0..ff12bef7 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 072d99f7..2c357082 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 fce8916e..9e525f45 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 cc3b9941..1e4d3990 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 54e132a3..edaec5a7 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 651b128a..a28f5bdf 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 75eee7d3..b7b8fea0 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 dbd2ff7b..da91a75a 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 7822b17c..1495ca95 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 956ab853..32395aae 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 d84d242a..08f05433 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 71cd4791..46cccf0a 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 c9719691..81f8294e 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 efe90a11..4a9307c1 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 5fa392a8..5665e718 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 d0c11504..24f67841 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 29546d42..ef755de3 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 6c625c4f..8d64d2a9 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 65964d2e..c5bfaed6 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 70fd61bf..a002d51b 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 b0b94010..f6d138ca 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 7f354a44..b4d5e9af 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 727ef9ef..59aef5b4 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 aee75e3a..735e80c5 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 db521b52..c8926ccc 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 dc194537..48d0e265 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 56d6dcf9..78a05ad3 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 dc20c006..f436edc4 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 8a017576..16322652 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 57b1d3a0..c7c5f8d0 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 5f95123f..4a6790b3 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 ca7066e3..09f79404 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 93aac8bd..d9411abf 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 20defc1b..c6c9718a 100644 --- a/notes/Socket.md +++ b/notes/Socket.md @@ -325,4 +325,4 @@ poll 没有最大描述符数量的限制，如果平台支持并且对实时性 - + diff --git a/notes/代码可读性.md b/notes/代码可读性.md index 353358d2..110fd224 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 8c0eaa99..0026afa3 100644 --- a/notes/代码风格规范.md +++ b/notes/代码风格规范.md @@ -9,4 +9,4 @@ - + diff --git a/notes/分布式.md b/notes/分布式.md index 6c5218f1..db66a51f 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 8ca53477..02b5a399 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 2eaaa8c8..4d8ee693 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 ac200270..b586d4a7 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 696d5d4a..8192bb06 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 c45352e0..c51c8096 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 510c178a..27d0e2bd 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 d229f51a..845f1e40 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 8fc29141..1244fcc0 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 78a50152..76c97f7e 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 1e3382c0..3a541a94 100644 --- a/notes/剑指 offer 题解.md +++ b/notes/剑指 offer 题解.md @@ -7,4 +7,4 @@ - + diff --git a/notes/攻击技术.md b/notes/攻击技术.md index 24fb4be3..c5c9794b 100644 --- a/notes/攻击技术.md +++ b/notes/攻击技术.md @@ -195,4 +195,4 @@ ResultSet rs = stmt.executeQuery(); - + diff --git a/notes/数据库系统原理.md b/notes/数据库系统原理.md index aba5047a..2c5a3b81 100644 --- a/notes/数据库系统原理.md +++ b/notes/数据库系统原理.md @@ -576,4 +576,4 @@ Entity-Relationship，有三个组成部分：实体、属性、联系。 - + diff --git a/notes/构建工具.md b/notes/构建工具.md index b0faf6fe..4c3e246c 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 0a871f02..8b1dfa93 100644 --- a/notes/正则表达式.md +++ b/notes/正则表达式.md @@ -390,4 +390,4 @@ aBCd - + diff --git a/notes/消息队列.md b/notes/消息队列.md index d30eb557..5142656e 100644 --- a/notes/消息队列.md +++ b/notes/消息队列.md @@ -81,4 +81,4 @@ - + diff --git a/notes/算法 - 其它.md b/notes/算法 - 其它.md index 796d7a04..e7aaed5d 100644 --- a/notes/算法 - 其它.md +++ b/notes/算法 - 其它.md @@ -136,4 +136,4 @@ public class Huffman { - + diff --git a/notes/算法 - 并查集.md b/notes/算法 - 并查集.md index f8f28548..5487935e 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 389abcdf..33bca09d 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 70c519c4..18efd101 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 d76ed7ab..6f1630d0 100644 --- a/notes/算法 - 目录.md +++ b/notes/算法 - 目录.md @@ -16,4 +16,4 @@ - + diff --git a/notes/算法 - 目录1.md b/notes/算法 - 目录1.md index 118de6d5..4084fe41 100644 --- a/notes/算法 - 目录1.md +++ b/notes/算法 - 目录1.md @@ -16,4 +16,4 @@ - + diff --git a/notes/算法 - 符号表.md b/notes/算法 - 符号表.md index 5524e3dd..a440c193 100644 --- a/notes/算法 - 符号表.md +++ b/notes/算法 - 符号表.md @@ -942,4 +942,4 @@ public class SparseVector { - + diff --git a/notes/算法 - 算法分析.md b/notes/算法 - 算法分析.md index a8df2822..d039e2b2 100644 --- a/notes/算法 - 算法分析.md +++ b/notes/算法 - 算法分析.md @@ -238,4 +238,4 @@ public class StopWatch { - + diff --git a/notes/算法.md b/notes/算法.md index c905bec3..a9ddc10e 100644 --- a/notes/算法.md +++ b/notes/算法.md @@ -7,4 +7,4 @@ - + diff --git a/notes/系统设计基础.md b/notes/系统设计基础.md index b667949c..f21806ba 100644 --- a/notes/系统设计基础.md +++ b/notes/系统设计基础.md @@ -111,4 +111,4 @@ - + diff --git a/notes/缓存.md b/notes/缓存.md index 326ada18..ae270862 100644 --- a/notes/缓存.md +++ b/notes/缓存.md @@ -310,4 +310,4 @@ Distributed Hash Table（DHT） 是一种哈希分布方式，其目的是为了 - + diff --git a/notes/计算机操作系统 - 内存管理.md b/notes/计算机操作系统 - 内存管理.md index ea6dccd6..30b0ca15 100644 --- a/notes/计算机操作系统 - 内存管理.md +++ b/notes/计算机操作系统 - 内存管理.md @@ -142,4 +142,4 @@ FIFO 算法可能会把经常使用的页面置换出去，为了避免这一问 - + diff --git a/notes/计算机操作系统 - 概述.md b/notes/计算机操作系统 - 概述.md index 27755bdf..af5cdf55 100644 --- a/notes/计算机操作系统 - 概述.md +++ b/notes/计算机操作系统 - 概述.md @@ -124,4 +124,4 @@ Linux 的系统调用主要有以下这些： - + diff --git a/notes/计算机操作系统 - 死锁.md b/notes/计算机操作系统 - 死锁.md index bdc401d9..ab169cb7 100644 --- a/notes/计算机操作系统 - 死锁.md +++ b/notes/计算机操作系统 - 死锁.md @@ -144,4 +144,4 @@ - + diff --git a/notes/计算机操作系统 - 目录.md b/notes/计算机操作系统 - 目录.md index 924ee84e..9974bac2 100644 --- a/notes/计算机操作系统 - 目录.md +++ b/notes/计算机操作系统 - 目录.md @@ -24,4 +24,4 @@ - + diff --git a/notes/计算机操作系统 - 目录1.md b/notes/计算机操作系统 - 目录1.md index 7e124b0a..4a8693e9 100644 --- a/notes/计算机操作系统 - 目录1.md +++ b/notes/计算机操作系统 - 目录1.md @@ -24,4 +24,4 @@ - + diff --git a/notes/计算机操作系统 - 设备管理.md b/notes/计算机操作系统 - 设备管理.md index 14a3f6ed..ef2d9c66 100644 --- a/notes/计算机操作系统 - 设备管理.md +++ b/notes/计算机操作系统 - 设备管理.md @@ -61,4 +61,4 @@ - + diff --git a/notes/计算机操作系统 - 进程管理.md b/notes/计算机操作系统 - 进程管理.md index 5ba5f02c..25c99735 100644 --- a/notes/计算机操作系统 - 进程管理.md +++ b/notes/计算机操作系统 - 进程管理.md @@ -590,4 +590,4 @@ FIFO 常用于客户-服务器应用程序中，FIFO 用作汇聚点，在客户 - + diff --git a/notes/计算机操作系统 - 链接.md b/notes/计算机操作系统 - 链接.md index e0387f89..6ba77fea 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 cace093e..46e6c060 100644 --- a/notes/计算机操作系统.md +++ b/notes/计算机操作系统.md @@ -7,4 +7,4 @@ - + diff --git a/notes/计算机网络 - 传输层.md b/notes/计算机网络 - 传输层.md index 1633d732..6645072b 100644 --- a/notes/计算机网络 - 传输层.md +++ b/notes/计算机网络 - 传输层.md @@ -167,4 +167,4 @@ TCP 主要通过四个算法来进行拥塞控制：慢开始、拥塞避免、 - + diff --git a/notes/计算机网络 - 应用层.md b/notes/计算机网络 - 应用层.md index 1567622d..eab568e3 100644 --- a/notes/计算机网络 - 应用层.md +++ b/notes/计算机网络 - 应用层.md @@ -168,4 +168,4 @@ IMAP 协议中客户端和服务器上的邮件保持同步，如果不手动删 - + diff --git a/notes/计算机网络 - 概述.md b/notes/计算机网络 - 概述.md index b689ca25..2c12deaa 100644 --- a/notes/计算机网络 - 概述.md +++ b/notes/计算机网络 - 概述.md @@ -134,4 +134,4 @@ TCP/IP 体系结构不严格遵循 OSI 分层概念，应用层可能会直接 - + diff --git a/notes/计算机网络 - 物理层.md b/notes/计算机网络 - 物理层.md index af036a1d..51cb179f 100644 --- a/notes/计算机网络 - 物理层.md +++ b/notes/计算机网络 - 物理层.md @@ -22,4 +22,4 @@ - + diff --git a/notes/计算机网络 - 目录.md b/notes/计算机网络 - 目录.md index f5f41ea3..8d8fc405 100644 --- a/notes/计算机网络 - 目录.md +++ b/notes/计算机网络 - 目录.md @@ -30,4 +30,4 @@ - + diff --git a/notes/计算机网络 - 目录1.md b/notes/计算机网络 - 目录1.md index 7db42895..16ecce62 100644 --- a/notes/计算机网络 - 目录1.md +++ b/notes/计算机网络 - 目录1.md @@ -31,4 +31,4 @@ - + diff --git a/notes/计算机网络 - 网络层.md b/notes/计算机网络 - 网络层.md index 90d6858a..fd679d2e 100644 --- a/notes/计算机网络 - 网络层.md +++ b/notes/计算机网络 - 网络层.md @@ -244,4 +244,4 @@ BGP 只能寻找一条比较好的路由，而不是最佳路由。 - + diff --git a/notes/计算机网络 - 链路层.md b/notes/计算机网络 - 链路层.md index a543d25b..fd02eb58 100644 --- a/notes/计算机网络 - 链路层.md +++ b/notes/计算机网络 - 链路层.md @@ -198,4 +198,4 @@ MAC 地址是链路层地址，长度为 6 字节（48 位），用于唯一标 - + diff --git a/notes/计算机网络.md b/notes/计算机网络.md index a36f9f35..59eea4af 100644 --- a/notes/计算机网络.md +++ b/notes/计算机网络.md @@ -7,4 +7,4 @@ - + diff --git a/notes/设计模式.md b/notes/设计模式.md index ff000d83..5d8fcf7f 100644 --- a/notes/设计模式.md +++ b/notes/设计模式.md @@ -3068,4 +3068,4 @@ public class ImageViewer { - + diff --git a/notes/集群.md b/notes/集群.md index 33323e3b..c4adcd78 100644 --- a/notes/集群.md +++ b/notes/集群.md @@ -203,4 +203,4 @@ HTTP 重定向负载均衡服务器使用某种负载均衡算法计算得到服 - + diff --git a/notes/面向对象思想.md b/notes/面向对象思想.md index 1ad75c24..a592423f 100644 --- a/notes/面向对象思想.md +++ b/notes/面向对象思想.md @@ -372,4 +372,4 @@ Vihicle .. N - +