nicksxs
/
Nicksxs.github.io
1
0
Fork 0
Code Issues 0 Pull Requests 0 Projects 0 Releases 0 Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
104 Commits
1 Branch
308 MiB
 
 
Tree: bfc42b1f0c
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'bfc42b1f0c'
${ noResults }
Nicksxs.github.io/atom.xml

849 lines
34 KiB
Raw Blame History

<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
<title>Nicksxs&#39;s Blog</title>
<icon>https://nicksxs.me/icon.png</icon>
<subtitle>What hurts more, the pain of hard work or the pain of regret?</subtitle>
<link href="/atom.xml" rel="self"/>
<link href="https://nicksxs.me/"/>
<updated>2021-02-07T15:13:39.017Z</updated>
<id>https://nicksxs.me/</id>
<author>
<name>Nicksxs</name>
</author>
<generator uri="https://hexo.io/">Hexo</generator>
<entry>
<title>关于读书打卡与分享</title>
<link href="https://nicksxs.me/2021/02/07/%E5%85%B3%E4%BA%8E%E8%AF%BB%E4%B9%A6%E6%89%93%E5%8D%A1%E4%B8%8E%E5%88%86%E4%BA%AB/"/>
<id>https://nicksxs.me/2021/02/07/%E5%85%B3%E4%BA%8E%E8%AF%BB%E4%B9%A6%E6%89%93%E5%8D%A1%E4%B8%8E%E5%88%86%E4%BA%AB/</id>
<published>2021-02-07T15:13:39.000Z</published>
<updated>2021-02-07T15:13:39.017Z</updated>
<summary type="html">
&lt;p&gt;最近群里大佬发起了一个读书打卡活动，需要每天读一会书，在群里打卡分享感悟，争取一个月能读完一本书，说实话一天十分钟的读书时间倒是问题不大，不过每天都要打卡，而且一个月要读完一本书，其实难度还是有点大的，不过也想试试看。&lt;br&gt;之前某某老大给自己立了个
</summary>
<category term="生活" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/"/>
<category term="读后感" scheme="https://nicksxs.me/categories/%E8%AF%BB%E5%90%8E%E6%84%9F/"/>
<category term="白岩松" scheme="https://nicksxs.me/categories/%E8%AF%BB%E5%90%8E%E6%84%9F/%E7%99%BD%E5%B2%A9%E6%9D%BE/"/>
<category term="幸福了吗" scheme="https://nicksxs.me/categories/%E8%AF%BB%E5%90%8E%E6%84%9F/%E7%99%BD%E5%B2%A9%E6%9D%BE/%E5%B9%B8%E7%A6%8F%E4%BA%86%E5%90%97/"/>
<category term="读后感" scheme="https://nicksxs.me/tags/%E8%AF%BB%E5%90%8E%E6%84%9F/"/>
<category term="读书" scheme="https://nicksxs.me/tags/%E8%AF%BB%E4%B9%A6/"/>
<category term="打卡" scheme="https://nicksxs.me/tags/%E6%89%93%E5%8D%A1/"/>
<category term="幸福了吗" scheme="https://nicksxs.me/tags/%E5%B9%B8%E7%A6%8F%E4%BA%86%E5%90%97/"/>
<category term="足球" scheme="https://nicksxs.me/tags/%E8%B6%B3%E7%90%83/"/>
</entry>
<entry>
<title>聊聊 redis 缓存的应用问题</title>
<link href="https://nicksxs.me/2021/01/31/%E8%81%8A%E8%81%8A-redis-%E7%BC%93%E5%AD%98%E7%9A%84%E5%BA%94%E7%94%A8%E9%97%AE%E9%A2%98/"/>
<id>https://nicksxs.me/2021/01/31/%E8%81%8A%E8%81%8A-redis-%E7%BC%93%E5%AD%98%E7%9A%84%E5%BA%94%E7%94%A8%E9%97%AE%E9%A2%98/</id>
<published>2021-01-31T15:02:44.000Z</published>
<updated>2021-01-31T15:02:44.242Z</updated>
<summary type="html">
&lt;p&gt;前面写过一系列的 redis 源码分析的，但是实际上很多的问题还是需要结合实际的使用，然后其实就避不开缓存使用的三个著名问题，穿透，击穿和雪崩，这三个概念也是有着千丝万缕的关系，&lt;/p&gt;
&lt;h3 id=&quot;缓存穿透&quot;&gt;&lt;a href=&quot;#缓存穿透&quot;
</summary>
<category term="Redis" scheme="https://nicksxs.me/categories/Redis/"/>
<category term="应用" scheme="https://nicksxs.me/categories/Redis/%E5%BA%94%E7%94%A8/"/>
<category term="缓存" scheme="https://nicksxs.me/categories/Redis/%E7%BC%93%E5%AD%98/"/>
<category term="缓存" scheme="https://nicksxs.me/categories/%E7%BC%93%E5%AD%98/"/>
<category term="穿透" scheme="https://nicksxs.me/categories/%E7%BC%93%E5%AD%98/%E7%A9%BF%E9%80%8F/"/>
<category term="击穿" scheme="https://nicksxs.me/categories/%E7%BC%93%E5%AD%98/%E7%A9%BF%E9%80%8F/%E5%87%BB%E7%A9%BF/"/>
<category term="雪崩" scheme="https://nicksxs.me/categories/%E7%BC%93%E5%AD%98/%E7%A9%BF%E9%80%8F/%E5%87%BB%E7%A9%BF/%E9%9B%AA%E5%B4%A9/"/>
<category term="Redis" scheme="https://nicksxs.me/tags/Redis/"/>
<category term="缓存穿透" scheme="https://nicksxs.me/tags/%E7%BC%93%E5%AD%98%E7%A9%BF%E9%80%8F/"/>
<category term="缓存击穿" scheme="https://nicksxs.me/tags/%E7%BC%93%E5%AD%98%E5%87%BB%E7%A9%BF/"/>
<category term="缓存雪崩" scheme="https://nicksxs.me/tags/%E7%BC%93%E5%AD%98%E9%9B%AA%E5%B4%A9/"/>
<category term="布隆过滤器" scheme="https://nicksxs.me/tags/%E5%B8%83%E9%9A%86%E8%BF%87%E6%BB%A4%E5%99%A8/"/>
<category term="bloom filter" scheme="https://nicksxs.me/tags/bloom-filter/"/>
<category term="互斥锁" scheme="https://nicksxs.me/tags/%E4%BA%92%E6%96%A5%E9%94%81/"/>
</entry>
<entry>
<title>Leetcode 124 二叉树中的最大路径和(Binary Tree Maximum Path Sum) 题解分析</title>
<link href="https://nicksxs.me/2021/01/24/Leetcode-124-%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C-Binary-Tree-Maximum-Path-Sum-%E9%A2%98%E8%A7%A3%E5%88%86%E6%9E%90/"/>
<id>https://nicksxs.me/2021/01/24/Leetcode-124-%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E6%9C%80%E5%A4%A7%E8%B7%AF%E5%BE%84%E5%92%8C-Binary-Tree-Maximum-Path-Sum-%E9%A2%98%E8%A7%A3%E5%88%86%E6%9E%90/</id>
<published>2021-01-24T14:45:03.000Z</published>
<updated>2021-01-24T14:45:03.748Z</updated>
<summary type="html">
&lt;h3 id=&quot;题目介绍&quot;&gt;&lt;a href=&quot;#题目介绍&quot; class=&quot;headerlink&quot; title=&quot;题目介绍&quot;&gt;&lt;/a&gt;题目介绍&lt;/h3&gt;&lt;p&gt;A &lt;strong&gt;path&lt;/strong&gt; in a binary tree is a sequence of
</summary>
<category term="Java" scheme="https://nicksxs.me/categories/Java/"/>
<category term="leetcode" scheme="https://nicksxs.me/categories/leetcode/"/>
<category term="Binary Tree" scheme="https://nicksxs.me/categories/Binary-Tree/"/>
<category term="java" scheme="https://nicksxs.me/categories/leetcode/java/"/>
<category term="Binary Tree" scheme="https://nicksxs.me/categories/leetcode/java/Binary-Tree/"/>
<category term="leetcode" scheme="https://nicksxs.me/tags/leetcode/"/>
<category term="java" scheme="https://nicksxs.me/tags/java/"/>
<category term="Binary Tree" scheme="https://nicksxs.me/tags/Binary-Tree/"/>
<category term="二叉树" scheme="https://nicksxs.me/tags/%E4%BA%8C%E5%8F%89%E6%A0%91/"/>
<category term="题解" scheme="https://nicksxs.me/tags/%E9%A2%98%E8%A7%A3/"/>
</entry>
<entry>
<title>聊聊那些加塞狗</title>
<link href="https://nicksxs.me/2021/01/17/%E8%81%8A%E8%81%8A%E9%82%A3%E4%BA%9B%E5%8A%A0%E5%A1%9E%E7%8B%97/"/>
<id>https://nicksxs.me/2021/01/17/%E8%81%8A%E8%81%8A%E9%82%A3%E4%BA%9B%E5%8A%A0%E5%A1%9E%E7%8B%97/</id>
<published>2021-01-17T15:29:09.000Z</published>
<updated>2021-01-17T15:29:09.250Z</updated>
<summary type="html">
&lt;p&gt;今天真的是被气得不轻，情况是碰到一个有 70
</summary>
<category term="生活" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/"/>
<category term="开车" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/%E5%BC%80%E8%BD%A6/"/>
<category term="生活" scheme="https://nicksxs.me/tags/%E7%94%9F%E6%B4%BB/"/>
<category term="开车" scheme="https://nicksxs.me/tags/%E5%BC%80%E8%BD%A6/"/>
<category term="加塞" scheme="https://nicksxs.me/tags/%E5%8A%A0%E5%A1%9E/"/>
<category term="糟心事" scheme="https://nicksxs.me/tags/%E7%B3%9F%E5%BF%83%E4%BA%8B/"/>
<category term="规则" scheme="https://nicksxs.me/tags/%E8%A7%84%E5%88%99/"/>
</entry>
<entry>
<title>Leetcode 160 相交链表(intersection-of-two-linked-lists) 题解分析</title>
<link href="https://nicksxs.me/2021/01/10/Leetcode-160-%E7%9B%B8%E4%BA%A4%E9%93%BE%E8%A1%A8-intersection-of-two-linked-lists-%E9%A2%98%E8%A7%A3%E5%88%86%E6%9E%90/"/>
<id>https://nicksxs.me/2021/01/10/Leetcode-160-%E7%9B%B8%E4%BA%A4%E9%93%BE%E8%A1%A8-intersection-of-two-linked-lists-%E9%A2%98%E8%A7%A3%E5%88%86%E6%9E%90/</id>
<published>2021-01-10T13:09:28.000Z</published>
<updated>2021-01-22T12:22:13.202Z</updated>
<summary type="html">
&lt;h2 id=&quot;题目介绍&quot;&gt;&lt;a href=&quot;#题目介绍&quot; class=&quot;headerlink&quot;
</summary>
<category term="Java" scheme="https://nicksxs.me/categories/Java/"/>
<category term="leetcode" scheme="https://nicksxs.me/categories/leetcode/"/>
<category term="Linked List" scheme="https://nicksxs.me/categories/Linked-List/"/>
<category term="java" scheme="https://nicksxs.me/categories/leetcode/java/"/>
<category term="Linked List" scheme="https://nicksxs.me/categories/leetcode/java/Linked-List/"/>
<category term="leetcode" scheme="https://nicksxs.me/tags/leetcode/"/>
<category term="java" scheme="https://nicksxs.me/tags/java/"/>
<category term="题解" scheme="https://nicksxs.me/tags/%E9%A2%98%E8%A7%A3/"/>
<category term="Linked List" scheme="https://nicksxs.me/tags/Linked-List/"/>
</entry>
<entry>
<title>聊聊 Java 的 equals 和 hashCode 方法</title>
<link href="https://nicksxs.me/2021/01/03/%E8%81%8A%E8%81%8A-Java-%E7%9A%84-equals-%E5%92%8C-hashCode-%E6%96%B9%E6%B3%95/"/>
<id>https://nicksxs.me/2021/01/03/%E8%81%8A%E8%81%8A-Java-%E7%9A%84-equals-%E5%92%8C-hashCode-%E6%96%B9%E6%B3%95/</id>
<published>2021-01-03T14:26:35.000Z</published>
<updated>2021-01-03T14:26:35.828Z</updated>
<summary type="html">
&lt;p&gt;Java 中的这个话题也是比较常遇到的，关于这块原先也是比较忽略的，但是仔细想想又有点遗忘了就在这里记一下&lt;br&gt;简单看下代码&lt;br&gt;&lt;code&gt;java.lang.Object#equals&lt;/code&gt;&lt;/p&gt;
&lt;figure class=&quot;highlight
</summary>
</entry>
<entry>
<title>聊聊 mysql 索引的一些细节</title>
<link href="https://nicksxs.me/2020/12/27/%E8%81%8A%E8%81%8A-mysql-%E7%B4%A2%E5%BC%95%E7%9A%84%E4%B8%80%E4%BA%9B%E7%BB%86%E8%8A%82/"/>
<id>https://nicksxs.me/2020/12/27/%E8%81%8A%E8%81%8A-mysql-%E7%B4%A2%E5%BC%95%E7%9A%84%E4%B8%80%E4%BA%9B%E7%BB%86%E8%8A%82/</id>
<published>2020-12-27T15:49:05.000Z</published>
<updated>2020-12-27T16:16:08.313Z</updated>
<summary type="html">
&lt;p&gt;前几天同事问了我个 mysql 索引的问题，虽然大概知道，但是还是想来实践下，就是 is null，is not null 这类查询是否能用索引，可能之前有些网上的文章说都是不能用索引，但是其实不是，我们来看个小试验&lt;/p&gt;
&lt;figure
</summary>
<category term="Mysql" scheme="https://nicksxs.me/categories/Mysql/"/>
<category term="C" scheme="https://nicksxs.me/categories/C/"/>
<category term="索引" scheme="https://nicksxs.me/categories/Mysql/%E7%B4%A2%E5%BC%95/"/>
<category term="Mysql" scheme="https://nicksxs.me/categories/C/Mysql/"/>
<category term="mysql" scheme="https://nicksxs.me/tags/mysql/"/>
<category term="索引" scheme="https://nicksxs.me/tags/%E7%B4%A2%E5%BC%95/"/>
<category term="is null" scheme="https://nicksxs.me/tags/is-null/"/>
<category term="is not null" scheme="https://nicksxs.me/tags/is-not-null/"/>
<category term="procedure" scheme="https://nicksxs.me/tags/procedure/"/>
</entry>
<entry>
<title>从丁仲礼被美国制裁聊点啥</title>
<link href="https://nicksxs.me/2020/12/20/%E4%BB%8E%E4%B8%81%E4%BB%B2%E7%A4%BC%E8%A2%AB%E7%BE%8E%E5%9B%BD%E5%88%B6%E8%A3%81%E8%81%8A%E7%82%B9%E5%95%A5/"/>
<id>https://nicksxs.me/2020/12/20/%E4%BB%8E%E4%B8%81%E4%BB%B2%E7%A4%BC%E8%A2%AB%E7%BE%8E%E5%9B%BD%E5%88%B6%E8%A3%81%E8%81%8A%E7%82%B9%E5%95%A5/</id>
<published>2020-12-20T15:18:50.000Z</published>
<updated>2020-12-20T15:18:50.349Z</updated>
<summary type="html">
&lt;p&gt;几年前看了柴静的《穹顶之下》觉得这个记者调查得很深入，挺有水平，然后再看到了她跟丁仲礼的采访，其实没看完整，也没试着去理解，就觉得环境问题挺严重的，为啥柴静这个对面的这位好像对这个很不屑的样子，最近因为丁仲礼上了美国制裁名单，B
</summary>
<category term="生活" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/"/>
<category term="吐槽" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/%E5%90%90%E6%A7%BD/"/>
<category term="疫情" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/%E5%90%90%E6%A7%BD/%E7%96%AB%E6%83%85/"/>
<category term="美国" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/%E5%90%90%E6%A7%BD/%E7%96%AB%E6%83%85/%E7%BE%8E%E5%9B%BD/"/>
<category term="生活" scheme="https://nicksxs.me/tags/%E7%94%9F%E6%B4%BB/"/>
<category term="吐槽" scheme="https://nicksxs.me/tags/%E5%90%90%E6%A7%BD/"/>
<category term="疫情" scheme="https://nicksxs.me/tags/%E7%96%AB%E6%83%85/"/>
<category term="美国" scheme="https://nicksxs.me/tags/%E7%BE%8E%E5%9B%BD/"/>
</entry>
<entry>
<title>Leetcode 105 从前序与中序遍历序列构造二叉树(Construct Binary Tree from Preorder and Inorder Traversal) 题解分析</title>
<link href="https://nicksxs.me/2020/12/13/Leetcode-105-%E4%BB%8E%E5%89%8D%E5%BA%8F%E4%B8%8E%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal-%E9%A2%98%E8%A7%A3%E5%88%86%E6%9E%90/"/>
<id>https://nicksxs.me/2020/12/13/Leetcode-105-%E4%BB%8E%E5%89%8D%E5%BA%8F%E4%B8%8E%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal-%E9%A2%98%E8%A7%A3%E5%88%86%E6%9E%90/</id>
<published>2020-12-13T13:19:43.000Z</published>
<updated>2020-12-13T13:19:43.353Z</updated>
<summary type="html">
&lt;h2 id=&quot;题目介绍&quot;&gt;&lt;a href=&quot;#题目介绍&quot; class=&quot;headerlink&quot; title=&quot;题目介绍&quot;&gt;&lt;/a&gt;题目介绍&lt;/h2&gt;&lt;p&gt;Given preorder and inorder traversal of a tree, construct the
</summary>
<category term="Java" scheme="https://nicksxs.me/categories/Java/"/>
<category term="leetcode" scheme="https://nicksxs.me/categories/leetcode/"/>
<category term="Binary Tree" scheme="https://nicksxs.me/categories/Binary-Tree/"/>
<category term="java" scheme="https://nicksxs.me/categories/leetcode/java/"/>
<category term="Binary Tree" scheme="https://nicksxs.me/categories/leetcode/java/Binary-Tree/"/>
<category term="DFS" scheme="https://nicksxs.me/categories/leetcode/java/Binary-Tree/DFS/"/>
<category term="leetcode" scheme="https://nicksxs.me/tags/leetcode/"/>
<category term="java" scheme="https://nicksxs.me/tags/java/"/>
<category term="Binary Tree" scheme="https://nicksxs.me/tags/Binary-Tree/"/>
<category term="二叉树" scheme="https://nicksxs.me/tags/%E4%BA%8C%E5%8F%89%E6%A0%91/"/>
<category term="题解" scheme="https://nicksxs.me/tags/%E9%A2%98%E8%A7%A3/"/>
<category term="递归" scheme="https://nicksxs.me/tags/%E9%80%92%E5%BD%92/"/>
<category term="Preorder Traversal" scheme="https://nicksxs.me/tags/Preorder-Traversal/"/>
<category term="Inorder Traversal" scheme="https://nicksxs.me/tags/Inorder-Traversal/"/>
<category term="前序" scheme="https://nicksxs.me/tags/%E5%89%8D%E5%BA%8F/"/>
<category term="中序" scheme="https://nicksxs.me/tags/%E4%B8%AD%E5%BA%8F/"/>
</entry>
<entry>
<title>Leetcode 155 最小栈(Min Stack) 题解分析</title>
<link href="https://nicksxs.me/2020/12/06/Leetcode-155-%E6%9C%80%E5%B0%8F%E6%A0%88-Min-Stack-%E9%A2%98%E8%A7%A3%E5%88%86%E6%9E%90/"/>
<id>https://nicksxs.me/2020/12/06/Leetcode-155-%E6%9C%80%E5%B0%8F%E6%A0%88-Min-Stack-%E9%A2%98%E8%A7%A3%E5%88%86%E6%9E%90/</id>
<published>2020-12-06T13:55:55.000Z</published>
<updated>2020-12-06T13:55:55.404Z</updated>
<summary type="html">
&lt;h2 id=&quot;题目介绍&quot;&gt;&lt;a href=&quot;#题目介绍&quot; class=&quot;headerlink&quot; title=&quot;题目介绍&quot;&gt;&lt;/a&gt;题目介绍&lt;/h2&gt;&lt;p&gt;Design a stack that supports push, pop, top, and retrieving
</summary>
<category term="Java" scheme="https://nicksxs.me/categories/Java/"/>
<category term="leetcode" scheme="https://nicksxs.me/categories/leetcode/"/>
<category term="java" scheme="https://nicksxs.me/categories/leetcode/java/"/>
<category term="stack" scheme="https://nicksxs.me/categories/stack/"/>
<category term="stack" scheme="https://nicksxs.me/categories/leetcode/java/stack/"/>
<category term="leetcode" scheme="https://nicksxs.me/tags/leetcode/"/>
<category term="java" scheme="https://nicksxs.me/tags/java/"/>
<category term="题解" scheme="https://nicksxs.me/tags/%E9%A2%98%E8%A7%A3/"/>
<category term="stack" scheme="https://nicksxs.me/tags/stack/"/>
<category term="min stack" scheme="https://nicksxs.me/tags/min-stack/"/>
<category term="最小栈" scheme="https://nicksxs.me/tags/%E6%9C%80%E5%B0%8F%E6%A0%88/"/>
<category term="leetcode 155" scheme="https://nicksxs.me/tags/leetcode-155/"/>
</entry>
<entry>
<title>从清华美院学姐聊聊我们身边的恶人</title>
<link href="https://nicksxs.me/2020/11/29/%E4%BB%8E%E6%B8%85%E5%8D%8E%E7%BE%8E%E9%99%A2%E5%AD%A6%E5%A7%90%E8%81%8A%E8%81%8A%E6%88%91%E4%BB%AC%E8%BA%AB%E8%BE%B9%E7%9A%84%E6%81%B6%E4%BA%BA/"/>
<id>https://nicksxs.me/2020/11/29/%E4%BB%8E%E6%B8%85%E5%8D%8E%E7%BE%8E%E9%99%A2%E5%AD%A6%E5%A7%90%E8%81%8A%E8%81%8A%E6%88%91%E4%BB%AC%E8%BA%AB%E8%BE%B9%E7%9A%84%E6%81%B6%E4%BA%BA/</id>
<published>2020-11-29T15:55:41.000Z</published>
<updated>2020-11-29T15:55:41.170Z</updated>
<summary type="html">
&lt;p&gt;前几天清华美院学姐的热点火了，然后仔细看了下，其实是个学姐诬陷以为其貌不扬的男同学摸她屁股&lt;br&gt;&lt;img data-src=&quot;https://gitee.com/nicksxs/images/raw/master/uPic/ZovTIK.jpg&quot;
</summary>
<category term="生活" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/"/>
<category term="吐槽" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/%E5%90%90%E6%A7%BD/"/>
<category term="疫情" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/%E5%90%90%E6%A7%BD/%E7%96%AB%E6%83%85/"/>
<category term="口罩" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/%E5%90%90%E6%A7%BD/%E7%96%AB%E6%83%85/%E5%8F%A3%E7%BD%A9/"/>
<category term="生活" scheme="https://nicksxs.me/tags/%E7%94%9F%E6%B4%BB/"/>
<category term="吐槽" scheme="https://nicksxs.me/tags/%E5%90%90%E6%A7%BD/"/>
<category term="疫情" scheme="https://nicksxs.me/tags/%E7%96%AB%E6%83%85/"/>
<category term="公交车" scheme="https://nicksxs.me/tags/%E5%85%AC%E4%BA%A4%E8%BD%A6/"/>
<category term="口罩" scheme="https://nicksxs.me/tags/%E5%8F%A3%E7%BD%A9/"/>
<category term="杀人诛心" scheme="https://nicksxs.me/tags/%E6%9D%80%E4%BA%BA%E8%AF%9B%E5%BF%83/"/>
</entry>
<entry>
<title>聊聊 Dubbo 的容错机制</title>
<link href="https://nicksxs.me/2020/11/22/%E8%81%8A%E8%81%8A-Dubbo-%E7%9A%84%E5%AE%B9%E9%94%99%E6%9C%BA%E5%88%B6/"/>
<id>https://nicksxs.me/2020/11/22/%E8%81%8A%E8%81%8A-Dubbo-%E7%9A%84%E5%AE%B9%E9%94%99%E6%9C%BA%E5%88%B6/</id>
<published>2020-11-22T13:37:55.000Z</published>
<updated>2020-11-22T13:37:55.756Z</updated>
<summary type="html">
&lt;p&gt;之前看了 dubbo 的一些代码，在学习过程中，主要关注那些比较“高级”的内容，SPI，自适应扩展等，却忘了一些作为一个 rpc
</summary>
<category term="Java" scheme="https://nicksxs.me/categories/Java/"/>
<category term="Dubbo" scheme="https://nicksxs.me/categories/Dubbo/"/>
<category term="Dubbo - RPC" scheme="https://nicksxs.me/categories/Dubbo-RPC/"/>
<category term="容错机制" scheme="https://nicksxs.me/categories/Dubbo/%E5%AE%B9%E9%94%99%E6%9C%BA%E5%88%B6/"/>
<category term="Java" scheme="https://nicksxs.me/tags/Java/"/>
<category term="Dubbo" scheme="https://nicksxs.me/tags/Dubbo/"/>
<category term="RPC" scheme="https://nicksxs.me/tags/RPC/"/>
<category term="容错机制" scheme="https://nicksxs.me/tags/%E5%AE%B9%E9%94%99%E6%9C%BA%E5%88%B6/"/>
</entry>
<entry>
<title>Leetcode 234 回文链表(Palindrome Linked List) 题解分析</title>
<link href="https://nicksxs.me/2020/11/15/Leetcode-234-%E5%9B%9E%E6%96%87%E8%81%94%E8%A1%A8-Palindrome-Linked-List-%E9%A2%98%E8%A7%A3%E5%88%86%E6%9E%90/"/>
<id>https://nicksxs.me/2020/11/15/Leetcode-234-%E5%9B%9E%E6%96%87%E8%81%94%E8%A1%A8-Palindrome-Linked-List-%E9%A2%98%E8%A7%A3%E5%88%86%E6%9E%90/</id>
<published>2020-11-15T15:47:20.000Z</published>
<updated>2020-12-13T12:59:06.873Z</updated>
<summary type="html">
&lt;h2 id=&quot;题目介绍&quot;&gt;&lt;a href=&quot;#题目介绍&quot; class=&quot;headerlink&quot; title=&quot;题目介绍&quot;&gt;&lt;/a&gt;题目介绍&lt;/h2&gt;&lt;p&gt;Given a singly linked list, determine if it is a
</summary>
<category term="Java" scheme="https://nicksxs.me/categories/Java/"/>
<category term="leetcode" scheme="https://nicksxs.me/categories/leetcode/"/>
<category term="Linked List" scheme="https://nicksxs.me/categories/Linked-List/"/>
<category term="java" scheme="https://nicksxs.me/categories/leetcode/java/"/>
<category term="Linked List" scheme="https://nicksxs.me/categories/leetcode/java/Linked-List/"/>
<category term="leetcode" scheme="https://nicksxs.me/tags/leetcode/"/>
<category term="java" scheme="https://nicksxs.me/tags/java/"/>
<category term="题解" scheme="https://nicksxs.me/tags/%E9%A2%98%E8%A7%A3/"/>
<category term="Linked List" scheme="https://nicksxs.me/tags/Linked-List/"/>
</entry>
<entry>
<title>聊聊 Java 的类加载机制一</title>
<link href="https://nicksxs.me/2020/11/08/%E8%81%8A%E8%81%8A-Java-%E7%9A%84%E7%B1%BB%E5%8A%A0%E8%BD%BD%E6%9C%BA%E5%88%B6/"/>
<id>https://nicksxs.me/2020/11/08/%E8%81%8A%E8%81%8A-Java-%E7%9A%84%E7%B1%BB%E5%8A%A0%E8%BD%BD%E6%9C%BA%E5%88%B6/</id>
<published>2020-11-08T14:53:19.000Z</published>
<updated>2020-11-08T14:55:23.000Z</updated>
<summary type="html">
&lt;p&gt;一说到这个主题，想到的应该是双亲委派模型，不过讲的包括但不限于这个，主要内容是参考深入理解 Java 虚拟机书中的介绍，&lt;br&gt;一个类型的生命周期包含了七个阶段，加载，验证，准备，解析，初始化，使用，卸载。&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;h2 id=&quot;加载&quot;&gt;&lt;a
</summary>
<category term="Java" scheme="https://nicksxs.me/categories/Java/"/>
<category term="类加载" scheme="https://nicksxs.me/categories/Java/%E7%B1%BB%E5%8A%A0%E8%BD%BD/"/>
</entry>
<entry>
<title>Apollo 的 value 注解是怎么自动更新的</title>
<link href="https://nicksxs.me/2020/11/01/Apollo-%E7%9A%84-value-%E6%B3%A8%E8%A7%A3%E6%98%AF%E6%80%8E%E4%B9%88%E8%87%AA%E5%8A%A8%E6%9B%B4%E6%96%B0%E7%9A%84/"/>
<id>https://nicksxs.me/2020/11/01/Apollo-%E7%9A%84-value-%E6%B3%A8%E8%A7%A3%E6%98%AF%E6%80%8E%E4%B9%88%E8%87%AA%E5%8A%A8%E6%9B%B4%E6%96%B0%E7%9A%84/</id>
<published>2020-11-01T15:26:43.000Z</published>
<updated>2020-11-01T15:29:20.000Z</updated>
<summary type="html">
&lt;p&gt;在前司和目前公司，用的配置中心都是使用的 Apollo，经过了业界验证，比较强大的配置管理系统，特别是在0.10 后开始支持对使用 value 注解的配置值进行自动更新，今天刚好有个同学问到我，就顺便写篇文章记录下，其实也是借助于 spring 强大的 bean
</summary>
<category term="Java" scheme="https://nicksxs.me/categories/Java/"/>
<category term="Apollo" scheme="https://nicksxs.me/categories/Java/Apollo/"/>
<category term="value" scheme="https://nicksxs.me/categories/Java/Apollo/value/"/>
<category term="Java" scheme="https://nicksxs.me/tags/Java/"/>
<category term="Apollo" scheme="https://nicksxs.me/tags/Apollo/"/>
<category term="value" scheme="https://nicksxs.me/tags/value/"/>
<category term="注解" scheme="https://nicksxs.me/tags/%E6%B3%A8%E8%A7%A3/"/>
<category term="environment" scheme="https://nicksxs.me/tags/environment/"/>
</entry>
<entry>
<title>Leetcode 104 二叉树的最大深度(Maximum Depth of Binary Tree) 题解分析</title>
<link href="https://nicksxs.me/2020/10/25/Leetcode-104-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6-Maximum-Depth-of-Binary-Tree-%E9%A2%98%E8%A7%A3%E5%88%86%E6%9E%90/"/>
<id>https://nicksxs.me/2020/10/25/Leetcode-104-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6-Maximum-Depth-of-Binary-Tree-%E9%A2%98%E8%A7%A3%E5%88%86%E6%9E%90/</id>
<published>2020-10-25T15:43:29.000Z</published>
<updated>2020-10-25T15:43:29.000Z</updated>
<summary type="html">
&lt;h2 id=&quot;题目介绍&quot;&gt;&lt;a href=&quot;#题目介绍&quot; class=&quot;headerlink&quot;
</summary>
<category term="Java" scheme="https://nicksxs.me/categories/Java/"/>
<category term="leetcode" scheme="https://nicksxs.me/categories/leetcode/"/>
<category term="Binary Tree" scheme="https://nicksxs.me/categories/Binary-Tree/"/>
<category term="java" scheme="https://nicksxs.me/categories/leetcode/java/"/>
<category term="Binary Tree" scheme="https://nicksxs.me/categories/leetcode/java/Binary-Tree/"/>
<category term="DFS" scheme="https://nicksxs.me/categories/leetcode/java/Binary-Tree/DFS/"/>
<category term="leetcode" scheme="https://nicksxs.me/tags/leetcode/"/>
<category term="java" scheme="https://nicksxs.me/tags/java/"/>
<category term="Binary Tree" scheme="https://nicksxs.me/tags/Binary-Tree/"/>
<category term="DFS" scheme="https://nicksxs.me/tags/DFS/"/>
<category term="二叉树" scheme="https://nicksxs.me/tags/%E4%BA%8C%E5%8F%89%E6%A0%91/"/>
<category term="题解" scheme="https://nicksxs.me/tags/%E9%A2%98%E8%A7%A3/"/>
</entry>
<entry>
<title>在老丈人家的小工记五</title>
<link href="https://nicksxs.me/2020/10/18/%E5%9C%A8%E8%80%81%E4%B8%88%E4%BA%BA%E5%AE%B6%E7%9A%84%E5%B0%8F%E5%B7%A5%E8%AE%B0%E4%BA%94/"/>
<id>https://nicksxs.me/2020/10/18/%E5%9C%A8%E8%80%81%E4%B8%88%E4%BA%BA%E5%AE%B6%E7%9A%84%E5%B0%8F%E5%B7%A5%E8%AE%B0%E4%BA%94/</id>
<published>2020-10-18T15:14:52.000Z</published>
<updated>2020-10-18T15:15:50.000Z</updated>
<summary type="html">
&lt;p&gt;终于回忆起来了，年纪大了写这种东西真的要立马写，不然很容易想不起来，那天应该是 9 月 12 日，也就是上周六，因为我爸也去了，而且娘亲（丈母娘，LD
</summary>
<category term="生活" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/"/>
<category term="运动" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/%E8%BF%90%E5%8A%A8/"/>
<category term="跑步" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/%E8%BF%90%E5%8A%A8/%E8%B7%91%E6%AD%A5/"/>
<category term="干活" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/%E8%BF%90%E5%8A%A8/%E8%B7%91%E6%AD%A5/%E5%B9%B2%E6%B4%BB/"/>
<category term="生活" scheme="https://nicksxs.me/tags/%E7%94%9F%E6%B4%BB/"/>
<category term="运动" scheme="https://nicksxs.me/tags/%E8%BF%90%E5%8A%A8/"/>
<category term="减肥" scheme="https://nicksxs.me/tags/%E5%87%8F%E8%82%A5/"/>
<category term="跑步" scheme="https://nicksxs.me/tags/%E8%B7%91%E6%AD%A5/"/>
<category term="干活" scheme="https://nicksxs.me/tags/%E5%B9%B2%E6%B4%BB/"/>
<category term="小技巧" scheme="https://nicksxs.me/tags/%E5%B0%8F%E6%8A%80%E5%B7%A7/"/>
</entry>
<entry>
<title>Leetcode 2 Add Two Numbers 题解分析</title>
<link href="https://nicksxs.me/2020/10/11/Leetcode-2-Add-Two-Numbers-%E9%A2%98%E8%A7%A3%E5%88%86%E6%9E%90/"/>
<id>https://nicksxs.me/2020/10/11/Leetcode-2-Add-Two-Numbers-%E9%A2%98%E8%A7%A3%E5%88%86%E6%9E%90/</id>
<published>2020-10-11T15:22:45.000Z</published>
<updated>2020-10-11T15:23:51.000Z</updated>
<summary type="html">
&lt;p&gt;又 roll 到了一个以前做过的题，不过现在用 Java 也来写一下，是 easy 级别的，所以就简单说下&lt;/p&gt;
&lt;h2 id=&quot;简要介绍&quot;&gt;&lt;a href=&quot;#简要介绍&quot; class=&quot;headerlink&quot;
</summary>
<category term="Java" scheme="https://nicksxs.me/categories/Java/"/>
<category term="leetcode" scheme="https://nicksxs.me/categories/leetcode/"/>
<category term="java" scheme="https://nicksxs.me/categories/leetcode/java/"/>
<category term="linked list" scheme="https://nicksxs.me/categories/linked-list/"/>
<category term="linked list" scheme="https://nicksxs.me/categories/leetcode/java/linked-list/"/>
<category term="leetcode" scheme="https://nicksxs.me/tags/leetcode/"/>
<category term="java" scheme="https://nicksxs.me/tags/java/"/>
<category term="题解" scheme="https://nicksxs.me/tags/%E9%A2%98%E8%A7%A3/"/>
<category term="linked list" scheme="https://nicksxs.me/tags/linked-list/"/>
</entry>
<entry>
<title>mybatis 的缓存是怎么回事</title>
<link href="https://nicksxs.me/2020/10/03/mybatis-%E7%9A%84%E7%BC%93%E5%AD%98%E6%98%AF%E6%80%8E%E4%B9%88%E5%9B%9E%E4%BA%8B/"/>
<id>https://nicksxs.me/2020/10/03/mybatis-%E7%9A%84%E7%BC%93%E5%AD%98%E6%98%AF%E6%80%8E%E4%B9%88%E5%9B%9E%E4%BA%8B/</id>
<published>2020-10-03T14:43:13.000Z</published>
<updated>2020-10-03T14:43:13.000Z</updated>
<summary type="html">
&lt;p&gt;Java 真的是任何一个中间件，比较常用的那种，都有很多内容值得深挖，比如这个缓存，慢慢有过一些感悟，比如如何提升性能，缓存无疑是一大重要手段，最底层开始 CPU
</summary>
<category term="Java" scheme="https://nicksxs.me/categories/Java/"/>
<category term="Mybatis" scheme="https://nicksxs.me/categories/Java/Mybatis/"/>
<category term="Spring" scheme="https://nicksxs.me/categories/Spring/"/>
<category term="Mybatis" scheme="https://nicksxs.me/categories/Spring/Mybatis/"/>
<category term="Mybatis" scheme="https://nicksxs.me/categories/Mybatis/"/>
<category term="缓存" scheme="https://nicksxs.me/categories/Mybatis/%E7%BC%93%E5%AD%98/"/>
<category term="Java" scheme="https://nicksxs.me/tags/Java/"/>
<category term="Mysql" scheme="https://nicksxs.me/tags/Mysql/"/>
<category term="Mybatis" scheme="https://nicksxs.me/tags/Mybatis/"/>
<category term="缓存" scheme="https://nicksxs.me/tags/%E7%BC%93%E5%AD%98/"/>
</entry>
<entry>
<title>在老丈人家的小工记四</title>
<link href="https://nicksxs.me/2020/09/26/%E5%9C%A8%E8%80%81%E4%B8%88%E4%BA%BA%E5%AE%B6%E7%9A%84%E5%B0%8F%E5%B7%A5%E8%AE%B0%E5%9B%9B/"/>
<id>https://nicksxs.me/2020/09/26/%E5%9C%A8%E8%80%81%E4%B8%88%E4%BA%BA%E5%AE%B6%E7%9A%84%E5%B0%8F%E5%B7%A5%E8%AE%B0%E5%9B%9B/</id>
<published>2020-09-26T15:48:05.000Z</published>
<updated>2020-09-26T15:48:05.000Z</updated>
<summary type="html">
&lt;h2 id=&quot;小工记四&quot;&gt;&lt;a href=&quot;#小工记四&quot; class=&quot;headerlink&quot;
</summary>
<category term="生活" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/"/>
<category term="运动" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/%E8%BF%90%E5%8A%A8/"/>
<category term="跑步" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/%E8%BF%90%E5%8A%A8/%E8%B7%91%E6%AD%A5/"/>
<category term="干活" scheme="https://nicksxs.me/categories/%E7%94%9F%E6%B4%BB/%E8%BF%90%E5%8A%A8/%E8%B7%91%E6%AD%A5/%E5%B9%B2%E6%B4%BB/"/>
<category term="生活" scheme="https://nicksxs.me/tags/%E7%94%9F%E6%B4%BB/"/>
<category term="运动" scheme="https://nicksxs.me/tags/%E8%BF%90%E5%8A%A8/"/>
<category term="减肥" scheme="https://nicksxs.me/tags/%E5%87%8F%E8%82%A5/"/>
<category term="跑步" scheme="https://nicksxs.me/tags/%E8%B7%91%E6%AD%A5/"/>
<category term="干活" scheme="https://nicksxs.me/tags/%E5%B9%B2%E6%B4%BB/"/>
<category term="小技巧" scheme="https://nicksxs.me/tags/%E5%B0%8F%E6%8A%80%E5%B7%A7/"/>
</entry>
</feed>