StarMirror/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018 2019-06-09 22:32:10 +08:00
parent c9293e2c98
commit 7017b12b11
167 changed files with 173 additions and 173 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -18,7 +18,7 @@
</div>
<br>
## :pencil2: 算法
- [剑指 Offer 题解](https://github.com/CyC2018/CS-Notes/blob/master/notes/剑指%20Offer%20题解%20-%20目录.md)

2
docs/notes/Docker.md
View File

@ -91,4 +91,4 @@ Docker 轻量级的特点使得它很适合用于部署、维护、组合微服
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Git.md
View File

@ -162,4 +162,4 @@ $ ssh-keygen -t rsa -C "youremail@example.com"
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/HTTP.md
View File

@ -881,4 +881,4 @@ DELETE /idX/delete HTTP/1.1 -> Returns 404
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Java IO.md
View File

@ -622,4 +622,4 @@ NIO 与普通 I/O 的区别主要有以下两点：
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Java 基础.md
View File

@ -1435,4 +1435,4 @@ Java 注解是附加在代码中的一些元信息，用于一些工具在编译
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Java 容器.md
View File

@ -1113,4 +1113,4 @@ public final class ConcurrentCache<K, V> {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Java 并发.md
View File

@ -1638,4 +1638,4 @@ JDK 1.6 引入了偏向锁和轻量级锁，从而让锁拥有了四个状态：
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Java 虚拟机.md
View File

@ -760,4 +760,4 @@ public class FileSystemClassLoader extends ClassLoader {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 二分查找.md
View File

@ -293,4 +293,4 @@ private int binarySearch(int[] nums, int target) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 位运算.md
View File

@ -420,4 +420,4 @@ public int[] countBits(int num) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 分治.md
View File

@ -108,4 +108,4 @@ private List<TreeNode> generateSubtrees(int s, int e) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 动态规划.md
View File

@ -1246,4 +1246,4 @@ public int minSteps(int n) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 双指针.md
View File

@ -242,4 +242,4 @@ private boolean isSubstr(String s, String target) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 哈希表.md
View File

@ -125,4 +125,4 @@ private int maxCount(Map<Integer, Integer> countForNum) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 图.md
View File

@ -259,4 +259,4 @@ private class UF {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 字符串.md
View File

@ -227,4 +227,4 @@ public int countBinarySubstrings(String s) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 排序.md
View File

@ -232,4 +232,4 @@ private void swap(int[] nums, int i, int j) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 搜索.md
View File

@ -1271,4 +1271,4 @@ private void backtracking(int row) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 数学.md
View File

@ -509,4 +509,4 @@ public int maximumProduct(int[] nums) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 数组与矩阵.md
View File

@ -435,4 +435,4 @@ public int maxChunksToSorted(int[] arr) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 栈和队列.md
View File

@ -222,4 +222,4 @@ public int[] nextGreaterElements(int[] nums) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 树.md
View File

@ -1122,4 +1122,4 @@ class MapSum {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 目录.md
View File

@ -37,4 +37,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 目录1.md
View File

@ -37,4 +37,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 贪心思想.md
View File

@ -370,4 +370,4 @@ private int char2Index(char c) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解 - 链表.md
View File

@ -345,4 +345,4 @@ public ListNode oddEvenList(ListNode head) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode 题解.md
View File

@ -7,4 +7,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Leetcode-Database 题解.md
View File

@ -1007,4 +1007,4 @@ ORDER BY
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Linux.md
View File

@ -1247,4 +1247,4 @@ options 参数主要有 WNOHANG 和 WUNTRACED 两个选项，WNOHANG 可以使 w
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/MySQL.md
View File

@ -425,4 +425,4 @@ MySQL 提供了 FROM_UNIXTIME() 函数把 UNIX 时间戳转换为日期，并提
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

8
docs/notes/Redis.md
View File

@ -58,7 +58,7 @@ Redis 支持很多特性，例如将内存中的数据持久化到硬盘中，
| 数据类型 | 可以存储的值 | 操作 |
| :--: | :--: | :--: |
| STRING | 字符串、整数或者浮点数 | 对整个字符串或者字符串的其中一部分执行操作</br> 对整数和浮点数执行自增或者自减操作 |
| LIST | 列表 | 从两端压入或者弹出元素 </br> 对单个或者多个元素</br> 进行修剪，只保留一个范围内的元素 |
| LIST | 列表 | 从两端压入或者弹出元素 </br> 对单个或者多个元素进行修剪，</br> 只保留一个范围内的元素 |
| SET | 无序集合 | 添加、获取、移除单个元素</br> 检查一个元素是否存在于集合中</br> 计算交集、并集、差集</br> 从集合里面随机获取元素 |
| HASH | 包含键值对的无序散列表 | 添加、获取、移除单个键值对</br> 获取所有键值对</br> 检查某个键是否存在|
| ZSET | 有序集合 | 添加、获取、删除元素</br> 根据分值范围或者成员来获取元素</br> 计算一个键的排名 |
@ -209,7 +209,7 @@ OK
## 字典
dictht 是一个散列表结构，使用拉链法保存哈希冲突。
dictht 是一个散列表结构，使用拉链法解决哈希冲突。
```c
/* This is our hash table structure. Every dictionary has two of this as we
@ -440,7 +440,7 @@ Redis 是内存型数据库，为了保证数据在断电后不会丢失，需
将写命令添加到 AOF 文件（Append Only File）的末尾。
使用 AOF 持久化需要设置同步选项，从而确保写命令什么时候会同步到磁盘文件上。这是因为对文件进行写入并不会马上将内容同步到磁盘上，而是先存储到缓冲区，然后由操作系统决定什么时候同步到磁盘。有以下同步选项：
使用 AOF 持久化需要设置同步选项，从而确保写命令同步到磁盘文件上的时机。这是因为对文件进行写入并不会马上将内容同步到磁盘上，而是先存储到缓冲区，然后由操作系统决定什么时候同步到磁盘。有以下同步选项：
| 选项 | 同步频率 |
| :--: | :--: |
@ -610,4 +610,4 @@ Redis 没有关系型数据库中的表这一概念来将同种类型的数据
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/SQL.md
View File

@ -773,4 +773,4 @@ SET PASSWROD FOR myuser = Password('new_password');
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/Socket.md
View File

@ -325,4 +325,4 @@ poll 没有最大描述符数量的限制，如果平台支持并且对实时性
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/代码可读性.md
View File

@ -335,4 +335,4 @@ public int findClostElement(int[] arr) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/代码风格规范.md
View File

@ -9,4 +9,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/分布式.md
View File

@ -344,4 +344,4 @@ Raft 也是分布式一致性协议，主要是用来竞选主节点。
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/剑指 Offer 题解 - 10~19.md
View File

@ -694,4 +694,4 @@ public boolean match(char[] str, char[] pattern) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/剑指 Offer 题解 - 20~29.md
View File

@ -392,4 +392,4 @@ public ArrayList<Integer> printMatrix(int[][] matrix) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/剑指 Offer 题解 - 30~39.md
View File

@ -472,4 +472,4 @@ public int MoreThanHalfNum_Solution(int[] nums) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/剑指 Offer 题解 - 3~9.md
View File

@ -363,4 +363,4 @@ public int pop() throws Exception {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/剑指 Offer 题解 - 40~49.md
View File

@ -420,4 +420,4 @@ public int GetUglyNumber_Solution(int N) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/剑指 Offer 题解 - 50~59.md
View File

@ -481,4 +481,4 @@ public ArrayList<Integer> maxInWindows(int[] num, int size) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/剑指 Offer 题解 - 60~68.md
View File

@ -324,4 +324,4 @@ public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/剑指 Offer 题解 - 目录.md
View File

@ -17,4 +17,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/剑指 Offer 题解 - 目录1.md
View File

@ -17,4 +17,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/剑指 offer 题解.md
View File

@ -7,4 +7,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/攻击技术.md
View File

@ -195,4 +195,4 @@ ResultSet rs = stmt.executeQuery();
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/数据库系统原理.md
View File

@ -576,4 +576,4 @@ Entity-Relationship，有三个组成部分：实体、属性、联系。
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/构建工具.md
View File

@ -143,4 +143,4 @@ A -> C -> X(2.0)
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/正则表达式.md
View File

@ -390,4 +390,4 @@ aBCd
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/消息队列.md
View File

@ -81,4 +81,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/算法 - 其它.md
View File

@ -136,4 +136,4 @@ public class Huffman {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/算法 - 并查集.md
View File

@ -194,4 +194,4 @@ public class WeightedQuickUnionUF extends UF {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/算法 - 排序.md
View File

@ -584,4 +584,4 @@ Java 主要排序方法为 java.util.Arrays.sort()，对于原始数据类型使
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/算法 - 栈和队列.md
View File

@ -320,4 +320,4 @@ public class ListQueue<Item> implements MyQueue<Item> {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/算法 - 目录.md
View File

@ -16,4 +16,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/算法 - 目录1.md
View File

@ -16,4 +16,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/算法 - 符号表.md
View File

@ -942,4 +942,4 @@ public class SparseVector {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/算法 - 算法分析.md
View File

@ -238,4 +238,4 @@ public class StopWatch {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/算法.md
View File

@ -7,4 +7,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/系统设计基础.md
View File

@ -111,4 +111,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/缓存.md
View File

@ -310,4 +310,4 @@ Distributed Hash Table（DHT） 是一种哈希分布方式，其目的是为了
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机操作系统 - 内存管理.md
View File

@ -142,4 +142,4 @@ FIFO 算法可能会把经常使用的页面置换出去，为了避免这一问
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机操作系统 - 概述.md
View File

@ -124,4 +124,4 @@ Linux 的系统调用主要有以下这些：
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机操作系统 - 死锁.md
View File

@ -144,4 +144,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机操作系统 - 目录.md
View File

@ -24,4 +24,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机操作系统 - 目录1.md
View File

@ -24,4 +24,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机操作系统 - 设备管理.md
View File

@ -61,4 +61,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机操作系统 - 进程管理.md
View File

@ -590,4 +590,4 @@ FIFO 常用于客户-服务器应用程序中，FIFO 用作汇聚点，在客户
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机操作系统 - 链接.md
View File

@ -68,4 +68,4 @@ gcc -o hello hello.c
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机操作系统.md
View File

@ -7,4 +7,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机网络 - 传输层.md
View File

@ -167,4 +167,4 @@ TCP 主要通过四个算法来进行拥塞控制：慢开始、拥塞避免、
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机网络 - 应用层.md
View File

@ -168,4 +168,4 @@ IMAP 协议中客户端和服务器上的邮件保持同步，如果不手动删
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机网络 - 概述.md
View File

@ -134,4 +134,4 @@ TCP/IP 体系结构不严格遵循 OSI 分层概念，应用层可能会直接
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机网络 - 物理层.md
View File

@ -22,4 +22,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机网络 - 目录.md
View File

@ -30,4 +30,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机网络 - 目录1.md
View File

@ -31,4 +31,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机网络 - 网络层.md
View File

@ -244,4 +244,4 @@ BGP 只能寻找一条比较好的路由，而不是最佳路由。
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机网络 - 链路层.md
View File

@ -198,4 +198,4 @@ MAC 地址是链路层地址，长度为 6 字节（48 位），用于唯一标
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/计算机网络.md
View File

@ -7,4 +7,4 @@
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/设计模式.md
View File

@ -3068,4 +3068,4 @@ public class ImageViewer {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/集群.md
View File

@ -203,4 +203,4 @@ HTTP 重定向负载均衡服务器使用某种负载均衡算法计算得到服
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
docs/notes/面向对象思想.md
View File

@ -372,4 +372,4 @@ Vihicle .. N
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Docker.md
View File

@ -91,4 +91,4 @@ Docker 轻量级的特点使得它很适合用于部署、维护、组合微服
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Git.md
View File

@ -162,4 +162,4 @@ $ ssh-keygen -t rsa -C "youremail@example.com"
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/HTTP.md
View File

@ -881,4 +881,4 @@ DELETE /idX/delete HTTP/1.1 -> Returns 404
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Java IO.md
View File

@ -622,4 +622,4 @@ NIO 与普通 I/O 的区别主要有以下两点：
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Java 基础.md
View File

@ -1435,4 +1435,4 @@ Java 注解是附加在代码中的一些元信息，用于一些工具在编译
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Java 容器.md
View File

@ -1113,4 +1113,4 @@ public final class ConcurrentCache<K, V> {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Java 并发.md
View File

@ -1638,4 +1638,4 @@ JDK 1.6 引入了偏向锁和轻量级锁，从而让锁拥有了四个状态：
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Java 虚拟机.md
View File

@ -760,4 +760,4 @@ public class FileSystemClassLoader extends ClassLoader {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Leetcode 题解 - 二分查找.md
View File

@ -293,4 +293,4 @@ private int binarySearch(int[] nums, int target) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Leetcode 题解 - 位运算.md
View File

@ -420,4 +420,4 @@ public int[] countBits(int num) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Leetcode 题解 - 分治.md
View File

@ -108,4 +108,4 @@ private List<TreeNode> generateSubtrees(int s, int e) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Leetcode 题解 - 动态规划.md
View File

@ -1246,4 +1246,4 @@ public int minSteps(int n) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Leetcode 题解 - 双指针.md
View File

@ -242,4 +242,4 @@ private boolean isSubstr(String s, String target) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Leetcode 题解 - 哈希表.md
View File

@ -125,4 +125,4 @@ private int maxCount(Map<Integer, Integer> countForNum) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Leetcode 题解 - 图.md
View File

@ -259,4 +259,4 @@ private class UF {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

2
notes/Leetcode 题解 - 字符串.md
View File

@ -227,4 +227,4 @@ public int countBinarySubstrings(String s) {
<img width="650px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>
<img width="580px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/other/公众号海报1.png"></img>

Some files were not shown because too many files have changed in this diff Show More