auto commit

2019-03-09 23:50:23 +08:00 · 2019-03-09 23:50:23 +08:00 · 3607fa786a
commit 3607fa786a
parent 02fde522e6
80 changed files with 160 additions and 0 deletions
--- a/docs/notes/Docker.md
+++ b/docs/notes/Docker.md
@ -89,3 +89,5 @@ Docker 轻量级的特点使得它很适合用于部署、维护、组合微服
 - [What is Docker](https://www.docker.com/what-docker)
 - [持续集成是什么？](http://www.ruanyifeng.com/blog/2015/09/continuous-integration.html)

+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Git.md
+++ b/docs/notes/Git.md
@ -158,3 +158,5 @@ $ ssh-keygen -t rsa -C "youremail@example.com"
 - [图解 Git](http://marklodato.github.io/visual-git-guide/index-zh-cn.html)
 - [廖雪峰 : Git 教程](https://www.liaoxuefeng.com/wiki/0013739516305929606dd18361248578c67b8067c8c017b000)
 - [Learn Git Branching](https://learngitbranching.js.org/)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/HTTP.md
+++ b/docs/notes/HTTP.md
@ -877,3 +877,5 @@ DELETE /idX/delete HTTP/1.1   -> Returns 404
 - [Symmetric vs. Asymmetric Encryption – What are differences?](https://www.ssl2buy.com/wiki/symmetric-vs-asymmetric-encryption-what-are-differences)
 - [Web 性能优化与 HTTP/2](https://www.kancloud.cn/digest/web-performance-http2)
 - [HTTP/2 简介](https://developers.google.com/web/fundamentals/performance/http2/?hl=zh-cn)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Java
+++ b/docs/notes/Java
@ -618,3 +618,5 @@ NIO 与普通 I/O 的区别主要有以下两点：
 - [NIO 与传统 IO 的区别](http://blog.csdn.net/shimiso/article/details/24990499)
 - [Decorator Design Pattern](http://stg-tud.github.io/sedc/Lecture/ws13-14/5.3-Decorator.html#mode=document)
 - [Socket Multicast](http://labojava.blogspot.com/2012/12/socket-multicast.html)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Java
+++ b/docs/notes/Java
@ -1394,3 +1394,5 @@ Java 注解是附加在代码中的一些元信息，用于一些工具在编译

 - Eckel B. Java 编程思想[M]. 机械工业出版社, 2002.
 - Bloch J. Effective java[M]. Addison-Wesley Professional, 2017.
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Java
+++ b/docs/notes/Java
@ -1111,3 +1111,5 @@ public final class ConcurrentCache<K, V> {
 - [Java 集合细节（二）：asList 的缺陷](http://wiki.jikexueyuan.com/project/java-enhancement/java-thirtysix.html)
 - [Java Collection Framework – The LinkedList Class](http://javaconceptoftheday.com/java-collection-framework-linkedlist-class/)

+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Java
+++ b/docs/notes/Java
@ -1634,3 +1634,5 @@ JDK 1.6 引入了偏向锁和轻量级锁，从而让锁拥有了四个状态：
 - [JAVA FORK JOIN EXAMPLE](http://www.javacreed.com/java-fork-join-example/ "Java Fork Join Example")
 - [聊聊并发（八）——Fork/Join 框架介绍](http://ifeve.com/talk-concurrency-forkjoin/)
 - [Eliminating SynchronizationRelated Atomic Operations with Biased Locking and Bulk Rebiasing](http://www.oracle.com/technetwork/java/javase/tech/biasedlocking-oopsla2006-preso-150106.pdf)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Java
+++ b/docs/notes/Java
@ -739,3 +739,5 @@ public class FileSystemClassLoader extends ClassLoader {
 - [深入探讨 Java 类加载器](https://www.ibm.com/developerworks/cn/java/j-lo-classloader/index.html#code6)
 - [Guide to WeakHashMap in Java](http://www.baeldung.com/java-weakhashmap)
 - [Tomcat example source code file (ConcurrentCache.java)](https://alvinalexander.com/java/jwarehouse/apache-tomcat-6.0.16/java/org/apache/el/util/ConcurrentCache.java.shtml)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -292,3 +292,5 @@ private int binarySearch(int[] nums, int target) {
 }
 ```

+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -425,3 +425,5 @@ public int[] countBits(int num) {
 }
 ```

+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -47,3 +47,5 @@ public List<Integer> diffWaysToCompute(String input) {
    return ways;
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -1219,3 +1219,5 @@ public int minSteps(int n) {
    return dp[n];
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -236,3 +236,5 @@ private boolean isValid(String s, String target) {
    return j == target.length();
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -121,3 +121,5 @@ private int maxCount(Map<Integer, Integer> countForNum) {
    return max;
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -255,3 +255,5 @@ private class UF {
    }
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -223,3 +223,5 @@ public int countBinarySubstrings(String s) {
    return count;
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -224,3 +224,5 @@ private void swap(int[] nums, int i, int j) {
    nums[j] = t;
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -1266,3 +1266,5 @@ private void backtracking(int row) {
    }
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -507,3 +507,5 @@ public int maximumProduct(int[] nums) {
    return Math.max(max1*max2*max3, max1*min1*min2);
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -431,3 +431,5 @@ public int maxChunksToSorted(int[] arr) {
    return ret;
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -218,3 +218,5 @@ public int[] nextGreaterElements(int[] nums) {
    return next;
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -1118,3 +1118,5 @@ class MapSum {
 }
 ```

+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -36,3 +36,5 @@
 - 何海涛, 软件工程师. 剑指 Offer: 名企面试官精讲典型编程题[M]. 电子工业出版社, 2014.
 - 《编程之美》小组. 编程之美[M]. 电子工业出版社, 2008.
 - 左程云. 程序员代码面试指南[M]. 电子工业出版社, 2015.
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -36,3 +36,5 @@
 - 何海涛, 软件工程师. 剑指 Offer: 名企面试官精讲典型编程题[M]. 电子工业出版社, 2014.
 - 《编程之美》小组. 编程之美[M]. 电子工业出版社, 2008.
 - 左程云. 程序员代码面试指南[M]. 电子工业出版社, 2015.
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -364,3 +364,5 @@ public int maxProfit(int[] prices) {
 }
 ```

+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -325,3 +325,5 @@ public ListNode oddEvenList(ListNode head) {
    return head;
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Leetcode-Database
+++ b/docs/notes/Leetcode-Database
@ -948,3 +948,5 @@ WHERE
 ORDER BY
    id;
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Linux.md
+++ b/docs/notes/Linux.md
@ -1245,3 +1245,5 @@ options 参数主要有 WNOHANG 和 WUNTRACED 两个选项，WNOHANG 可以使 w
 - [File system design case studies](https://www.cs.rutgers.edu/\~pxk/416/notes/13-fs-studies.html)
 - [Programming Project #4](https://classes.soe.ucsc.edu/cmps111/Fall08/proj4.shtml)
 - [FILE SYSTEM DESIGN](http://web.cs.ucla.edu/classes/fall14/cs111/scribe/11a/index.html)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/MySQL.md
+++ b/docs/notes/MySQL.md
@ -421,3 +421,5 @@ MySQL 提供了 FROM_UNIXTIME() 函数把 UNIX 时间戳转换为日期，并提
 - [How Sharding Works](https://medium.com/@jeeyoungk/how-sharding-works-b4dec46b3f6)
 - [大众点评订单系统分库分表实践](https://tech.meituan.com/dianping_order_db_sharding.html)
 - [B + 树](https://zh.wikipedia.org/wiki/B%2B%E6%A0%91)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Redis.md
+++ b/docs/notes/Redis.md
@ -606,3 +606,5 @@ Redis 没有关系型数据库中的表这一概念来将同种类型的数据
 - [Redis 3.0 中文版- 分片](http://wiki.jikexueyuan.com/project/redis-guide)
 - [Redis 应用场景](http://www.scienjus.com/redis-use-case/)
 - [Using Redis as an LRU cache](https://redis.io/topics/lru-cache)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/SQL.md
+++ b/docs/notes/SQL.md
@ -765,3 +765,5 @@ SET PASSWROD FOR myuser = Password('new_password');
 # 参考资料

 - BenForta. SQL 必知必会 [M]. 人民邮电出版社, 2013.
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/Socket.md
+++ b/docs/notes/Socket.md
@ -321,3 +321,5 @@ poll 没有最大描述符数量的限制，如果平台支持并且对实时性
 - [poll vs select vs event-based](https://daniel.haxx.se/docs/poll-vs-select.html)
 - [select / poll / epoll: practical difference for system architects](http://www.ulduzsoft.com/2014/01/select-poll-epoll-practical-difference-for-system-architects/)
 - [Browse the source code of userspace/glibc/sysdeps/unix/sysv/linux/ online](https://code.woboq.org/userspace/glibc/sysdeps/unix/sysv/linux/)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/代码可读性.md
+++ b/docs/notes/代码可读性.md
@ -331,3 +331,5 @@ public int findClostElement(int[] arr) {
 # 参考资料

 - Dustin, Boswell, Trevor, 等. 编写可读代码的艺术 [M]. 机械工业出版社, 2012.
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/代码风格规范.md
+++ b/docs/notes/代码风格规范.md
@ -5,3 +5,5 @@
 - [Twitter Java Style Guide](https://github.com/twitter/commons/blob/master/src/java/com/twitter/common/styleguide.md)
 - [Google Java Style Guide](http://google.github.io/styleguide/javaguide.html)
 - [阿里巴巴Java开发手册](https://github.com/alibaba/p3c/blob/master/%E9%98%BF%E9%87%8C%E5%B7%B4%E5%B7%B4Java%E5%BC%80%E5%8F%91%E6%89%8B%E5%86%8C%EF%BC%88%E8%AF%A6%E5%B0%BD%E7%89%88%EF%BC%89.pdf)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/分布式.md
+++ b/docs/notes/分布式.md
@ -341,3 +341,5 @@ Raft 也是分布式一致性协议，主要是用来竞选主节点。
 - [NEAT ALGORITHMS - PAXOS](http://harry.me/blog/2014/12/27/neat-algorithms-paxos/)
 - [Paxos By Example](https://angus.nyc/2012/paxos-by-example/)

+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/剑指
+++ b/docs/notes/剑指
@ -683,3 +683,5 @@ public boolean match(char[] str, char[] pattern) {
    return dp[m][n];
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/剑指
+++ b/docs/notes/剑指
@ -376,3 +376,5 @@ public ArrayList<Integer> printMatrix(int[][] matrix) {
    return ret;
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/剑指
+++ b/docs/notes/剑指
@ -491,3 +491,5 @@ public int MoreThanHalfNum_Solution(int[] nums) {
    return cnt > nums.length / 2 ? majority : 0;
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/剑指
+++ b/docs/notes/剑指
@ -380,3 +380,5 @@ public int pop() throws Exception {
 }
 ```

+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/剑指
+++ b/docs/notes/剑指
@ -438,3 +438,5 @@ public int GetUglyNumber_Solution(int N) {
    return dp[N - 1];
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/剑指
+++ b/docs/notes/剑指
@ -497,3 +497,5 @@ public ArrayList<Integer> maxInWindows(int[] num, int size) {
    return ret;
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/剑指
+++ b/docs/notes/剑指
@ -339,3 +339,5 @@ public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
    return left == null ? right : right == null ? left : root;
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/剑指
+++ b/docs/notes/剑指
@ -19,3 +19,5 @@
 # 参考文献

 何海涛. 剑指 Offer[M]. 电子工业出版社, 2012.
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/剑指
+++ b/docs/notes/剑指
@ -19,3 +19,5 @@
 # 参考文献

 何海涛. 剑指 Offer[M]. 电子工业出版社, 2012.
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/攻击技术.md
+++ b/docs/notes/攻击技术.md
@ -191,3 +191,5 @@ ResultSet rs = stmt.executeQuery();
 - [维基百科：SQL 注入攻击](https://zh.wikipedia.org/wiki/SQL%E8%B3%87%E6%96%99%E9%9A%B1%E7%A2%BC%E6%94%BB%E6%93%8A)
 - [维基百科：跨站点请求伪造](https://zh.wikipedia.org/wiki/%E8%B7%A8%E7%AB%99%E8%AF%B7%E6%B1%82%E4%BC%AA%E9%80%A0)
 - [维基百科：拒绝服务攻击](https://zh.wikipedia.org/wiki/%E9%98%BB%E6%96%B7%E6%9C%8D%E5%8B%99%E6%94%BB%E6%93%8A)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/数据库系统原理.md
+++ b/docs/notes/数据库系统原理.md
@ -579,3 +579,5 @@ Entity-Relationship，有三个组成部分：实体、属性、联系。
 - [MySQL locking for the busy web developer](https://www.brightbox.com/blog/2013/10/31/on-mysql-locks/)
 - [浅入浅出 MySQL 和 InnoDB](https://draveness.me/mysql-innodb)
 - [Innodb 中的事务隔离级别和锁的关系](https://tech.meituan.com/2014/08/20/innodb-lock.html)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/构建工具.md
+++ b/docs/notes/构建工具.md
@ -139,3 +139,5 @@ A -> C -> X(2.0)
 - [maven 2 gradle](http://sagioto.github.io/maven2gradle/)
 - [新一代构建工具 gradle](https://www.imooc.com/learn/833)

+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/正则表达式.md
+++ b/docs/notes/正则表达式.md
@ -386,3 +386,5 @@ aBCd
 # 参考资料

 - BenForta. 正则表达式必知必会 [M]. 人民邮电出版社, 2007.
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/消息队列.md
+++ b/docs/notes/消息队列.md
@ -80,3 +80,5 @@

 - [Observer vs Pub-Sub](http://developers-club.com/posts/270339/)
 - [消息队列中点对点与发布订阅区别](https://blog.csdn.net/lizhitao/article/details/47723105)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/算法
+++ b/docs/notes/算法
@ -132,3 +132,5 @@ public class Huffman {
    }
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/算法
+++ b/docs/notes/算法
@ -190,3 +190,5 @@ public class WeightedQuickUnionUF extends UF {
 | Quick Union | 树高 | 树高 |
 | 加权 Quick Union | logN | logN |
 | 路径压缩的加权 Quick Union | 非常接近 1 | 非常接近 1 |
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/算法
+++ b/docs/notes/算法
@ -583,3 +583,5 @@ public class HeapSort<T extends Comparable<T>> extends Sort<T> {
 ## 2. Java 的排序算法实现

 Java 主要排序方法为 java.util.Arrays.sort()，对于原始数据类型使用三向切分的快速排序，对于引用类型使用归并排序。
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/算法
+++ b/docs/notes/算法
@ -316,3 +316,5 @@ public class ListQueue<Item> implements MyQueue<Item> {
    }
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/算法
+++ b/docs/notes/算法
@ -19,3 +19,5 @@
 # 参考资料

 - Sedgewick, Robert, and Kevin Wayne. _Algorithms_. Addison-Wesley Professional, 2011.
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/算法
+++ b/docs/notes/算法
@ -19,3 +19,5 @@
 # 参考资料

 - Sedgewick, Robert, and Kevin Wayne. _Algorithms_. Addison-Wesley Professional, 2011.
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/算法
+++ b/docs/notes/算法
@ -937,3 +937,5 @@ public class SparseVector {
    }
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/算法
+++ b/docs/notes/算法
@ -235,3 +235,5 @@ public class StopWatch {
    }
 }
 ```
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/系统设计基础.md
+++ b/docs/notes/系统设计基础.md
@ -107,3 +107,5 @@
 # 参考资料

 - 大型网站技术架构：核心原理与案例分析
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/缓存.md
+++ b/docs/notes/缓存.md
@ -283,3 +283,5 @@ Distributed Hash Table（DHT） 是一种哈希分布方式，其目的是为了
 - [一致性哈希算法](https://my.oschina.net/jayhu/blog/732849)
 - [内容分发网络](https://zh.wikipedia.org/wiki/%E5%85%A7%E5%AE%B9%E5%82%B3%E9%81%9E%E7%B6%B2%E8%B7%AF)
 - [How Aspiration CDN helps to improve your website loading speed?](https://www.aspirationhosting.com/aspiration-cdn/)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机操作系统
+++ b/docs/notes/计算机操作系统
@ -134,3 +134,5 @@ FIFO 算法可能会把经常使用的页面置换出去，为了避免这一问
 - 大小是否可以改变：页的大小不可变，段的大小可以动态改变。

 - 出现的原因：分页主要用于实现虚拟内存，从而获得更大的地址空间；分段主要是为了使程序和数据可以被划分为逻辑上独立的地址空间并且有助于共享和保护。
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机操作系统
+++ b/docs/notes/计算机操作系统
@ -120,3 +120,5 @@ Linux 的系统调用主要有以下这些：
 ## 3. 陷入

 在用户程序中使用系统调用。
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机操作系统
+++ b/docs/notes/计算机操作系统
@ -140,3 +140,5 @@
 - 重复以上两步，直到所有进程都标记为终止，则状态时安全的。

 如果一个状态不是安全的，需要拒绝进入这个状态。
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机操作系统
+++ b/docs/notes/计算机操作系统
@ -24,3 +24,5 @@
 - [Processes](http://cse.csusb.edu/tongyu/courses/cs460/notes/process.php)
 - [Inter Process Communication Presentation[1]](https://www.slideshare.net/rkolahalam/inter-process-communication-presentation1)
 - [Decoding UCS Invicta – Part 1](https://blogs.cisco.com/datacenter/decoding-ucs-invicta-part-1)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机操作系统
+++ b/docs/notes/计算机操作系统
@ -24,3 +24,5 @@
 - [Processes](http://cse.csusb.edu/tongyu/courses/cs460/notes/process.php)
 - [Inter Process Communication Presentation[1]](https://www.slideshare.net/rkolahalam/inter-process-communication-presentation1)
 - [Decoding UCS Invicta – Part 1](https://blogs.cisco.com/datacenter/decoding-ucs-invicta-part-1)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机操作系统
+++ b/docs/notes/计算机操作系统
@ -57,3 +57,5 @@
 因为考虑了移动方向，因此所有的磁盘请求都会被满足，解决了 SSTF 的饥饿问题。

 <div align="center"> <img src="pics/271ce08f-c124-475f-b490-be44fedc6d2e.png"/> </div><br>
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机操作系统
+++ b/docs/notes/计算机操作系统
@ -586,3 +586,5 @@ FIFO 常用于客户-服务器应用程序中，FIFO 用作汇聚点，在客户
 ## 6. 套接字

 与其它通信机制不同的是，它可用于不同机器间的进程通信。
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机操作系统
+++ b/docs/notes/计算机操作系统
@ -63,3 +63,5 @@ gcc -o hello hello.c
 - 在内存中，一个共享库的 .text 节（已编译程序的机器代码）的一个副本可以被不同的正在运行的进程共享。

 <div align="center"> <img src="pics/76dc7769-1aac-4888-9bea-064f1caa8e77.jpg"/> </div><br>
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机操作系统.md
+++ b/docs/notes/计算机操作系统.md
@ -1076,3 +1076,5 @@ gcc -o hello hello.c
 - [Processes](http://cse.csusb.edu/tongyu/courses/cs460/notes/process.php)
 - [Inter Process Communication Presentation[1]](https://www.slideshare.net/rkolahalam/inter-process-communication-presentation1)
 - [Decoding UCS Invicta – Part 1](https://blogs.cisco.com/datacenter/decoding-ucs-invicta-part-1)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机网络
+++ b/docs/notes/计算机网络
@ -163,3 +163,5 @@ TCP 主要通过四个算法来进行拥塞控制：慢开始、拥塞避免、
 慢开始和快恢复的快慢指的是 cwnd 的设定值，而不是 cwnd 的增长速率。慢开始 cwnd 设定为 1，而快恢复 cwnd 设定为 ssthresh。

 <div align="center"> <img src="pics/f61b5419-c94a-4df1-8d4d-aed9ae8cc6d5.png" width="600"/> </div><br>
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机网络
+++ b/docs/notes/计算机网络
@ -164,3 +164,5 @@ IMAP 协议中客户端和服务器上的邮件保持同步，如果不手动删
 - HTTP 服务器从 TCP 套接字读取 HTTP GET 报文，生成一个 HTTP 响应报文，将 Web 页面内容放入报文主体中，发回给主机。

 - 浏览器收到 HTTP 响应报文后，抽取出 Web 页面内容，之后进行渲染，显示 Web 页面。
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机网络
+++ b/docs/notes/计算机网络
@ -126,3 +126,5 @@ TCP/IP 体系结构不严格遵循 OSI 分层概念，应用层可能会直接
 在向下的过程中，需要添加下层协议所需要的首部或者尾部，而在向上的过程中不断拆开首部和尾部。

 路由器只有下面三层协议，因为路由器位于网络核心中，不需要为进程或者应用程序提供服务，因此也就不需要传输层和应用层。
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机网络
+++ b/docs/notes/计算机网络
@ -18,3 +18,5 @@

 <div align="center"> <img src="pics/c34f4503-f62c-4043-9dc6-3e03288657df.jpg" width="500"/> </div><br>

+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机网络
+++ b/docs/notes/计算机网络
@ -30,3 +30,5 @@
 - [Technology-Computer Networking[1]-Computer Networks and the Internet](http://www.linyibin.cn/2017/02/12/technology-ComputerNetworking-Internet/)
 - [P2P 网络概述.](http://slidesplayer.com/slide/11616167/)
 - [Circuit Switching (a) Circuit switching. (b) Packet switching.](http://slideplayer.com/slide/5115386/)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机网络
+++ b/docs/notes/计算机网络
@ -31,3 +31,5 @@
 - [P2P 网络概述.](http://slidesplayer.com/slide/11616167/)
 - [Circuit Switching (a) Circuit switching. (b) Packet switching.](http://slideplayer.com/slide/5115386/)

+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机网络
+++ b/docs/notes/计算机网络
@ -240,3 +240,5 @@ BGP 只能寻找一条比较好的路由，而不是最佳路由。
 每个 AS 都必须配置 BGP 发言人，通过在两个相邻 BGP 发言人之间建立 TCP 连接来交换路由信息。

 <div align="center"> <img src="pics/9cd0ae20-4fb5-4017-a000-f7d3a0eb3529.png" width="600"/> </div><br>
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机网络
+++ b/docs/notes/计算机网络
@ -186,3 +186,5 @@ MAC 地址是链路层地址，长度为 6 字节（48 位），用于唯一标
 使用 VLAN 干线连接来建立虚拟局域网，每台交换机上的一个特殊接口被设置为干线接口，以互连 VLAN 交换机。IEEE 定义了一种扩展的以太网帧格式 802.1Q，它在标准以太网帧上加进了 4 字节首部 VLAN 标签，用于表示该帧属于哪一个虚拟局域网。

 <div align="center"> <img src="pics/99208bd0-1454-4618-9969-0c2deb8bba0f.png" width="500"/> </div><br>
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/计算机网络.md
+++ b/docs/notes/计算机网络.md
@ -892,3 +892,5 @@ IMAP 协议中客户端和服务器上的邮件保持同步，如果不手动删
 - [Technology-Computer Networking[1]-Computer Networks and the Internet](http://www.linyibin.cn/2017/02/12/technology-ComputerNetworking-Internet/)
 - [P2P 网络概述.](http://slidesplayer.com/slide/11616167/)
 - [Circuit Switching (a) Circuit switching. (b) Packet switching.](http://slideplayer.com/slide/5115386/)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/设计模式.md
+++ b/docs/notes/设计模式.md
@ -3066,3 +3066,5 @@ public class ImageViewer {
 - [Design Patterns](http://www.oodesign.com/)
 - [Design patterns implemented in Java](http://java-design-patterns.com/)
 - [The breakdown of design patterns in JDK](http://www.programering.com/a/MTNxAzMwATY.html)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/集群.md
+++ b/docs/notes/集群.md
@ -198,3 +198,5 @@ HTTP 重定向负载均衡服务器使用某种负载均衡算法计算得到服

 - [Session Management using Spring Session with JDBC DataStore](https://sivalabs.in/2018/02/session-management-using-spring-session-jdbc-datastore/)

+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>
--- a/docs/notes/面向对象思想.md
+++ b/docs/notes/面向对象思想.md
@ -357,3 +357,5 @@ Vihicle .. N
 - [看懂 UML 类图和时序图](http://design-patterns.readthedocs.io/zh_CN/latest/read_uml.html#generalization)
 - [UML 系列——时序图（顺序图）sequence diagram](http://www.cnblogs.com/wolf-sun/p/UML-Sequence-diagram.html)
 - [面向对象编程三大特性 ------ 封装、继承、多态](http://blog.csdn.net/jianyuerensheng/article/details/51602015)
+<div align="center">欢迎关注公众号！</div>
+<div align="center"><img width="150px" src="https://cyc-1256109796.cos.ap-guangzhou.myqcloud.com/%E5%85%AC%E4%BC%97%E5%8F%B7.jpg"></img></div>