diff --git "a/BACKUP/45_10\346\234\210\344\273\275-11\346\234\210\344\273\275\350\256\241\345\210\222\360\237\215\276.md" "b/BACKUP/45_10\346\234\210\344\273\275-11\346\234\210\344\273\275\350\256\241\345\210\222\360\237\215\276.md"
index d83a596..32fc86f 100644
--- "a/BACKUP/45_10\346\234\210\344\273\275-11\346\234\210\344\273\275\350\256\241\345\210\222\360\237\215\276.md"
+++ "b/BACKUP/45_10\346\234\210\344\273\275-11\346\234\210\344\273\275\350\256\241\345\210\222\360\237\215\276.md"
@@ -8,4 +8,8 @@
 - [ ] 开源项目（整理core项目并开源）
 - [x] 软考备考
 - [ ] 一周3跑 (至少5k）
-- [ ] 10-11月份总结复盘
\ No newline at end of file
+- [ ] 10-11月份总结复盘
+
+---
+
+鸽了好多 但是都在缓慢前进中  值得庆幸的是 赶在秋招末班车  拿下上市公司的实习机会的同时  并签了一个保底的秋招offer   希望不负所望  越来越好  ！  
\ No newline at end of file
diff --git a/feed.xml b/feed.xml
index b7aa6d5..34a5d09 100644
--- a/feed.xml
+++ b/feed.xml
@@ -1,5 +1,5 @@
 <?xml version='1.0' encoding='UTF-8'?>
-<feed xmlns="http://www.w3.org/2005/Atom"><id>https://github.com/HealUP/MyBlog</id><title>RSS feed of HealUP's MyBlog</title><updated>2023-12-14T15:49:37.593537+00:00</updated><author><name>HealUP</name><email>1571826275@qq.com</email></author><link href="https://github.com/HealUP/MyBlog"/><link href="https://raw.githubusercontent.com/HealUP/MyBlog/master/feed.xml" rel="self"/><generator uri="https://lkiesow.github.io/python-feedgen" version="0.9.0">python-feedgen</generator><entry><id>https://github.com/HealUP/MyBlog/issues/45</id><title>10月份-11月份计划🍾</title><updated>2023-12-14T15:49:37.859404+00:00</updated><content type="html"><![CDATA[<h2>行动是解决焦虑的最好方式！💪</h2>
+<feed xmlns="http://www.w3.org/2005/Atom"><id>https://github.com/HealUP/MyBlog</id><title>RSS feed of HealUP's MyBlog</title><updated>2023-12-14T15:51:40.773761+00:00</updated><author><name>HealUP</name><email>1571826275@qq.com</email></author><link href="https://github.com/HealUP/MyBlog"/><link href="https://raw.githubusercontent.com/HealUP/MyBlog/master/feed.xml" rel="self"/><generator uri="https://lkiesow.github.io/python-feedgen" version="0.9.0">python-feedgen</generator><entry><id>https://github.com/HealUP/MyBlog/issues/45</id><title>10月份-11月份计划🍾</title><updated>2023-12-14T15:51:41.048853+00:00</updated><content type="html"><![CDATA[<h2>行动是解决焦虑的最好方式！💪</h2>
 <ul>
 <li><input checked="" disabled="" type="checkbox"> 坚持投简历 -&gt; 找工作（<strong>实习转正</strong>）</li>
 <li><input checked="" disabled="" type="checkbox"> 毕业设计代码开发达到60%</li>
@@ -9,7 +9,7 @@
 <li><input disabled="" type="checkbox"> 一周3跑 (至少5k）</li>
 <li><input disabled="" type="checkbox"> 10-11月份总结复盘</li>
 </ul>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/45" rel="alternate"/><category term="TODO"/><published>2023-10-21T09:04:12+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/44</id><title>8月份计划🗓️</title><updated>2023-12-14T15:49:37.945847+00:00</updated><content type="html"><![CDATA[<p>八月份已经过得差不多了，补充下八月份的计划</p>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/45" rel="alternate"/><category term="TODO"/><published>2023-10-21T09:04:12+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/44</id><title>8月份计划🗓️</title><updated>2023-12-14T15:51:41.176745+00:00</updated><content type="html"><![CDATA[<p>八月份已经过得差不多了，补充下八月份的计划</p>
 <h2></h2>
 <ul>
 <li><input checked="" disabled="" type="checkbox"> 准备面试（八股）模拟面试</li>
@@ -21,7 +21,7 @@
 <li><input checked="" disabled="" type="checkbox"> 完成实习的周记</li>
 <li><input checked="" disabled="" type="checkbox"> 单词500</li>
 </ul>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/44" rel="alternate"/><category term="TODO"/><published>2023-08-21T13:47:43+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/42</id><title>UML图</title><updated>2023-12-14T15:49:38.047126+00:00</updated><content type="html"><![CDATA[<h2>UML图</h2>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/44" rel="alternate"/><category term="TODO"/><published>2023-08-21T13:47:43+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/42</id><title>UML图</title><updated>2023-12-14T15:51:41.270551+00:00</updated><content type="html"><![CDATA[<h2>UML图</h2>
 <p>统一建模语言（Unified Modeling Language，缩写UML）是非专利的第三代建模和规约语言。
 UML是一种开放的方法，用于说明、可视化、构建和编写一个正在开发的、面向对象的、软件密集系统的制品的开放方法。
 分类：
@@ -66,7 +66,7 @@ UML是一种开放的方法，用于说明、可视化、构建和编写一个
 组合：部分若脱离了整体，则不复存在
 关联：长期性的
 依赖：临时性的</p>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/42" rel="alternate"/><category term="设计模式"/><published>2023-07-29T15:11:47+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/41</id><title>28. 找出字符串中第一个匹配项的下标——KMP算法</title><updated>2023-12-14T15:49:38.133803+00:00</updated><content type="html"><![CDATA[<p>KMP算法
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/42" rel="alternate"/><category term="设计模式"/><published>2023-07-29T15:11:47+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/41</id><title>28. 找出字符串中第一个匹配项的下标——KMP算法</title><updated>2023-12-14T15:51:41.362033+00:00</updated><content type="html"><![CDATA[<p>KMP算法
 <strong>28. 找出字符串中第一个匹配项的下标</strong></p>
 <blockquote>
 <p>思路：使用KMP算法，<strong>一定要构造next数组</strong>（即前缀表）</p>
@@ -142,7 +142,7 @@ UML是一种开放的方法，用于说明、可视化、构建和编写一个
         }
 }
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/41" rel="alternate"/><category term="算法"/><published>2023-07-10T23:59:55+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/40</id><title>单例模式</title><updated>2023-12-14T15:49:38.242561+00:00</updated><content type="html"><![CDATA[<p><strong>单例模式类图展示：</strong>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/41" rel="alternate"/><category term="算法"/><published>2023-07-10T23:59:55+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/40</id><title>单例模式</title><updated>2023-12-14T15:51:41.469632+00:00</updated><content type="html"><![CDATA[<p><strong>单例模式类图展示：</strong>
 <img src="https://s2.loli.net/2023/07/11/7RVzkAmlCKx6bJw.png" alt="image.png" /></p>
 <blockquote>
 <p>单例模式就是一个类只能有一个对象
@@ -272,7 +272,7 @@ UML是一种开放的方法，用于说明、可视化、构建和编写一个
 }
 </code></pre>
 <p>总结：：一般情况下，不建议使用懒汉方式，<strong>建议使用饿汉方式</strong>(<strong>线程安全，但没有懒加载</strong>)。只有在要<strong>明确实现 lazy loading 效果</strong>时，才会使用<strong>登记方式</strong>。如果涉及到<strong>反序列化创建对象</strong>时，可以尝试使用枚举方式。如果有其他特殊的需求，可以考虑使用双检锁方式。</p>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/40" rel="alternate"/><category term="设计模式"/><published>2023-07-10T23:22:59+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/39</id><title>策略模式</title><updated>2023-12-14T15:49:38.335003+00:00</updated><content type="html"><![CDATA[<p>1.UML图
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/40" rel="alternate"/><category term="设计模式"/><published>2023-07-10T23:22:59+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/39</id><title>策略模式</title><updated>2023-12-14T15:51:41.561331+00:00</updated><content type="html"><![CDATA[<p>1.UML图
 统一建模语言（Unified Modeling Language，缩写UML）是非专利的第三代建模和规约语言。
 UML是一种开放的方法，用于说明、可视化、构建和编写一个正在开发的、面向对象的、软件密集系统的制品的开放方法。
 分类：
@@ -385,7 +385,7 @@ public class OperationMultiply implements Strategy{
 10 * 5 = 50
 
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/39" rel="alternate"/><category term="设计模式"/><published>2023-07-06T00:04:03+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/38</id><title>🗓️7月份计划</title><updated>2023-12-14T15:49:38.443157+00:00</updated><content type="html"><![CDATA[<ul>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/39" rel="alternate"/><category term="设计模式"/><published>2023-07-06T00:04:03+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/38</id><title>🗓️7月份计划</title><updated>2023-12-14T15:51:41.669897+00:00</updated><content type="html"><![CDATA[<ul>
 <li><input checked="" disabled="" type="checkbox"> 熟悉公司项目🧑‍💻⭐⭐⭐</li>
 <li><input checked="" disabled="" type="checkbox"> 结合项目持续学习redis🧑‍💻⭐⭐⭐</li>
 <li><input checked="" disabled="" type="checkbox"> 设计模式🧑‍💻⭐⭐⭐</li>
@@ -398,7 +398,7 @@ public class OperationMultiply implements Strategy{
 <li><input checked="" disabled="" type="checkbox"> 算法+SQL⭐⭐</li>
 <li><input checked="" disabled="" type="checkbox"> 月度总结❗</li>
 </ul>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/38" rel="alternate"/><category term="TODO"/><published>2023-07-01T15:20:19+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/37</id><title>索引✅</title><updated>2023-12-14T15:49:38.546586+00:00</updated><content type="html"><![CDATA[<h1>1.索引</h1>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/38" rel="alternate"/><category term="TODO"/><published>2023-07-01T15:20:19+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/37</id><title>索引✅</title><updated>2023-12-14T15:51:41.787319+00:00</updated><content type="html"><![CDATA[<h1>1.索引</h1>
 <h2>1.1 创建索引的方式</h2>
 <p>索引就是用来帮助表快速检索目标数据的
 那么，索引有哪几种创建方式：
@@ -545,7 +545,7 @@ DROP INDEX indexName ON tableName;
 2.误区：虽然MySQL默认会使用主键上建立的索引作为聚簇索引，但也可以指定其他字段上的索引为聚簇索引，一般聚簇索引要求索引必须是非空唯一索引才行。
 3.如果表中就算没有定义主键，InnoDB中会选择一个唯一的非空索引作为聚簇索引，但如果非空唯一索引也不存在，InnoDB隐式定义一个主键来作为聚簇索引（一般适合采用带有自增性的顺序值）。</p>
 </blockquote>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/37" rel="alternate"/><category term="MySQL"/><published>2023-06-11T15:45:50+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/35</id><title>🗓️6月份计划</title><updated>2023-12-14T15:49:38.658201+00:00</updated><content type="html"><![CDATA[<h1>👣
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/37" rel="alternate"/><category term="MySQL"/><published>2023-06-11T15:45:50+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/35</id><title>🗓️6月份计划</title><updated>2023-12-14T15:51:41.897362+00:00</updated><content type="html"><![CDATA[<h1>👣
 热爱生活，感受当下！加油！🌝</h1>
 <ul>
 <li><input checked="" disabled="" type="checkbox"> 找到一份Java后端的实习岗位</li>
@@ -561,7 +561,7 @@ DROP INDEX indexName ON tableName;
 <li>设计模并运用到项目</li>
 <li><input checked="" disabled="" type="checkbox"> 八股文持续总结输出</li>
 </ul>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/35" rel="alternate"/><category term="TODO"/><published>2023-06-02T14:55:22+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/33</id><title>快速排序⭐⭐⭐</title><updated>2023-12-14T15:49:38.746980+00:00</updated><content type="html"><![CDATA[<p>理论基础：快速排序是一种常见的排序算法，使用分治的思想来排序一个数组或列表。它的基本思想是选择一个<strong>基准数</strong>，<strong>将数组分成两个部分</strong>，一部分是小于基准数的，另一部分是大于等于基准数的，然后再对这两部分递归地进行排序</p>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/35" rel="alternate"/><category term="TODO"/><published>2023-06-02T14:55:22+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/33</id><title>快速排序⭐⭐⭐</title><updated>2023-12-14T15:51:41.986438+00:00</updated><content type="html"><![CDATA[<p>理论基础：快速排序是一种常见的排序算法，使用分治的思想来排序一个数组或列表。它的基本思想是选择一个<strong>基准数</strong>，<strong>将数组分成两个部分</strong>，一部分是小于基准数的，另一部分是大于等于基准数的，然后再对这两部分递归地进行排序</p>
 <p>时间复杂度：nlogn</p>
 <p>具体步骤如下：</p>
 <ol>
@@ -602,7 +602,7 @@ DROP INDEX indexName ON tableName;
     }
 }
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/33" rel="alternate"/><category term="算法"/><published>2023-05-24T15:36:17+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/32</id><title>LC 111. 二叉树的最小深度</title><updated>2023-12-14T15:49:38.838499+00:00</updated><content type="html"><![CDATA[<h3>111. 二叉树的最小深度</h3>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/33" rel="alternate"/><category term="算法"/><published>2023-05-24T15:36:17+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/32</id><title>LC 111. 二叉树的最小深度</title><updated>2023-12-14T15:51:42.097161+00:00</updated><content type="html"><![CDATA[<h3>111. 二叉树的最小深度</h3>
 <blockquote>
 <p>思路：遍历每一层的时候，记录次数；当该节点的左右节点都为空的时候，直接返回当前的深度即可，如果左右节点不为空就加入队列</p>
 </blockquote>
@@ -631,7 +631,7 @@ DROP INDEX indexName ON tableName;
     }
 }
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/32" rel="alternate"/><category term="算法"/><published>2023-05-18T15:42:21+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/31</id><title>LC 117. 填充每个节点的下一个右侧节点指针II</title><updated>2023-12-14T15:49:38.915608+00:00</updated><content type="html"><![CDATA[<h3>117. 填充每个节点的下一个右侧节点指针II</h3>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/32" rel="alternate"/><category term="算法"/><published>2023-05-18T15:42:21+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/31</id><title>LC 117. 填充每个节点的下一个右侧节点指针II</title><updated>2023-12-14T15:51:42.265960+00:00</updated><content type="html"><![CDATA[<h3>117. 填充每个节点的下一个右侧节点指针II</h3>
 <blockquote>
 <p>该题目和116的区别：就是116题是完全二叉树，这道题不是完全二叉树，题解完全一样的。<strong><code>略</code></strong></p>
 </blockquote>
@@ -661,7 +661,7 @@ DROP INDEX indexName ON tableName;
     }
 }
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/31" rel="alternate"/><category term="算法"/><published>2023-05-18T15:41:53+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/30</id><title>LC 116. 填充每个节点的下一个右侧节点指针</title><updated>2023-12-14T15:49:38.997202+00:00</updated><content type="html"><![CDATA[<h3>116. 填充每个节点的下一个右侧节点指针</h3>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/31" rel="alternate"/><category term="算法"/><published>2023-05-18T15:41:53+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/30</id><title>LC 116. 填充每个节点的下一个右侧节点指针</title><updated>2023-12-14T15:51:42.354220+00:00</updated><content type="html"><![CDATA[<h3>116. 填充每个节点的下一个右侧节点指针</h3>
 <blockquote>
 <p>思路：</p>
 </blockquote>
@@ -716,7 +716,7 @@ class Solution {
     }
 }
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/30" rel="alternate"/><category term="算法"/><published>2023-05-18T15:41:12+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/29</id><title>LC 515. 在每个树行中找最大值</title><updated>2023-12-14T15:49:39.102713+00:00</updated><content type="html"><![CDATA[<h3>515. 在每个树行中找最大值</h3>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/30" rel="alternate"/><category term="算法"/><published>2023-05-18T15:41:12+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/29</id><title>LC 515. 在每个树行中找最大值</title><updated>2023-12-14T15:51:42.447861+00:00</updated><content type="html"><![CDATA[<h3>515. 在每个树行中找最大值</h3>
 <blockquote>
 <p>思路：层序遍历，取每一层的最大值，放到一维数组，最后返回结果集</p>
 </blockquote>
@@ -754,7 +754,7 @@ class Solution {
     }
 }
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/29" rel="alternate"/><category term="算法"/><published>2023-05-18T15:38:38+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/28</id><title>N叉树的层序遍历</title><updated>2023-12-14T15:49:39.197139+00:00</updated><content type="html"><![CDATA[<h3>N叉树的层序遍历</h3>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/29" rel="alternate"/><category term="算法"/><published>2023-05-18T15:38:38+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/28</id><title>N叉树的层序遍历</title><updated>2023-12-14T15:51:42.522678+00:00</updated><content type="html"><![CDATA[<h3>N叉树的层序遍历</h3>
 <blockquote>
 <p>思路：依然是层序遍历，只是<strong>节点的孩子有多个了</strong>，children也是List<Node>类型的,将节点的所有孩子遍历后全部放入队列即可：</p>
 </blockquote>
@@ -816,7 +816,7 @@ class Node {
     }
 };
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/28" rel="alternate"/><category term="算法"/><published>2023-05-18T15:38:00+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/27</id><title>LC 637. 二叉树的层平均值</title><updated>2023-12-14T15:49:39.292732+00:00</updated><content type="html"><![CDATA[<h3>637. 二叉树的层平均值</h3>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/28" rel="alternate"/><category term="算法"/><published>2023-05-18T15:38:00+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/27</id><title>LC 637. 二叉树的层平均值</title><updated>2023-12-14T15:51:42.633071+00:00</updated><content type="html"><![CDATA[<h3>637. 二叉树的层平均值</h3>
 <p>思路：</p>
 <ul>
 <li>层次遍历的时候，每一层求一个总和</li>
@@ -859,7 +859,7 @@ class Node {
 }
 因为len改变了，就无法计算sum/len了，这点要注意
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/27" rel="alternate"/><category term="算法"/><published>2023-05-18T15:36:44+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/26</id><title>LC107. 二叉树的层次遍历</title><updated>2023-12-14T15:49:39.385543+00:00</updated><content type="html"><![CDATA[<h3>3.2 107. 二叉树的层次遍历</h3>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/27" rel="alternate"/><category term="算法"/><published>2023-05-18T15:36:44+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/26</id><title>LC107. 二叉树的层次遍历</title><updated>2023-12-14T15:51:42.754607+00:00</updated><content type="html"><![CDATA[<h3>3.2 107. 二叉树的层次遍历</h3>
 <pre><code class="language-java">class Solution {
     public List&lt;List&lt;Integer&gt;&gt; levelOrderBottom(TreeNode root) {
         /*思路：
@@ -901,7 +901,7 @@ class Node {
     }
 }
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/26" rel="alternate"/><category term="算法"/><published>2023-05-18T15:36:11+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/25</id><title>LC 102.二叉树的层序遍历</title><updated>2023-12-14T15:49:39.475914+00:00</updated><content type="html"><![CDATA[<h3>102. 二叉树的层次遍历</h3>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/26" rel="alternate"/><category term="算法"/><published>2023-05-18T15:36:11+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/25</id><title>LC 102.二叉树的层序遍历</title><updated>2023-12-14T15:51:42.854266+00:00</updated><content type="html"><![CDATA[<h3>102. 二叉树的层次遍历</h3>
 <blockquote>
 <p><strong>思路</strong>：</p>
 </blockquote>
@@ -968,7 +968,7 @@ class Solution {
     }
 }
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/25" rel="alternate"/><category term="算法"/><published>2023-05-18T15:33:22+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/24</id><title>剑指 Offer 29. 顺时针打印矩阵</title><updated>2023-12-14T15:49:39.576034+00:00</updated><content type="html"><![CDATA[<h3>[<a href="https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/">剑指 Offer 29. 顺时针打印矩阵</a>](https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/)</h3>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/25" rel="alternate"/><category term="算法"/><published>2023-05-18T15:33:22+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/24</id><title>剑指 Offer 29. 顺时针打印矩阵</title><updated>2023-12-14T15:51:42.947168+00:00</updated><content type="html"><![CDATA[<h3>[<a href="https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/">剑指 Offer 29. 顺时针打印矩阵</a>](https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/)</h3>
 <p><strong>思路分析：根据题目示例 matrix = [[1,2,3],[4,5,6],[7,8,9]] 的对应</strong>输出 [1,2,3,6,9,8,7,4,5] 可以发现，顺时针打印矩阵的顺序是 “从左向右、从上向下、从右向左、从下向上” 循环。</p>
 <p><a href="https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/solution/mian-shi-ti-29-shun-shi-zhen-da-yin-ju-zhen-she-d">https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/solution/mian-shi-ti-29-shun-shi-zhen-da-yin-ju-zhen-she-d</a></p>
 <pre><code class="language-java">class Solution {
@@ -1014,7 +1014,7 @@ class Solution {
 <blockquote>
 <p>小厂笔试第一题</p>
 </blockquote>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/24" rel="alternate"/><category term="算法"/><published>2023-05-12T11:30:48+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/23</id><title>LC 226.翻转二叉树 ⭐⭐⭐⭐</title><updated>2023-12-14T15:49:39.679275+00:00</updated><content type="html"><![CDATA[<h3>226. 翻转二叉树</h3>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/24" rel="alternate"/><category term="算法"/><published>2023-05-12T11:30:48+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/23</id><title>LC 226.翻转二叉树 ⭐⭐⭐⭐</title><updated>2023-12-14T15:51:43.033103+00:00</updated><content type="html"><![CDATA[<h3>226. 翻转二叉树</h3>
 <blockquote>
 <p>解决方案包括<strong>递归法</strong>和<strong>非递归</strong>法：</p>
 <ul>
@@ -1086,7 +1086,7 @@ class Solution {
 }
 </code></pre>
 <h3></h3>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/23" rel="alternate"/><category term="算法"/><published>2023-05-12T11:28:53+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/22</id><title>LC双周赛 —6300. 最小公共值</title><updated>2023-12-14T15:49:39.764726+00:00</updated><content type="html"><![CDATA[<p>##第 96 场</p>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/23" rel="alternate"/><category term="算法"/><published>2023-05-12T11:28:53+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/22</id><title>LC双周赛 —6300. 最小公共值</title><updated>2023-12-14T15:51:43.144121+00:00</updated><content type="html"><![CDATA[<p>##第 96 场</p>
 <p><strong>双周赛 —6300. 最小公共值</strong></p>
 <p>题目链接：<a href="https://leetcode.cn/contest/biweekly-contest-96/problems/minimum-common-value/">https://leetcode.cn/contest/biweekly-contest-96/problems/minimum-common-value/</a></p>
 <p>自己写的：</p>
@@ -1140,7 +1140,7 @@ class Solution {
     }
 }
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/22" rel="alternate"/><category term="算法"/><published>2023-05-11T07:28:46+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/21</id><title>349. 两个数组的交集🤓🤓</title><updated>2023-12-14T15:49:39.864322+00:00</updated><content type="html"><![CDATA[<h2>哈希法—set集合实现</h2>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/22" rel="alternate"/><category term="算法"/><published>2023-05-11T07:28:46+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/21</id><title>349. 两个数组的交集🤓🤓</title><updated>2023-12-14T15:51:43.244508+00:00</updated><content type="html"><![CDATA[<h2>哈希法—set集合实现</h2>
 <h3>2.1 349. 两个数组的交集</h3>
 <p><strong>一些提示：</strong></p>
 <ul>
@@ -1191,7 +1191,7 @@ resSet.stream()：对 resSet 集合进行流操作，返回一个 Stream&lt;Inte
 <li>
 </li>
 </ul>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/21" rel="alternate"/><category term="算法"/><published>2023-05-11T07:24:00+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/20</id><title>时间复杂度❗</title><updated>2023-12-14T15:49:39.956059+00:00</updated><content type="html"><![CDATA[<p>如图所示：
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/21" rel="alternate"/><category term="算法"/><published>2023-05-11T07:24:00+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/20</id><title>时间复杂度❗</title><updated>2023-12-14T15:51:43.329500+00:00</updated><content type="html"><![CDATA[<p>如图所示：
 <img src="https://s2.loli.net/2023/05/11/OJAsnZ8d7gpSVuz.png" alt="image-20230510150615098.png" />
 (图来源不明，侵删，抱歉)</p>
 <ul>
@@ -1215,7 +1215,7 @@ resSet.stream()：对 resSet 集合进行流操作，返回一个 Stream&lt;Inte
 <p>指数阶:增长得非常快，在实际应用中一般是不能被接受的。若一个问题使用「暴力枚举」求解的时间复杂度是 O(2^n) ，那么一般都需要使用**「动态规划」或「贪心算法」**等算法来求解</p>
 </li>
 </ul>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/20" rel="alternate"/><category term="算法"/><published>2023-05-11T07:08:16+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/19</id><title>LC242. 有效的字母异位词🤓🤓</title><updated>2023-12-14T15:49:40.045283+00:00</updated><content type="html"><![CDATA[<h2>哈希法—数组实现</h2>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/20" rel="alternate"/><category term="算法"/><published>2023-05-11T07:08:16+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/19</id><title>LC242. 有效的字母异位词🤓🤓</title><updated>2023-12-14T15:51:43.433962+00:00</updated><content type="html"><![CDATA[<h2>哈希法—数组实现</h2>
 <p><strong>思路分析</strong>：</p>
 <p>使用一个数组记录字符串S出现的次数，若该字母出现了一次，该位置的元素值加一；再遍历另外一个字符串，若出现一次就在数组对应位置的值减一。</p>
 <blockquote>
@@ -1245,7 +1245,7 @@ resSet.stream()：对 resSet 集合进行流操作，返回一个 Stream&lt;Inte
     }
 }
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/19" rel="alternate"/><category term="算法"/><published>2023-05-11T06:58:36+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/18</id><title>LC215. 数组中的第K个最大元素</title><updated>2023-12-14T15:49:40.136631+00:00</updated><content type="html"><![CDATA[<h4>[<a href="https://leetcode.cn/problems/kth-largest-element-in-an-array/">215. 数组中的第K个最大元素</a>](https://leetcode.cn/problems/kth-largest-element-in-an-array/)</h4>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/19" rel="alternate"/><category term="算法"/><published>2023-05-11T06:58:36+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/18</id><title>LC215. 数组中的第K个最大元素</title><updated>2023-12-14T15:51:43.532905+00:00</updated><content type="html"><![CDATA[<h4>[<a href="https://leetcode.cn/problems/kth-largest-element-in-an-array/">215. 数组中的第K个最大元素</a>](https://leetcode.cn/problems/kth-largest-element-in-an-array/)</h4>
 <pre><code class="language-java">class Solution {
     public int findKthLargest(int[] nums, int k) {
         // 快速排序 小的放到右边，大的放到左边即可
@@ -1283,7 +1283,7 @@ resSet.stream()：对 resSet 集合进行流操作，返回一个 Stream&lt;Inte
     }
 }
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/18" rel="alternate"/><category term="算法"/><published>2023-05-11T06:41:05+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/17</id><title>LC912. 排序数组 </title><updated>2023-12-14T15:49:40.222220+00:00</updated><content type="html"><![CDATA[<blockquote>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/18" rel="alternate"/><category term="算法"/><published>2023-05-11T06:41:05+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/17</id><title>LC912. 排序数组 </title><updated>2023-12-14T15:51:43.633784+00:00</updated><content type="html"><![CDATA[<blockquote>
 <p>理论基础：快速排序是一种常见的排序算法，使用分治的思想来排序一个数组或列表。它的基本思想是选择一个<strong>基准数</strong>，<strong>将数组分成两个部分</strong>，一部分是小于基准数的，另一部分是大于等于基准数的，然后再对这两部分递归地进行排序。</p>
 </blockquote>
 <p>好的情况：<strong>时间复杂度：nlogn</strong></p>
@@ -1383,7 +1383,7 @@ resSet.stream()：对 resSet 集合进行流操作，返回一个 Stream&lt;Inte
 }
 
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/17" rel="alternate"/><category term="算法"/><published>2023-05-11T06:38:11+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/16</id><title>LC 20.有效的括号⭐⭐⭐⭐</title><updated>2023-12-14T15:49:40.312172+00:00</updated><content type="html"><![CDATA[<p>20.有效的括号🤓🤓</p>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/17" rel="alternate"/><category term="算法"/><published>2023-05-11T06:38:11+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/16</id><title>LC 20.有效的括号⭐⭐⭐⭐</title><updated>2023-12-14T15:51:43.769845+00:00</updated><content type="html"><![CDATA[<p>20.有效的括号🤓🤓</p>
 <ul>
 <li><strong>括号匹配是使用栈解决的经典问题</strong></li>
 </ul>
@@ -1431,7 +1431,7 @@ resSet.stream()：对 resSet 集合进行流操作，返回一个 Stream&lt;Inte
     }
 }
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/16" rel="alternate"/><category term="算法"/><published>2023-05-10T06:39:17+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/15</id><title>LC 704.二分查找⭐⭐⭐⭐</title><updated>2023-12-14T15:49:40.412942+00:00</updated><content type="html"><![CDATA[<p>704.二分查找🤓🤓
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/16" rel="alternate"/><category term="算法"/><published>2023-05-10T06:39:17+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/15</id><title>LC 704.二分查找⭐⭐⭐⭐</title><updated>2023-12-14T15:51:43.879686+00:00</updated><content type="html"><![CDATA[<p>704.二分查找🤓🤓
 <strong>思路分析：</strong></p>
 <blockquote>
 <p>二分查找法是一种在<strong>有序数组</strong>中查找某一特定元素的搜索算法。搜索过程从数组的中间元素开始，如果中间元素正好是要查找的元素，则搜索过程结束；如果某一特定元素大于或者小于中间元素，则在数组大于或小于中间元素的那一半中查找，而且跟开始一样从中间元素开始比较。如果在某一步骤数组为空，则代表找不到。这种搜索算法每一次比较都使搜索范围缩小一半</p>
@@ -1470,7 +1470,7 @@ resSet.stream()：对 resSet 集合进行流操作，返回一个 Stream&lt;Inte
         return -1;
     }
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/15" rel="alternate"/><category term="算法"/><published>2023-05-10T06:31:49+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/14</id><title>LC 27.移除元素 &amp; 26.删除排序数组中的重复项⭐⭐⭐⭐</title><updated>2023-12-14T15:49:40.515575+00:00</updated><content type="html"><![CDATA[<h3>快慢指针</h3>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/15" rel="alternate"/><category term="算法"/><published>2023-05-10T06:31:49+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/14</id><title>LC 27.移除元素 &amp; 26.删除排序数组中的重复项⭐⭐⭐⭐</title><updated>2023-12-14T15:51:43.968286+00:00</updated><content type="html"><![CDATA[<h3>快慢指针</h3>
 <p><strong>通过一个快指针和慢指针在一个for循环下完成两个for循环的工作。</strong></p>
 <ul>
 <li>
@@ -1524,7 +1524,7 @@ resSet.stream()：对 resSet 集合进行流操作，返回一个 Stream&lt;Inte
     }
 }
 </code></pre>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/14" rel="alternate"/><category term="算法"/><published>2023-05-10T06:29:04+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/13</id><title>📌刷题策略</title><updated>2023-12-14T15:49:40.580588+00:00</updated><content type="html"><![CDATA[<h3>以下是个人总结的刷题方法💡</h3>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/14" rel="alternate"/><category term="算法"/><published>2023-05-10T06:29:04+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/13</id><title>📌刷题策略</title><updated>2023-12-14T15:51:44.070303+00:00</updated><content type="html"><![CDATA[<h3>以下是个人总结的刷题方法💡</h3>
 <ul>
 <li>
 <p>初刷（<strong>一题控制在半小时</strong>）</p>
@@ -1557,10 +1557,10 @@ resSet.stream()：对 resSet 集合进行流操作，返回一个 Stream&lt;Inte
 </blockquote>
 </li>
 </ul>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/13" rel="alternate"/><published>2023-05-10T06:22:07+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/12</id><title>于香港中文大学</title><updated>2023-12-14T15:49:40.782284+00:00</updated><content type="html"><![CDATA[<p>这次省赛原本是2022年应该举办的，但是由于疫情延迟到了今天，本次的举办地点香港中文大学深圳校区，先附上几张图片吧。
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/13" rel="alternate"/><published>2023-05-10T06:22:07+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/12</id><title>于香港中文大学</title><updated>2023-12-14T15:51:44.284928+00:00</updated><content type="html"><![CDATA[<p>这次省赛原本是2022年应该举办的，但是由于疫情延迟到了今天，本次的举办地点香港中文大学深圳校区，先附上几张图片吧。
 <img src="https://user-images.githubusercontent.com/72082506/233777613-10306e27-b9eb-45f0-962d-9cb7e95a5523.jpeg" alt="mmexport42474e6a459898e414415f83633a8d1a_1682136901577" />
 <img src="https://user-images.githubusercontent.com/72082506/233777623-267a2964-b349-4601-813d-95208364df1f.jpg" alt="20230421_235020" /></p>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/12" rel="alternate"/><category term="Orienteering"/><published>2023-04-22T10:07:33+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/11</id><title>5月份计划🗓️</title><updated>2023-12-14T15:49:40.851729+00:00</updated><content type="html"><![CDATA[<ul>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/12" rel="alternate"/><category term="Orienteering"/><published>2023-04-22T10:07:33+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/11</id><title>5月份计划🗓️</title><updated>2023-12-14T15:51:44.375215+00:00</updated><content type="html"><![CDATA[<ul>
 <li><input checked="" disabled="" type="checkbox"> 算法笔记迁移 &amp; 复习旧题</li>
 <li><input checked="" disabled="" type="checkbox"> 分类总结八股文</li>
 <li><input checked="" disabled="" type="checkbox"> 简历项目面试准备</li>
@@ -1568,8 +1568,8 @@ resSet.stream()：对 resSet 集合进行流操作，返回一个 Stream&lt;Inte
 <li><input checked="" disabled="" type="checkbox"> 准备软考</li>
 <li><input checked="" disabled="" type="checkbox"> 完善wyy项目</li>
 </ul>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/11" rel="alternate"/><category term="TODO"/><published>2023-04-18T01:47:17+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/10</id><title>蓝桥杯</title><updated>2023-12-14T15:49:40.949546+00:00</updated><content type="html"><![CDATA[<p>这段时间也没怎么刷蓝桥的题了，感觉8号的蓝桥杯要g，也算是预料之内吧。当然，当初报名的初心就是能通过报名算法类的竞赛，提高自己的算法能力，然后大概100天的时间，也刷了LC大概160道（摆烂式刷题），系统学了数据结构等知识，也总结了算法笔记，让自己对曾经不敢接触的东西，有了新的认知。总之，收获还是有的，这300块的报名费，值得，目的算是达到了。希望后面的时间，也要继续做题，冲。</p>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/10" rel="alternate"/><category term="upup"/><published>2023-04-06T01:53:01+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/9</id><title>数据库又被黑了 真佛了...</title><updated>2023-12-14T15:49:41.029196+00:00</updated><content type="html"><![CDATA[<h2>README_TO_RECOVER_YOUR_DATA</h2>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/11" rel="alternate"/><category term="TODO"/><published>2023-04-18T01:47:17+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/10</id><title>蓝桥杯</title><updated>2023-12-14T15:51:44.460524+00:00</updated><content type="html"><![CDATA[<p>这段时间也没怎么刷蓝桥的题了，感觉8号的蓝桥杯要g，也算是预料之内吧。当然，当初报名的初心就是能通过报名算法类的竞赛，提高自己的算法能力，然后大概100天的时间，也刷了LC大概160道（摆烂式刷题），系统学了数据结构等知识，也总结了算法笔记，让自己对曾经不敢接触的东西，有了新的认知。总之，收获还是有的，这300块的报名费，值得，目的算是达到了。希望后面的时间，也要继续做题，冲。</p>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/10" rel="alternate"/><category term="upup"/><published>2023-04-06T01:53:01+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/9</id><title>数据库又被黑了 真佛了...</title><updated>2023-12-14T15:51:44.595049+00:00</updated><content type="html"><![CDATA[<h2>README_TO_RECOVER_YOUR_DATA</h2>
 <blockquote>
 <p>由于自己练手项目的数据库用的mongodb，想着练手，不重要，当时没做安全考虑，将配置文件上传到了仓库。后来想着还是添加到忽略的文件中，但是不起作用，改得了一次提交，改不了所有的提交记录，由于之前的提交记录仍然存在账号密码，想着应该没人会搞吧，即使搞了也不重要，就没去折腾了。</p>
 </blockquote>
@@ -1582,21 +1582,21 @@ resSet.stream()：对 resSet 集合进行流操作，返回一个 Stream&lt;Inte
 <p>还是同样的操作，重建了数据库，这次快多了。设置了比较强的密码！！</p>
 <p>期待下一次！🥲
 💤</p>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/9" rel="alternate"/><category term="upup"/><published>2023-03-29T16:46:07+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/8</id><title>报了软考 预言家说：铁定能过！</title><updated>2023-12-14T15:49:41.128966+00:00</updated><content type="html"><![CDATA[<h2>距离2023.5.27日还有大概两个月⏰</h2>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/9" rel="alternate"/><category term="upup"/><published>2023-03-29T16:46:07+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/8</id><title>报了软考 预言家说：铁定能过！</title><updated>2023-12-14T15:51:44.690973+00:00</updated><content type="html"><![CDATA[<h2>距离2023.5.27日还有大概两个月⏰</h2>
 <p>接下来的日子里，忙项目、背面经、找实习、备考等等，似乎忙不过来了
 计划一下，好好渡过，忙有所得，忙有所思
 加油吧！ </p>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/8" rel="alternate"/><category term="upup"/><published>2023-03-25T10:52:03+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/7</id><title>友情链接格式✔️</title><updated>2023-12-14T15:49:41.214329+00:00</updated><content type="html"><![CDATA[<p>显示到友情链接的方法：评论，然后将下面对应部分替换成你的，我点了爱心就可以自动添加啦。
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/8" rel="alternate"/><category term="upup"/><published>2023-03-25T10:52:03+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/7</id><title>友情链接格式✔️</title><updated>2023-12-14T15:51:44.789416+00:00</updated><content type="html"><![CDATA[<p>显示到友情链接的方法：评论，然后将下面对应部分替换成你的，我点了爱心就可以自动添加啦。
 名字：HealUP
 链接：<a href="https://github.com/HealUP/MyBlog">https://github.com/HealUP/MyBlog</a>
 描述：blog</p>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/7" rel="alternate"/><category term="Friends"/><published>2023-03-25T05:15:45+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/6</id><title>4月份就要结束了，一些要做的事</title><updated>2023-12-14T15:49:41.307756+00:00</updated><content type="html"><![CDATA[<h2>4月份-4月中旬</h2>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/7" rel="alternate"/><category term="Friends"/><published>2023-03-25T05:15:45+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/6</id><title>4月份就要结束了，一些要做的事</title><updated>2023-12-14T15:51:44.899816+00:00</updated><content type="html"><![CDATA[<h2>4月份-4月中旬</h2>
 <ul>
 <li><input checked="" disabled="" type="checkbox"> 总结好项目</li>
 <li><input checked="" disabled="" type="checkbox"> 投简历</li>
 <li><input checked="" disabled="" type="checkbox"> 接收工作室项目</li>
 </ul>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/6" rel="alternate"/><category term="TODO"/><published>2023-03-24T13:14:38+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/4</id><title>README看起来更顺眼了！😁</title><updated>2023-12-14T15:49:41.393297+00:00</updated><content type="html"><![CDATA[<p>参考了大佬们的博客，抽了点时间美化了一下readme，主要做了以下几件事</p>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/6" rel="alternate"/><category term="TODO"/><published>2023-03-24T13:14:38+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/4</id><title>README看起来更顺眼了！😁</title><updated>2023-12-14T15:51:44.986282+00:00</updated><content type="html"><![CDATA[<p>参考了大佬们的博客，抽了点时间美化了一下readme，主要做了以下几件事</p>
 <ul>
 <li>wakatime 数据显示</li>
 </ul>
@@ -1612,7 +1612,7 @@ resSet.stream()：对 resSet 集合进行流操作，返回一个 Stream&lt;Inte
 <li>Extra pin 放了简历上的两个项目
 花了点时间折腾，之前想着放年贪吃蛇吃贡献砖块的，还不小心给另外的actions给覆盖了，又让我重搞readme,崩溃🥲 又多折腾了会</li>
 </ul>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/4" rel="alternate"/><published>2023-03-24T12:30:58+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/3</id><title>给个人PC加了一根16G的内存条，有点起飞的感觉！</title><updated>2023-12-14T15:49:41.464454+00:00</updated><content type="html"><![CDATA[<blockquote>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/4" rel="alternate"/><published>2023-03-24T12:30:58+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/3</id><title>给个人PC加了一根16G的内存条，有点起飞的感觉！</title><updated>2023-12-14T15:51:45.072887+00:00</updated><content type="html"><![CDATA[<blockquote>
 <p>电脑买的是拯救者的y7000,20款的，当时花了6100左右，想着以后可以自己扩展内存条，并且对硬盘空间要求不是很大，就买了8g的内存，512的硬盘款的，便宜点。具体配置:</p>
 </blockquote>
 <p><img src="https://user-images.githubusercontent.com/72082506/227256029-50aa38a4-6a80-4ccd-b85c-37e659b30ba8.png" alt="image" /></p>
@@ -1620,8 +1620,8 @@ resSet.stream()：对 resSet 集合进行流操作，返回一个 Stream&lt;Inte
 <li>原装内存条是8G，一年前买了一根8G的加了进去，当时是220r,老贵了。后来发现写项目跑微服务，内存一下子飙到99％🥲很不流畅，为了提高体验感，让电脑更加流畅点，索性换了16G的进去，现在好多了，同时跑多个服务+开多个软件+网页浏览，大概60％左右，爽，速度明显提高，体验感倍儿好。</li>
 </ul>
 <p><img src="https://user-images.githubusercontent.com/72082506/227259258-862929bf-7e14-43a0-9a66-07aff7a508ba.jpg" alt="0988cbc17653e4404b389f76f56d4bf" /></p>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/3" rel="alternate"/><published>2023-03-23T15:53:29+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/2</id><title>支持RSS订阅</title><updated>2023-12-14T15:49:41.551394+00:00</updated><content type="html"><![CDATA[<p>大家可以将RSS链接添加到阅读器里，方便及时获取到博客的内容，感谢关注~❤️</p>
-]]></content><link href="https://github.com/HealUP/MyBlog/issues/2" rel="alternate"/><published>2023-03-23T08:16:09+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/1</id><title>GitHub-Blog 诞生</title><updated>2023-12-14T15:49:41.642588+00:00</updated><content type="html"><![CDATA[<ul>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/3" rel="alternate"/><published>2023-03-23T15:53:29+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/2</id><title>支持RSS订阅</title><updated>2023-12-14T15:51:45.163571+00:00</updated><content type="html"><![CDATA[<p>大家可以将RSS链接添加到阅读器里，方便及时获取到博客的内容，感谢关注~❤️</p>
+]]></content><link href="https://github.com/HealUP/MyBlog/issues/2" rel="alternate"/><published>2023-03-23T08:16:09+00:00</published></entry><entry><id>https://github.com/HealUP/MyBlog/issues/1</id><title>GitHub-Blog 诞生</title><updated>2023-12-14T15:51:45.259364+00:00</updated><content type="html"><![CDATA[<ul>
 <li>
 <p>测试actions</p>
 </li>