diff --git "a/2022/10/11/\350\277\231\351\207\214\346\230\257\347\254\254\344\270\200\347\257\207\345\215\232\345\256\242\346\226\207\347\253\240/index.html" "b/2022/10/11/\350\277\231\351\207\214\346\230\257\347\254\254\344\270\200\347\257\207\345\215\232\345\256\242\346\226\207\347\253\240/index.html"
index e5f3740..d578200 100644
--- "a/2022/10/11/\350\277\231\351\207\214\346\230\257\347\254\254\344\270\200\347\257\207\345\215\232\345\256\242\346\226\207\347\253\240/index.html"
+++ "b/2022/10/11/\350\277\231\351\207\214\346\230\257\347\254\254\344\270\200\347\257\207\345\215\232\345\256\242\346\226\207\347\253\240/index.html"
@@ -116,7 +116,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -230,7 +230,7 @@ <h1 class="post-title" itemprop="name headline">
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git "a/2022/10/15/LeetCode\344\272\214\345\217\211\346\240\221\347\253\240\350\212\202/index.html" "b/2022/10/15/LeetCode\344\272\214\345\217\211\346\240\221\347\253\240\350\212\202/index.html"
index 68987dd..89e3fd9 100644
--- "a/2022/10/15/LeetCode\344\272\214\345\217\211\346\240\221\347\253\240\350\212\202/index.html"
+++ "b/2022/10/15/LeetCode\344\272\214\345\217\211\346\240\221\347\253\240\350\212\202/index.html"
@@ -122,7 +122,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -875,7 +875,7 @@ <h3 id="总结-26"><a href="#总结-26" class="headerlink" title="总结"></a>
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git "a/2022/10/18/C3P\351\230\205\350\257\273\347\254\224\350\256\260/index.html" "b/2022/10/18/C3P\351\230\205\350\257\273\347\254\224\350\256\260/index.html"
index ff3a63b..6c4efab 100644
--- "a/2022/10/18/C3P\351\230\205\350\257\273\347\254\224\350\256\260/index.html"
+++ "b/2022/10/18/C3P\351\230\205\350\257\273\347\254\224\350\256\260/index.html"
@@ -118,7 +118,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -2206,7 +2206,7 @@ <h1 id="文本查询程序"><a href="#文本查询程序" class="headerlink" tit
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git "a/2022/11/05/LeetCode\345\233\236\346\272\257\347\256\227\346\263\225\347\253\240\350\212\202/index.html" "b/2022/11/05/LeetCode\345\233\236\346\272\257\347\256\227\346\263\225\347\253\240\350\212\202/index.html"
index f8012f3..626666d 100644
--- "a/2022/11/05/LeetCode\345\233\236\346\272\257\347\256\227\346\263\225\347\253\240\350\212\202/index.html"
+++ "b/2022/11/05/LeetCode\345\233\236\346\272\257\347\256\227\346\263\225\347\253\240\350\212\202/index.html"
@@ -123,7 +123,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -593,7 +593,7 @@ <h3 id="总结-14"><a href="#总结-14" class="headerlink" title="总结"></a>
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git "a/2022/11/09/C3P\347\254\254\344\270\211\343\200\201\345\233\233\351\203\250\345\210\206/index.html" "b/2022/11/09/C3P\347\254\254\344\270\211\343\200\201\345\233\233\351\203\250\345\210\206/index.html"
index 5da789d..2826a5f 100644
--- "a/2022/11/09/C3P\347\254\254\344\270\211\343\200\201\345\233\233\351\203\250\345\210\206/index.html"
+++ "b/2022/11/09/C3P\347\254\254\344\270\211\343\200\201\345\233\233\351\203\250\345\210\206/index.html"
@@ -117,7 +117,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -623,7 +623,7 @@ <h3 id="模板编译"><a href="#模板编译" class="headerlink" title="模板
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git "a/2022/11/15/LeetCode\350\264\252\345\277\203\347\256\227\346\263\225\347\253\240\350\212\202/index.html" "b/2022/11/15/LeetCode\350\264\252\345\277\203\347\256\227\346\263\225\347\253\240\350\212\202/index.html"
index eaa91c5..6ced0c6 100644
--- "a/2022/11/15/LeetCode\350\264\252\345\277\203\347\256\227\346\263\225\347\253\240\350\212\202/index.html"
+++ "b/2022/11/15/LeetCode\350\264\252\345\277\203\347\256\227\346\263\225\347\253\240\350\212\202/index.html"
@@ -117,7 +117,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -509,7 +509,7 @@ <h3 id="总结-17"><a href="#总结-17" class="headerlink" title="总结"></a>
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git "a/2022/12/02/DP\347\253\240\350\212\202/index.html" "b/2022/12/02/DP\347\253\240\350\212\202/index.html"
index 04b98d2..5b4d2ff 100644
--- "a/2022/12/02/DP\347\253\240\350\212\202/index.html"
+++ "b/2022/12/02/DP\347\253\240\350\212\202/index.html"
@@ -27,7 +27,7 @@
 <meta property="og:description" content="DP模板 确定数组dp[i]的含义，以及下标i的含义 确定数组dp[i]的递推公式 确定数组dp[i]的初始值 确定遍历顺序 举例推导  基础DP斐波那契数列递归容易想到递归的方法来实现 12345678class Solution &amp;#123;public:    int fib(int n) &amp;#123;        if(n&lt;&#x3D;1)            return n;">
 <meta property="og:locale" content="zh_CN">
 <meta property="article:published_time" content="2022-12-02T09:23:42.000Z">
-<meta property="article:modified_time" content="2023-02-27T05:44:18.000Z">
+<meta property="article:modified_time" content="2023-10-11T02:35:43.012Z">
 <meta property="article:author" content="Kevin Huang">
 <meta name="twitter:card" content="summary">
 
@@ -104,7 +104,7 @@
       <div class="sidebar-panel-container">
         <!--noindex-->
         <div class="post-toc-wrap sidebar-panel">
-            <div class="post-toc animated"><ol class="nav"><li class="nav-item nav-level-1"><a class="nav-link" href="#DP%E6%A8%A1%E6%9D%BF"><span class="nav-number">1.</span> <span class="nav-text">DP模板</span></a></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%9F%BA%E7%A1%80DP"><span class="nav-number">2.</span> <span class="nav-text">基础DP</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97"><span class="nav-number">2.1.</span> <span class="nav-text">斐波那契数列</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E9%80%92%E5%BD%92"><span class="nav-number">2.1.1.</span> <span class="nav-text">递归</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP"><span class="nav-number">2.1.2.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E4%BC%98%E5%8C%96"><span class="nav-number">2.1.3.</span> <span class="nav-text">DP优化</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%80%BB%E7%BB%93"><span class="nav-number">2.1.4.</span> <span class="nav-text">总结</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E7%88%AC%E6%A5%BC%E6%A2%AF"><span class="nav-number">2.2.</span> <span class="nav-text">爬楼梯</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E6%80%9D%E8%B7%AF"><span class="nav-number">2.2.1.</span> <span class="nav-text">DP思路</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-1"><span class="nav-number">2.2.2.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E4%BC%98%E5%8C%96-1"><span class="nav-number">2.2.3.</span> <span class="nav-text">DP优化</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%80%BB%E7%BB%93-1"><span class="nav-number">2.2.4.</span> <span class="nav-text">总结</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%BD%BF%E7%94%A8%E6%9C%80%E5%B0%8F%E8%8A%B1%E8%B4%B9%E7%88%AC%E6%A5%BC%E6%A2%AF"><span class="nav-number">2.3.</span> <span class="nav-text">使用最小花费爬楼梯</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E6%80%9D%E8%B7%AF-1"><span class="nav-number">2.3.1.</span> <span class="nav-text">DP思路</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-2"><span class="nav-number">2.3.2.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E4%BC%98%E5%8C%96-2"><span class="nav-number">2.3.3.</span> <span class="nav-text">DP优化</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%80%BB%E7%BB%93-2"><span class="nav-number">2.3.4.</span> <span class="nav-text">总结</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84"><span class="nav-number">2.4.</span> <span class="nav-text">不同路径</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E6%80%9D%E8%B7%AF-2"><span class="nav-number">2.4.1.</span> <span class="nav-text">DP思路</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-3"><span class="nav-number">2.4.2.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E4%BC%98%E5%8C%96-3"><span class="nav-number">2.4.3.</span> <span class="nav-text">DP优化</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%80%BB%E7%BB%93-3"><span class="nav-number">2.4.4.</span> <span class="nav-text">总结</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84-II"><span class="nav-number">2.5.</span> <span class="nav-text"> 不同路径 II</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E6%80%9D%E8%B7%AF-3"><span class="nav-number">2.5.1.</span> <span class="nav-text">DP思路</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-4"><span class="nav-number">2.5.2.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E4%BC%98%E5%8C%96-4"><span class="nav-number">2.5.3.</span> <span class="nav-text">DP优化</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%80%BB%E7%BB%93-4"><span class="nav-number">2.5.4.</span> <span class="nav-text">总结</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91"><span class="nav-number">2.6.</span> <span class="nav-text">不同的二叉搜索树</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E6%80%9D%E8%B7%AF-4"><span class="nav-number">2.6.1.</span> <span class="nav-text">DP思路</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-5"><span class="nav-number">2.6.2.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%95%B0%E5%AD%A6%E8%A7%A3%E6%B3%95"><span class="nav-number">2.6.3.</span> <span class="nav-text">数学解法</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%80%BB%E7%BB%93-5"><span class="nav-number">2.6.4.</span> <span class="nav-text">总结</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%95%B4%E6%95%B0%E6%8B%86%E5%88%86"><span class="nav-number">2.7.</span> <span class="nav-text">整数拆分</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E6%80%9D%E8%B7%AF-5"><span class="nav-number">2.7.1.</span> <span class="nav-text">DP思路</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-6"><span class="nav-number">2.7.2.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E8%B4%AA%E5%BF%83"><span class="nav-number">2.7.3.</span> <span class="nav-text">贪心</span></a></li></ol></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#dfrac-f-3-f-2-x3D-dfrac-e-n-cdot-h-3-e-n-cdot-h-2-x3D-e-n-cdot-h-3-n-cdot-h-2-x3D-e-n-cdot-frac-ln-3-3-frac-ln-2-2-x3D-e-frac-n-6-cdot-2-ln-3-3-ln-2-x3D-e-frac-n-6-cdot-ln-9-ln-8-f-2-f-3-%E2%80%8B"><span class="nav-number">3.</span> <span class="nav-text">\dfrac{f(3)}{f(2)}&#x3D;\dfrac{e^{n \cdot h(3)}}{e^{n \cdot h(2)}}&#x3D;e^{n \cdot h(3)-n \cdot h(2)}&#x3D;e^{n \cdot (\frac{\ln 3}{3} - \frac{\ln 2}{2})}&#x3D;e^{\frac{n}{6} \cdot (2 \ln 3 - 3 \ln 2)}&#x3D;e^{\frac{n}{6} \cdot (\ln 9 - \ln 8)}f(2)f(3)​</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%80%BB%E7%BB%93-6"><span class="nav-number">3.0.1.</span> <span class="nav-text">总结</span></a></li></ol></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#01%E8%83%8C%E5%8C%85"><span class="nav-number">4.</span> <span class="nav-text">01背包</span></a></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85"><span class="nav-number">5.</span> <span class="nav-text">完全背包</span></a></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%A4%9A%E9%87%8D%E8%83%8C%E5%8C%85"><span class="nav-number">6.</span> <span class="nav-text">多重背包</span></a></li></ol></div>
+            <div class="post-toc animated"><ol class="nav"><li class="nav-item nav-level-1"><a class="nav-link" href="#DP%E6%A8%A1%E6%9D%BF"><span class="nav-number">1.</span> <span class="nav-text">DP模板</span></a></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%9F%BA%E7%A1%80DP"><span class="nav-number">2.</span> <span class="nav-text">基础DP</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97"><span class="nav-number">2.1.</span> <span class="nav-text">斐波那契数列</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E9%80%92%E5%BD%92"><span class="nav-number">2.1.1.</span> <span class="nav-text">递归</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP"><span class="nav-number">2.1.2.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E4%BC%98%E5%8C%96"><span class="nav-number">2.1.3.</span> <span class="nav-text">DP优化</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%80%BB%E7%BB%93"><span class="nav-number">2.1.4.</span> <span class="nav-text">总结</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E7%88%AC%E6%A5%BC%E6%A2%AF"><span class="nav-number">2.2.</span> <span class="nav-text">爬楼梯</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E6%80%9D%E8%B7%AF"><span class="nav-number">2.2.1.</span> <span class="nav-text">DP思路</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-1"><span class="nav-number">2.2.2.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E4%BC%98%E5%8C%96-1"><span class="nav-number">2.2.3.</span> <span class="nav-text">DP优化</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%80%BB%E7%BB%93-1"><span class="nav-number">2.2.4.</span> <span class="nav-text">总结</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%BD%BF%E7%94%A8%E6%9C%80%E5%B0%8F%E8%8A%B1%E8%B4%B9%E7%88%AC%E6%A5%BC%E6%A2%AF"><span class="nav-number">2.3.</span> <span class="nav-text">使用最小花费爬楼梯</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E6%80%9D%E8%B7%AF-1"><span class="nav-number">2.3.1.</span> <span class="nav-text">DP思路</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-2"><span class="nav-number">2.3.2.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E4%BC%98%E5%8C%96-2"><span class="nav-number">2.3.3.</span> <span class="nav-text">DP优化</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%80%BB%E7%BB%93-2"><span class="nav-number">2.3.4.</span> <span class="nav-text">总结</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84"><span class="nav-number">2.4.</span> <span class="nav-text">不同路径</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E6%80%9D%E8%B7%AF-2"><span class="nav-number">2.4.1.</span> <span class="nav-text">DP思路</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-3"><span class="nav-number">2.4.2.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E4%BC%98%E5%8C%96-3"><span class="nav-number">2.4.3.</span> <span class="nav-text">DP优化</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%80%BB%E7%BB%93-3"><span class="nav-number">2.4.4.</span> <span class="nav-text">总结</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84-II"><span class="nav-number">2.5.</span> <span class="nav-text"> 不同路径 II</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E6%80%9D%E8%B7%AF-3"><span class="nav-number">2.5.1.</span> <span class="nav-text">DP思路</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-4"><span class="nav-number">2.5.2.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E4%BC%98%E5%8C%96-4"><span class="nav-number">2.5.3.</span> <span class="nav-text">DP优化</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%80%BB%E7%BB%93-4"><span class="nav-number">2.5.4.</span> <span class="nav-text">总结</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91"><span class="nav-number">2.6.</span> <span class="nav-text">不同的二叉搜索树</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E6%80%9D%E8%B7%AF-4"><span class="nav-number">2.6.1.</span> <span class="nav-text">DP思路</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-5"><span class="nav-number">2.6.2.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%95%B0%E5%AD%A6%E8%A7%A3%E6%B3%95"><span class="nav-number">2.6.3.</span> <span class="nav-text">数学解法</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%80%BB%E7%BB%93-5"><span class="nav-number">2.6.4.</span> <span class="nav-text">总结</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E6%95%B4%E6%95%B0%E6%8B%86%E5%88%86"><span class="nav-number">2.7.</span> <span class="nav-text">整数拆分</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP%E6%80%9D%E8%B7%AF-5"><span class="nav-number">2.7.1.</span> <span class="nav-text">DP思路</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-6"><span class="nav-number">2.7.2.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E8%B4%AA%E5%BF%83"><span class="nav-number">2.7.3.</span> <span class="nav-text">贪心</span></a></li></ol></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#dfrac-f-3-f-2-x3D-dfrac-e-n-cdot-h-3-e-n-cdot-h-2-x3D-e-n-cdot-h-3-n-cdot-h-2-x3D-e-n-cdot-frac-ln-3-3-frac-ln-2-2-x3D-e-frac-n-6-cdot-2-ln-3-3-ln-2-x3D-e-frac-n-6-cdot-ln-9-ln-8-f-2-f-3-%E2%80%8B"><span class="nav-number">3.</span> <span class="nav-text">\dfrac{f(3)}{f(2)}&#x3D;\dfrac{e^{n \cdot h(3)}}{e^{n \cdot h(2)}}&#x3D;e^{n \cdot h(3)-n \cdot h(2)}&#x3D;e^{n \cdot (\frac{\ln 3}{3} - \frac{\ln 2}{2})}&#x3D;e^{\frac{n}{6} \cdot (2 \ln 3 - 3 \ln 2)}&#x3D;e^{\frac{n}{6} \cdot (\ln 9 - \ln 8)}f(2)f(3)​</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E6%80%BB%E7%BB%93-6"><span class="nav-number">3.0.1.</span> <span class="nav-text">总结</span></a></li></ol></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E8%82%A1%E7%A5%A8%E7%B3%BB%E5%88%97-%E7%8A%B6%E6%80%81%E6%9C%BADP"><span class="nav-number">4.</span> <span class="nav-text">股票系列(状态机DP)</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA"><span class="nav-number">4.1.</span> <span class="nav-text">买卖股票的最佳时机</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-7"><span class="nav-number">4.1.1.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E4%BC%98%E5%8C%96DP"><span class="nav-number">4.1.2.</span> <span class="nav-text">优化DP</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA-II"><span class="nav-number">4.2.</span> <span class="nav-text">### 买卖股票的最佳时机 II</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-8"><span class="nav-number">4.2.1.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E4%BC%98%E5%8C%96DP-1"><span class="nav-number">4.2.2.</span> <span class="nav-text">优化DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E8%B4%AA%E5%BF%83%E8%A7%A3%E6%B3%95"><span class="nav-number">4.2.3.</span> <span class="nav-text">贪心解法</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%E5%90%AB%E5%86%B7%E5%86%BB%E6%9C%9F"><span class="nav-number">4.3.</span> <span class="nav-text">买卖股票的最佳时机含冷冻期</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-9"><span class="nav-number">4.3.1.</span> <span class="nav-text">DP</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E4%BC%98%E5%8C%96DP-2"><span class="nav-number">4.3.2.</span> <span class="nav-text">优化DP</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%E5%90%AB%E6%89%8B%E7%BB%AD%E8%B4%B9"><span class="nav-number">4.4.</span> <span class="nav-text">买卖股票的最佳时机含手续费</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-10"><span class="nav-number">4.4.1.</span> <span class="nav-text">DP</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA-IV"><span class="nav-number">4.5.</span> <span class="nav-text">买卖股票的最佳时机 IV</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DFS%E9%80%92%E5%BD%92-%E8%AE%B0%E5%BF%86%E5%8C%96"><span class="nav-number">4.5.1.</span> <span class="nav-text">DFS递归+记忆化</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-11"><span class="nav-number">4.5.2.</span> <span class="nav-text">DP</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA-III"><span class="nav-number">4.6.</span> <span class="nav-text">买卖股票的最佳时机 III</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#DP-12"><span class="nav-number">4.6.1.</span> <span class="nav-text">DP</span></a></li></ol></li></ol></li></ol></div>
         </div>
         <!--/noindex-->
 
@@ -117,7 +117,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -185,7 +185,7 @@ <h1 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-02-27 13:44:18" itemprop="dateModified" datetime="2023-02-27T13:44:18+08:00">2023-02-27</time>
+      <time title="修改时间：2023-10-11 10:35:43" itemprop="dateModified" datetime="2023-10-11T10:35:43+08:00">2023-10-11</time>
     </span>
 
   
@@ -417,7 +417,101 @@ <h3 id="总结-6"><a href="#总结-6" class="headerlink" title="总结"></a>总
 <p>If an optimal product contains a factor f &gt;&#x3D; 4, then you can replace it with factors 2 and f-2 without losing optimality, as 2*(f-2) &#x3D; 2f-4 &gt;&#x3D; f. So you never need a factor greater than or equal to 4, meaning you only need factors 1, 2 and 3 (and 1 is of course wasteful and you’d only use it for n&#x3D;2 and n&#x3D;3, where it’s needed).</p>
 <p>For the rest I agree, 3<em>3 is simply better than 2</em>2*2, so you’d never use 2 more than twice.、</p>
 </blockquote>
-<h1 id="01背包"><a href="#01背包" class="headerlink" title="01背包"></a>01背包</h1><h1 id="完全背包"><a href="#完全背包" class="headerlink" title="完全背包"></a>完全背包</h1><h1 id="多重背包"><a href="#多重背包" class="headerlink" title="多重背包"></a>多重背包</h1>
+<h1 id="股票系列-状态机DP"><a href="#股票系列-状态机DP" class="headerlink" title="股票系列(状态机DP)"></a>股票系列(状态机DP)</h1><h2 id="买卖股票的最佳时机"><a href="#买卖股票的最佳时机" class="headerlink" title="买卖股票的最佳时机"></a><strong><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/">买卖股票的最佳时机</a></strong></h2><p>单笔交易的最大利润</p>
+<h3 id="DP-7"><a href="#DP-7" class="headerlink" title="DP"></a>DP</h3><p>用二维数组<code>dp</code>储存持有股票和非持有股票两种状态下的最大利润，</p>
+<ul>
+<li><p><code>dp[i][0]</code>表示当前不持有股票的最大利润，可得<code>dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i])</code>，即继续保持前一天不持股的最大利润，或者是将前一天的股票卖出得今天的最大利润</p>
+</li>
+<li><p><code>dp[i][1]</code>表示当前持有股票的最大利润，可得<code>dp[i][1] = max(dp[i - 1][1], -prices[i])</code>，即继续保持前一天持股或持当天股的最大值，也就是保持最低买入股价</p>
+</li>
+<li><p>根据状态转移方程将<code>dp[0][0] = 0, dp[0][1] = -price[0]</code>作为初始值</p>
+</li>
+</ul>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n][2];</span><br><span class="line">        memset(dp, 0, sizeof dp);</span><br><span class="line">        dp[0][0] = 0, dp[0][1] = -prices[0];</span><br><span class="line">        for(int i = 1; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i]);</span><br><span class="line">            dp[i][1] = max(dp[i - 1][1], - prices[i]);</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n - 1][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h3 id="优化DP"><a href="#优化DP" class="headerlink" title="优化DP"></a>优化DP</h3><p>两种状态更新过程中，只需要<code>dp[i - 1][0]</code>和<code>dp[i - 1][1]</code>两个值，那么即可用两个变量代替二维数组</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int f0 = 0, f1 = -prices[0];</span><br><span class="line">        for(const auto&amp; price : prices)</span><br><span class="line">        &#123;</span><br><span class="line">        	f1 = max(f1, -price);</span><br><span class="line">        	f0 = max(f0, f1 + price);</span><br><span class="line">        &#125;</span><br><span class="line">        return f0;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h2 id="买卖股票的最佳时机-II"><a href="#买卖股票的最佳时机-II" class="headerlink" title="### 买卖股票的最佳时机 II"></a>### <a target="_blank" rel="noopener" href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/">买卖股票的最佳时机 II</a></h2><p>多笔交易的最大利润</p>
+<h3 id="DP-8"><a href="#DP-8" class="headerlink" title="DP"></a>DP</h3><p>用二维数组<code>dp</code>储存持有股票和非持有股票两种状态下的最大利润</p>
+<ul>
+<li><p><code>dp[i][0]</code>表示当前不持有股票的最大利润，可得<code>dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i])</code>，即继续保持前一天不持股的最大利润，或者是将前一天的股票卖出得今天的最大利润</p>
+</li>
+<li><p><code>dp[i][1]</code>表示当前持有股票的最大利润，可得<code>dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] - prices[i])</code>，即继续保持前一天持股，或者将前一天持的股卖出获得利润，同一天入股的最大利润</p>
+</li>
+<li><p>根据状态转移方程将<code>dp[0][0] = 0, dp[0][1] = -price[0]</code>作为初始值</p>
+</li>
+</ul>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n][2];</span><br><span class="line">        memset(dp, 0, sizeof dp);</span><br><span class="line">        dp[0][0] = 0, dp[0][1] = -prices[0];</span><br><span class="line">        for(int i = 1; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i]);</span><br><span class="line">            dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] - prices[i]);</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n - 1][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h3 id="优化DP-1"><a href="#优化DP-1" class="headerlink" title="优化DP"></a>优化DP</h3><p>同样地，在更新过程中只用到了<code>dp[i - 1][0]</code>和<code>dp[i - 1][1]</code>两个值，用两个变量代替二维数组，另外还需要一个变量保存中间值</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        f0 = 0, f1 = -prices[0], tmp = 0;</span><br><span class="line">        for(const auto &amp; price : prices)</span><br><span class="line">        &#123;</span><br><span class="line">        	tmp = f0;</span><br><span class="line">        	f0 = max(f0, f1 + price);</span><br><span class="line">        	f1 = max(f1, tmp - price);</span><br><span class="line">        &#125;</span><br><span class="line">        return f0;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h3 id="贪心解法"><a href="#贪心解法" class="headerlink" title="贪心解法"></a>贪心解法</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int res = 0;</span><br><span class="line">        for(int i = 0; i &lt; n - 1; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            if(prices[i + 1] &gt; prices[i])</span><br><span class="line">                res += prices[i + 1] - prices[i];</span><br><span class="line">        &#125;</span><br><span class="line">        return res;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h2 id="买卖股票的最佳时机含冷冻期"><a href="#买卖股票的最佳时机含冷冻期" class="headerlink" title="买卖股票的最佳时机含冷冻期"></a><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/">买卖股票的最佳时机含冷冻期</a></h2><p>卖出股票后不能在第二天买入股票</p>
+<h3 id="DP-9"><a href="#DP-9" class="headerlink" title="DP"></a>DP</h3><p>用二维数组<code>dp</code>储存持有股票和非持有股票两种状态下的最大利润</p>
+<ul>
+<li><p><code>dp[i][0]</code>表示当前不持有股票的最大利润，可得<code>dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i])</code>，即继续保持前一天不持股的最大利润，或者是将前一天的股票卖出得今天的最大利润</p>
+</li>
+<li><p><code>dp[i][1]</code>表示当前持有股票的最大利润，由题意有一天的冷冻期可得<code>dp[i][1] = max(dp[i - 1][1], dp[i - 2][0] - prices[i])</code>，即继续保持前一天持股，或者将两天前持的股卖出获得利润，然后在当天入股的最大利润</p>
+</li>
+<li><p>根据状态转移方程将<code>dp[0][0] = 0, dp[0][1] = -price[0]</code>作为初始值</p>
+</li>
+</ul>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br></pre></td><td class="code"><pre><span class="line">/*BUGGY*/</span><br><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n][2];</span><br><span class="line">        memset(dp, 0, sizeof dp);</span><br><span class="line">        dp[0][0] = 0, dp[0][1] = -prices[0];</span><br><span class="line">        for (int i = 1; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i]);</span><br><span class="line">            if (i - 2 &gt;= 0)</span><br><span class="line">                dp[i][1] = max(dp[i - 1][1], dp[i - 2][0] - prices[i]);</span><br><span class="line">            else</span><br><span class="line">                dp[i][1] = dp[i - 1][1];</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n - 1][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<p>在考虑一个长度为3的数组作输入时，如[2, 1, 4]，初始值被设为第一天的利润，当i&#x3D;1时并没有更新，显然不合理，对此，可以将else 语句改为<code>dp[i][1] = max(dp[i - 1][1], prices[i])</code>；另外，也可以不增加额外的判断语句，将二维数组长度更改为<code>dp[n + 1][2]</code>或者<code>dp[n + 2][2]</code></p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br></pre></td><td class="code"><pre><span class="line">-----dp[n+1][2]-----</span><br><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n + 1][2];</span><br><span class="line">        memset(dp, 0, sizeof dp);</span><br><span class="line">        dp[0][0] = 0, dp[0][1] = -prices[0];</span><br><span class="line">        for (int i = 0; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            dp[i + 1][0] = max(dp[i][0], dp[i][1] + prices[i]);</span><br><span class="line">            if(i - 1 &gt;= 0)</span><br><span class="line">                dp[i + 1][1] = max(dp[i][1], dp[i - 1][0] - prices[i]);</span><br><span class="line">            else</span><br><span class="line">                dp[i + 1][1] = dp[i][1];</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br><span class="line"></span><br><span class="line">-----dp[n+2][2]-----</span><br><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n + 2][2];</span><br><span class="line">        memset(dp, 0, sizeof dp);</span><br><span class="line">        dp[0][0] = 0, dp[1][1] = -prices[0];</span><br><span class="line">        for (int i = 0; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            dp[i + 2][0] = max(dp[i + 1][0], dp[i + 1][1] + prices[i]);</span><br><span class="line">            dp[i + 2][1] = max(dp[i + 1][1], dp[i][0] - prices[i]);</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n + 1][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h3 id="优化DP-2"><a href="#优化DP-2" class="headerlink" title="优化DP"></a>优化DP</h3><p>可以观察到，更新二维数组时，只用到<code>dp[i - 1][0]</code>,<code>dp[i - 1][1]</code>和<code>dp[i - 2][0]</code>三个值，即可以用三个变量代替二维数组</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int f0 = 0, f1 = -prices[0], last = 0, tmp = 0, second = 0;</span><br><span class="line">        for (const auto&amp; price : prices)</span><br><span class="line">        &#123;</span><br><span class="line">            tmp = f0;</span><br><span class="line">            f0 = max(f0, f1 + price);</span><br><span class="line">            f1 = max(f1, second - price);</span><br><span class="line">            second = last;</span><br><span class="line">            last = f0;</span><br><span class="line">        &#125;</span><br><span class="line">        return f0;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h2 id="买卖股票的最佳时机含手续费"><a href="#买卖股票的最佳时机含手续费" class="headerlink" title="买卖股票的最佳时机含手续费"></a><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/">买卖股票的最佳时机含手续费</a></h2><p>无限制次数交易，但每笔交易需要手续费，是买卖股票的最佳时机II的变形题</p>
+<h3 id="DP-10"><a href="#DP-10" class="headerlink" title="DP"></a><strong>DP</strong></h3><p>用二维数组<code>dp</code>储存持有股票和非持有股票两种状态下的最大利润</p>
+<ul>
+<li><p><code>dp[i][0]</code>表示当前不持有股票的最大利润，可得<code>dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i])</code>，即继续保持前一天不持股的最大利润，或者是将前一天的股票卖出得今天的最大利润</p>
+</li>
+<li><p><code>dp[i][1]</code>表示当前持有股票的最大利润，可得<code>dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] - prices[i])</code>，即继续保持前一天持股，或者将前一天持的股卖出获得利润，当天入股的最大利润</p>
+</li>
+<li><p>根据状态转移方程将<code>dp[0][0] = 0, dp[0][1] = -price[0]</code>作为初始值</p>
+</li>
+</ul>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices, int fee) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n][2];</span><br><span class="line">        memset(dp, 0, sizeof dp);</span><br><span class="line">        dp[0][0] = 0, dp[0][1] = -prices[0];</span><br><span class="line">        for(int i = 1; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i] - fee);</span><br><span class="line">            dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] - prices[i]);</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n - 1][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+
+
+<h2 id="买卖股票的最佳时机-IV"><a href="#买卖股票的最佳时机-IV" class="headerlink" title="买卖股票的最佳时机 IV"></a><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iv/">买卖股票的最佳时机 IV</a></h2><p>最多完成k笔交易，需要增加一种状态表示交易数</p>
+<h3 id="DFS递归-记忆化"><a href="#DFS递归-记忆化" class="headerlink" title="DFS递归+记忆化"></a>DFS递归+记忆化</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(int k, vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int memo[n+1][k+2][2];</span><br><span class="line">        memset(memo, -1, sizeof memo);</span><br><span class="line"></span><br><span class="line">        function&lt;int (int, int, bool)&gt; dfs = [&amp;](int i, int j, bool flag)-&gt; int&#123;</span><br><span class="line">            if(j &lt; 0) // 交易次数为负，返回INT_MIN</span><br><span class="line">                return INT_MIN;</span><br><span class="line">            if(i &lt; 0) // 初始化时并没有利润，返回INT_MIN或0</span><br><span class="line">                return flag ? INT_MIN : 0;</span><br><span class="line">            if(memo[i][j][flag] != -1)</span><br><span class="line">                return memo[i][j][flag];</span><br><span class="line">            if(flag) // 持有股票</span><br><span class="line">            &#123;</span><br><span class="line">                memo[i][j][flag] = max(dfs(i - 1, j, 1), dfs(i - 1, j, 0) - prices[i]);</span><br><span class="line">                return memo[i][j][flag];</span><br><span class="line">            &#125;</span><br><span class="line">            memo[i][j][flag] = max(dfs(i - 1, j, 0), dfs(i - 1, j - 1, 1) + prices[i]);</span><br><span class="line">            return memo[i][j][flag];</span><br><span class="line">        &#125;;</span><br><span class="line"></span><br><span class="line">        return dfs(n - 1, k, 0);</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br><span class="line"></span><br></pre></td></tr></table></figure>
+
+<p>递归结束条件：交易次数不足 或 遍历完所有天数的股票，前者返回负无穷，后者返回0或负无穷作为从头开始搜索的初始条件——不持股票状态下，最大利润为0；持股票时，最大利润为负无穷</p>
+<h3 id="DP-11"><a href="#DP-11" class="headerlink" title="DP"></a><strong>DP</strong></h3><p>用三维数组<code>dp</code>储存持股和交易次数两大类状态下的最大利润</p>
+<ul>
+<li><p><code>dp[i][j][0]</code>表示当前<strong>不持有股票</strong>，<strong>交易次数为j (j &lt;&#x3D; k)<strong>时的最大利润，可得<code>dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j - 1][1] + prices[i])</code>，即继续保持前一天的最大利润，</strong>不持股也不交易</strong>，或者是<strong>在前一天持股，当天卖出状态下</strong>的最大利润</p>
+</li>
+<li><p><code>dp[i][j][1]</code>表示当前**持有股票，交易次数为j (j &lt;&#x3D; k)**的最大利润，可得<code>dp[i][j][1] = max(dp[i - 1][j][1], dp[i - 1][j][0] - prices[i])</code>，即继续保持前一天持股不交易，或者**在前一天不持股，当天购入状态下的最大利润**。<u>统一将卖出股票时才算交易完成，交易次数+1</u></p>
+</li>
+<li><p>根据状态转移方程，三维数组元素初始化为大负数（由题目数据量可知&lt;1000），再将<code>dp[0][j][0] = 0</code>作为初始值</p>
+</li>
+</ul>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(int k, vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n + 1][k + 2][2]; // [-1, k] 避免 k = -1 情况，整体右移； i同理</span><br><span class="line">        memset(dp, -0x7f, sizeof dp);// 全都初始化为INT_MIN</span><br><span class="line">        // fill_n(dp, (n+1)*2*(k+2), INT_MIN); </span><br><span class="line">        for(int j = 0; j &lt; k + 2; j++) // 在交易次数为0且不持股时，最大利润初始化为0</span><br><span class="line">        // &#123;</span><br><span class="line">            // dp[1][j][0] = 0;</span><br><span class="line">            // dp[1][j][1] = -prices[0];</span><br><span class="line">        // &#125;</span><br><span class="line">            dp[0][j][0] = 0;</span><br><span class="line">        // dp[0][j][1]? ---&gt; 需要 i 从 0 开始遍历</span><br><span class="line">        for(int i = 0; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            for(int j = 1; j &lt; k + 2; j++)</span><br><span class="line">            &#123;</span><br><span class="line">                dp[i + 1][j][0] = max(dp[i][j][0], dp[i][j - 1][1] + prices[i]);</span><br><span class="line">                dp[i + 1][j][1] = max(dp[i][j][1], dp[i][j][0] - prices[i]);</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n][k + 1][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<p>由DFS翻译成递推，可得初始条件为<code>dp[0][j][0] = 0, dp[0][j][1] = -prices[0]</code>，可以从<code>i=1</code>开始遍历而不是<code>i=0</code></p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(int k, vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n + 1][k + 2][2]; // [-1, k] 避免 k = -1 情况，整体右移； i同理</span><br><span class="line">        memset(dp, -0x7f, sizeof dp);// 全都初始化为INT_MIN</span><br><span class="line">        // fill_n(dp, (n+1)*2*(k+2), INT_MIN); </span><br><span class="line">        for(int j = 0; j &lt; k + 2; j++) // 在交易次数为0且不持股时，最大利润初始化为0</span><br><span class="line">        &#123;</span><br><span class="line">            dp[0][j][0] = 0;</span><br><span class="line">            dp[0][j][1] = -prices[0];</span><br><span class="line">        &#125;</span><br><span class="line">            // dp[0][j][0] = 0;</span><br><span class="line">        // dp[0][j][1]? ---&gt; 需要 i 从 0 开始遍历</span><br><span class="line">        for(int i = 1; i &lt;= n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            for(int j = 1; j &lt; k + 2; j++)</span><br><span class="line">            &#123;</span><br><span class="line">                dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j - 1][1] + prices[i - 1]);</span><br><span class="line">                dp[i][j][1] = max(dp[i - 1][j][1], dp[i - 1][j][0] - prices[i - 1]);</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n][k + 1][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h2 id="买卖股票的最佳时机-III"><a href="#买卖股票的最佳时机-III" class="headerlink" title="买卖股票的最佳时机 III"></a><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iii/">买卖股票的最佳时机 III</a></h2><p>最多完成两笔交易，固定数组第三维为3，表示交易的次数</p>
+<h3 id="DP-12"><a href="#DP-12" class="headerlink" title="DP"></a><strong>DP</strong></h3><p>用三维数组<code>dp</code>储存持股和交易次数两大类状态下的最大利润</p>
+<ul>
+<li><p><code>dp[i][j][0]</code>表示当前<strong>不持有股票</strong>，<strong>交易次数为j (j &lt;&#x3D; 2)<strong>时的最大利润，可得<code>dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j - 1][1] + prices[i])</code>，即继续保持前一天的最大利润，</strong>不持股也不交易</strong>，或者是<strong>在前一天持股，当天卖出状态下</strong>的最大利润</p>
+</li>
+<li><p><code>dp[i][j][1]</code>表示当前**持有股票，交易次数为j (j &lt;&#x3D; 2)**的最大利润，可得<code>dp[i][j][1] = max(dp[i - 1][j][1], dp[i - 1][j][0] - prices[i])</code>，即继续保持前一天持股不交易，或者**在前一天不持股，当天购入状态下的最大利润**。<u>统一将卖出股票时才算交易完成，交易次数+1</u></p>
+</li>
+<li><p>根据状态转移方程，三维数组元素初始化为大负数（由题目数据量可知&lt;100000），再将<code>dp[0][j][0] = 0</code>作为初始值</p>
+</li>
+</ul>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n + 1][4][2]; // [-1, k] 避免 k = -1 情况，整体右移； i同理</span><br><span class="line">        memset(dp, -0x7f, sizeof dp);// 全都初始化为INT_MIN</span><br><span class="line">        // fill_n(dp, (n+1)*2*(k+2), INT_MIN); </span><br><span class="line">        for(int j = 0; j &lt; 4; j++) // 在交易次数为0且不持股时，最大利润初始化为0</span><br><span class="line">        // &#123;</span><br><span class="line">            // dp[1][j][0] = 0;</span><br><span class="line">            // dp[1][j][1] = -prices[0];</span><br><span class="line">        // &#125;</span><br><span class="line">            dp[0][j][0] = 0;</span><br><span class="line">        // dp[0][j][1]? ---&gt; 需要 i 从 0 开始遍历</span><br><span class="line">        for(int i = 0; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            for(int j = 1; j &lt; 4; j++)</span><br><span class="line">            &#123;</span><br><span class="line">                dp[i + 1][j][0] = max(dp[i][j][0], dp[i][j - 1][1] + prices[i]);</span><br><span class="line">                dp[i + 1][j][1] = max(dp[i][j][1], dp[i][j][0] - prices[i]);</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n][3][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+
     </div>
 
     
@@ -458,7 +552,7 @@ <h1 id="01背包"><a href="#01背包" class="headerlink" title="01背包"></a>01
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git "a/2023/03/05/\346\224\271\351\200\240\350\256\241\345\210\222/index.html" "b/2023/03/05/\346\224\271\351\200\240\350\256\241\345\210\222/index.html"
index ad4fa6c..ea9468c 100644
--- "a/2023/03/05/\346\224\271\351\200\240\350\256\241\345\210\222/index.html"
+++ "b/2023/03/05/\346\224\271\351\200\240\350\256\241\345\210\222/index.html"
@@ -118,7 +118,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -265,7 +265,7 @@ <h2 id="webserver项目"><a href="#webserver项目" class="headerlink" title="we
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/2023/03/10/lab/index.html b/2023/03/10/lab/index.html
index 3139a00..15c5029 100644
--- a/2023/03/10/lab/index.html
+++ b/2023/03/10/lab/index.html
@@ -123,7 +123,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -320,7 +320,7 @@ <h2 id="配置编译环境"><a href="#配置编译环境" class="headerlink" tit
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/2023/03/12/webserver/index.html b/2023/03/12/webserver/index.html
index ece18a5..e4c7fca 100644
--- a/2023/03/12/webserver/index.html
+++ b/2023/03/12/webserver/index.html
@@ -139,7 +139,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -556,7 +556,7 @@ <h2 id="库CentOS与Ubuntu哪个更适合做服务器系统"><a href="#库CentOS
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/2023/04/11/Nginx/index.html b/2023/04/11/Nginx/index.html
index aa10157..719d835 100644
--- a/2023/04/11/Nginx/index.html
+++ b/2023/04/11/Nginx/index.html
@@ -128,7 +128,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -329,7 +329,7 @@ <h2 id="编译Nginx源码"><a href="#编译Nginx源码" class="headerlink" title
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/2023/04/19/collection/index.html b/2023/04/19/collection/index.html
index 3bd6b00..017fadb 100644
--- a/2023/04/19/collection/index.html
+++ b/2023/04/19/collection/index.html
@@ -116,7 +116,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -253,7 +253,7 @@ <h1 class="post-title" itemprop="name headline">
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git "a/2023/04/24/Leetcode\346\225\260\347\273\204\347\253\240\350\212\202/index.html" "b/2023/04/24/Leetcode\346\225\260\347\273\204\347\253\240\350\212\202/index.html"
index ccbc8aa..883e4da 100644
--- "a/2023/04/24/Leetcode\346\225\260\347\273\204\347\253\240\350\212\202/index.html"
+++ "b/2023/04/24/Leetcode\346\225\260\347\273\204\347\253\240\350\212\202/index.html"
@@ -117,7 +117,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -291,7 +291,7 @@ <h3 id="螺旋矩阵-II"><a href="#螺旋矩阵-II" class="headerlink" title="
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/2023/04/24/create_blog/index.html b/2023/04/24/create_blog/index.html
index 110c7d7..cd66e53 100644
--- a/2023/04/24/create_blog/index.html
+++ b/2023/04/24/create_blog/index.html
@@ -122,7 +122,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -276,7 +276,7 @@ <h1 id="hexo-github部署个人博客"><a href="#hexo-github部署个人博客"
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/2023/04/24/hello-world/index.html b/2023/04/24/hello-world/index.html
index 1e3b396..b1acca1 100644
--- a/2023/04/24/hello-world/index.html
+++ b/2023/04/24/hello-world/index.html
@@ -117,7 +117,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -252,7 +252,7 @@ <h3 id="Deploy-to-remote-sites"><a href="#Deploy-to-remote-sites" class="headerl
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git "a/2023/05/17/LeetCode\351\223\276\350\241\250\347\253\240\350\212\202/index.html" "b/2023/05/17/LeetCode\351\223\276\350\241\250\347\253\240\350\212\202/index.html"
index 59b7c37..4a0b062 100644
--- "a/2023/05/17/LeetCode\351\223\276\350\241\250\347\253\240\350\212\202/index.html"
+++ "b/2023/05/17/LeetCode\351\223\276\350\241\250\347\253\240\350\212\202/index.html"
@@ -116,7 +116,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -232,7 +232,7 @@ <h1 class="post-title" itemprop="name headline">
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/2023/09/26/cs144/index.html b/2023/09/26/cs144/index.html
index 714f689..ca79efe 100644
--- a/2023/09/26/cs144/index.html
+++ b/2023/09/26/cs144/index.html
@@ -19,17 +19,21 @@
 
 <script class="next-config" data-name="main" type="application/json">{"hostname":"kevin346-sc.github.io","root":"/","images":"/images","scheme":"Muse","darkmode":false,"version":"8.15.1","exturl":false,"sidebar":{"position":"left","display":"post","padding":18,"offset":12},"copycode":{"enable":false,"style":null},"bookmark":{"enable":false,"color":"#222","save":"auto"},"mediumzoom":false,"lazyload":false,"pangu":false,"comments":{"style":"tabs","active":null,"storage":true,"lazyload":false,"nav":null},"stickytabs":false,"motion":{"enable":true,"async":false,"transition":{"menu_item":"fadeInDown","post_block":"fadeIn","post_header":"fadeInDown","post_body":"fadeInDown","coll_header":"fadeInLeft","sidebar":"fadeInUp"}},"prism":false,"i18n":{"placeholder":"搜索...","empty":"没有找到任何搜索结果：${query}","hits_time":"找到 ${hits} 个搜索结果（用时 ${time} 毫秒）","hits":"找到 ${hits} 个搜索结果"}}</script><script src="/js/config.js"></script>
 
-    <meta name="description" content="c++">
+    <meta name="description" content="LAB0文档环境搭建选择 VirtualBox + CS144 Image + Xshell 远程连接 + vscode remote插件远程开发环境 安装好VirtualBox后，导入下载的实验虚拟电脑.ova文件，以cs144为账号和密码登录至虚拟机，首次登录需要修改密码 Xshell中建立以localhost为ip，2222为端口号的ssh连接，输入账号密码即可进行连接 在vscode中安装">
 <meta property="og:type" content="article">
 <meta property="og:title" content="cs144">
 <meta property="og:url" content="https://kevin346-sc.github.io/2023/09/26/cs144/index.html">
 <meta property="og:site_name" content="Serein’s Blog">
-<meta property="og:description" content="c++">
+<meta property="og:description" content="LAB0文档环境搭建选择 VirtualBox + CS144 Image + Xshell 远程连接 + vscode remote插件远程开发环境 安装好VirtualBox后，导入下载的实验虚拟电脑.ova文件，以cs144为账号和密码登录至虚拟机，首次登录需要修改密码 Xshell中建立以localhost为ip，2222为端口号的ssh连接，输入账号密码即可进行连接 在vscode中安装">
 <meta property="og:locale" content="zh_CN">
+<meta property="og:image" content="https://raw.githubusercontent.com/kevin346-sc/figure/main/202309262117800.png">
+<meta property="og:image" content="https://raw.githubusercontent.com/kevin346-sc/figure/main/202309262117167.png">
+<meta property="og:image" content="https://raw.githubusercontent.com/kevin346-sc/figure/main/202309262117837.png">
 <meta property="article:published_time" content="2023-09-26T07:10:29.000Z">
-<meta property="article:modified_time" content="2023-09-26T07:10:29.546Z">
+<meta property="article:modified_time" content="2023-10-18T01:43:38.520Z">
 <meta property="article:author" content="Kevin Huang">
 <meta name="twitter:card" content="summary">
+<meta name="twitter:image" content="https://raw.githubusercontent.com/kevin346-sc/figure/main/202309262117800.png">
 
 
 <link rel="canonical" href="https://kevin346-sc.github.io/2023/09/26/cs144/">
@@ -91,7 +95,7 @@
   
   <aside class="sidebar">
 
-    <div class="sidebar-inner sidebar-overview-active">
+    <div class="sidebar-inner sidebar-nav-active sidebar-toc-active">
       <ul class="sidebar-nav">
         <li class="sidebar-nav-toc">
           文章目录
@@ -104,6 +108,7 @@
       <div class="sidebar-panel-container">
         <!--noindex-->
         <div class="post-toc-wrap sidebar-panel">
+            <div class="post-toc animated"><ol class="nav"><li class="nav-item nav-level-1"><a class="nav-link" href="#LAB0%E6%96%87%E6%A1%A3"><span class="nav-number">1.</span> <span class="nav-text">LAB0文档</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E7%8E%AF%E5%A2%83%E6%90%AD%E5%BB%BA"><span class="nav-number">1.1.</span> <span class="nav-text">环境搭建</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%AE%9E%E9%AA%8CNetworking-by-hand"><span class="nav-number">1.2.</span> <span class="nav-text">实验Networking  by hand</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#Fetch-a-Web-page"><span class="nav-number">1.2.1.</span> <span class="nav-text">Fetch a Web page</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#Send-yourself-an-email"><span class="nav-number">1.2.2.</span> <span class="nav-text">Send yourself an email</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#Listening-and-connecting"><span class="nav-number">1.2.3.</span> <span class="nav-text">Listening and connecting</span></a></li></ol></li></ol></li></ol></div>
         </div>
         <!--/noindex-->
 
@@ -116,7 +121,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -179,6 +184,13 @@ <h1 class="post-title" itemprop="name headline">
 
       <time title="创建时间：2023-09-26 15:10:29" itemprop="dateCreated datePublished" datetime="2023-09-26T15:10:29+08:00">2023-09-26</time>
     </span>
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar-check"></i>
+      </span>
+      <span class="post-meta-item-text">更新于</span>
+      <time title="修改时间：2023-10-18 09:43:38" itemprop="dateModified" datetime="2023-10-18T09:43:38+08:00">2023-10-18</time>
+    </span>
 
   
 </div>
@@ -190,7 +202,25 @@ <h1 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-        
+        <h1 id="LAB0文档"><a href="#LAB0文档" class="headerlink" title="LAB0文档"></a>LAB0<a target="_blank" rel="noopener" href="https://cs144.github.io/assignments/check0.pdf">文档</a></h1><h2 id="环境搭建"><a href="#环境搭建" class="headerlink" title="环境搭建"></a>环境搭建</h2><p>选择 VirtualBox + <a target="_blank" rel="noopener" href="https://stanford.edu/class/cs144/vm_files/cs144-intel-2023.ova">CS144 Image</a> + Xshell 远程连接 + vscode remote插件远程开发环境</p>
+<p>安装好VirtualBox后，导入下载的实验虚拟电脑.ova文件，以cs144为账号和密码登录至虚拟机，首次登录需要修改密码</p>
+<p>Xshell中建立以localhost为ip，2222为端口号的ssh连接，输入账号密码即可进行连接</p>
+<p>在vscode中安装remote explorer插件，如图打开config配置文件，</p>
+<p><img src="https://raw.githubusercontent.com/kevin346-sc/figure/main/202309262117800.png"></p>
+<p>写上ssh连接信息</p>
+<p><img src="https://raw.githubusercontent.com/kevin346-sc/figure/main/202309262117167.png"></p>
+<p>或者点击加号新建一个ssh连接，并输入命令行</p>
+<p><img src="https://raw.githubusercontent.com/kevin346-sc/figure/main/202309262117837.png"></p>
+<p>还可以在虚拟机中添加本地电脑的ssh公钥，从而实现免密码的登录</p>
+<h2 id="实验Networking-by-hand"><a href="#实验Networking-by-hand" class="headerlink" title="实验Networking  by hand"></a>实验Networking  by hand</h2><h3 id="Fetch-a-Web-page"><a href="#Fetch-a-Web-page" class="headerlink" title="Fetch a Web page"></a>Fetch a Web page</h3><p>访问<a target="_blank" rel="noopener" href="http://cs144.keithw.org/hello">网页</a>并获取结果</p>
+<p>依次输入<code>telnet cs144.keithw.org http</code> 表明telnet程序通过http服务访问</p>
+<p><code>GET /hello HTTP/1.1</code> 表明GET方法获取URL下的路径</p>
+<p><code>Host: cs144.keithw/org</code> 表明URL中的主机名</p>
+<p><code>Connection: close</code> 表明在服务器完成响应后关闭连接</p>
+<p>需要在较短时间内完成命令输入，否则会出现408超时</p>
+<h3 id="Send-yourself-an-email"><a href="#Send-yourself-an-email" class="headerlink" title="Send yourself an email"></a>Send yourself an email</h3><p>使用telnet还可以指定让telnet程序通过smtp进行邮件发送</p>
+<h3 id="Listening-and-connecting"><a href="#Listening-and-connecting" class="headerlink" title="Listening and connecting"></a>Listening and connecting</h3><p><code>netcat -v -l -p 9090</code>即可以对端口9090进行监听，开启另一个终端输入<code>telnet localhost 9090</code>对9090端口进行访问，此时可以在两个终端上互相发送消息并立即显示到另一个终端上</p>
+
     </div>
 
     
@@ -208,6 +238,9 @@ <h1 class="post-title" itemprop="name headline">
                 </a>
             </div>
             <div class="post-nav-item">
+                <a href="/2023/11/19/template/" rel="next" title="template">
+                  template <i class="fa fa-chevron-right"></i>
+                </a>
             </div>
           </div>
     </footer>
@@ -228,7 +261,7 @@ <h1 class="post-title" itemprop="name headline">
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/2023/11/19/template/index.html b/2023/11/19/template/index.html
new file mode 100644
index 0000000..6c13f9e
--- /dev/null
+++ b/2023/11/19/template/index.html
@@ -0,0 +1,302 @@
+<!DOCTYPE html>
+<html lang="zh-CN">
+<head>
+  <meta charset="UTF-8">
+<meta name="viewport" content="width=device-width">
+<meta name="theme-color" content="#222"><meta name="generator" content="Hexo 6.3.0">
+
+  <link rel="apple-touch-icon" sizes="180x180" href="/images/apple-touch-icon-next.png">
+  <link rel="icon" type="image/png" sizes="32x32" href="/images/favicon-32x32-next.png">
+  <link rel="icon" type="image/png" sizes="16x16" href="/images/favicon-16x16-next.png">
+  <link rel="mask-icon" href="/images/logo.svg" color="#222">
+
+<link rel="stylesheet" href="/css/main.css">
+
+
+
+<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/6.4.0/css/all.min.css" integrity="sha256-HtsXJanqjKTc8vVQjO4YMhiqFoXkfBsjBWcX91T1jr8=" crossorigin="anonymous">
+  <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.1.1/animate.min.css" integrity="sha256-PR7ttpcvz8qrF57fur/yAx1qXMFJeJFiA6pSzWi0OIE=" crossorigin="anonymous">
+
+<script class="next-config" data-name="main" type="application/json">{"hostname":"kevin346-sc.github.io","root":"/","images":"/images","scheme":"Muse","darkmode":false,"version":"8.15.1","exturl":false,"sidebar":{"position":"left","display":"post","padding":18,"offset":12},"copycode":{"enable":false,"style":null},"bookmark":{"enable":false,"color":"#222","save":"auto"},"mediumzoom":false,"lazyload":false,"pangu":false,"comments":{"style":"tabs","active":null,"storage":true,"lazyload":false,"nav":null},"stickytabs":false,"motion":{"enable":true,"async":false,"transition":{"menu_item":"fadeInDown","post_block":"fadeIn","post_header":"fadeInDown","post_body":"fadeInDown","coll_header":"fadeInLeft","sidebar":"fadeInUp"}},"prism":false,"i18n":{"placeholder":"搜索...","empty":"没有找到任何搜索结果：${query}","hits_time":"找到 ${hits} 个搜索结果（用时 ${time} 毫秒）","hits":"找到 ${hits} 个搜索结果"}}</script><script src="/js/config.js"></script>
+
+    <meta name="description" content="并查集DisjointSet并查集中每个强连通分量视为一个集合，强连通分量中任意两点均可达 并查集的两个基本操作  Find：查找元素所属集合 Union：合并两个子集为一个新的集合  1234567891011121314151617181920212223242526272829303132class Disjointset&amp;#123;	private: 		vector&lt;int&gt;">
+<meta property="og:type" content="article">
+<meta property="og:title" content="template">
+<meta property="og:url" content="https://kevin346-sc.github.io/2023/11/19/template/index.html">
+<meta property="og:site_name" content="Serein’s Blog">
+<meta property="og:description" content="并查集DisjointSet并查集中每个强连通分量视为一个集合，强连通分量中任意两点均可达 并查集的两个基本操作  Find：查找元素所属集合 Union：合并两个子集为一个新的集合  1234567891011121314151617181920212223242526272829303132class Disjointset&amp;#123;	private: 		vector&lt;int&gt;">
+<meta property="og:locale" content="zh_CN">
+<meta property="article:published_time" content="2023-11-19T05:25:02.000Z">
+<meta property="article:modified_time" content="2023-11-27T06:57:33.594Z">
+<meta property="article:author" content="Kevin Huang">
+<meta name="twitter:card" content="summary">
+
+
+<link rel="canonical" href="https://kevin346-sc.github.io/2023/11/19/template/">
+
+
+
+<script class="next-config" data-name="page" type="application/json">{"sidebar":"","isHome":false,"isPost":true,"lang":"zh-CN","comments":true,"permalink":"https://kevin346-sc.github.io/2023/11/19/template/","path":"2023/11/19/template/","title":"template"}</script>
+
+<script class="next-config" data-name="calendar" type="application/json">""</script>
+<title>template | Serein’s Blog</title>
+  
+
+
+
+
+
+
+
+
+  <noscript>
+    <link rel="stylesheet" href="/css/noscript.css">
+  </noscript>
+</head>
+
+<body itemscope itemtype="http://schema.org/WebPage" class="use-motion">
+  <div class="headband"></div>
+
+  <main class="main">
+    <div class="column">
+      <header class="header" itemscope itemtype="http://schema.org/WPHeader"><div class="site-brand-container">
+  <div class="site-nav-toggle">
+    <div class="toggle" aria-label="切换导航栏" role="button">
+    </div>
+  </div>
+
+  <div class="site-meta">
+
+    <a href="/" class="brand" rel="start">
+      <i class="logo-line"></i>
+      <p class="site-title">Serein’s Blog</p>
+      <i class="logo-line"></i>
+    </a>
+  </div>
+
+  <div class="site-nav-right">
+    <div class="toggle popup-trigger" aria-label="搜索" role="button">
+    </div>
+  </div>
+</div>
+
+
+
+
+
+
+
+</header>
+        
+  
+  <aside class="sidebar">
+
+    <div class="sidebar-inner sidebar-nav-active sidebar-toc-active">
+      <ul class="sidebar-nav">
+        <li class="sidebar-nav-toc">
+          文章目录
+        </li>
+        <li class="sidebar-nav-overview">
+          站点概览
+        </li>
+      </ul>
+
+      <div class="sidebar-panel-container">
+        <!--noindex-->
+        <div class="post-toc-wrap sidebar-panel">
+            <div class="post-toc animated"><ol class="nav"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%B9%B6%E6%9F%A5%E9%9B%86DisjointSet"><span class="nav-number">1.</span> <span class="nav-text">并查集DisjointSet</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#2316-%E7%BB%9F%E8%AE%A1%E6%97%A0%E5%90%91%E5%9B%BE%E4%B8%AD%E6%97%A0%E6%B3%95%E4%BA%92%E7%9B%B8%E5%88%B0%E8%BE%BE%E7%82%B9%E5%AF%B9%E6%95%B0"><span class="nav-number">1.1.</span> <span class="nav-text">2316. 统计无向图中无法互相到达点对数</span></a></li></ol></li><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%AD%97%E5%85%B8%E6%A0%91-Trie"><span class="nav-number">2.</span> <span class="nav-text">字典树 Trie</span></a></li></ol></div>
+        </div>
+        <!--/noindex-->
+
+        <div class="site-overview-wrap sidebar-panel">
+          <div class="site-author animated" itemprop="author" itemscope itemtype="http://schema.org/Person">
+  <p class="site-author-name" itemprop="name">Kevin Huang</p>
+  <div class="site-description" itemprop="description">c++</div>
+</div>
+<div class="site-state-wrap animated">
+  <nav class="site-state">
+      <div class="site-state-item site-state-posts">
+        <a href="/archives/">
+          <span class="site-state-item-count">19</span>
+          <span class="site-state-item-name">日志</span>
+        </a>
+      </div>
+      <div class="site-state-item site-state-tags">
+        <span class="site-state-item-count">2</span>
+        <span class="site-state-item-name">标签</span>
+      </div>
+  </nav>
+</div>
+
+        </div>
+      </div>
+    </div>
+
+    
+  </aside>
+
+
+    </div>
+
+    <div class="main-inner post posts-expand">
+
+
+  
+
+
+<div class="post-block">
+  
+  
+
+  <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="zh-CN">
+    <link itemprop="mainEntityOfPage" href="https://kevin346-sc.github.io/2023/11/19/template/">
+
+    <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
+      <meta itemprop="image" content="/images/avatar.gif">
+      <meta itemprop="name" content="Kevin Huang">
+    </span>
+
+    <span hidden itemprop="publisher" itemscope itemtype="http://schema.org/Organization">
+      <meta itemprop="name" content="Serein’s Blog">
+      <meta itemprop="description" content="c++">
+    </span>
+
+    <span hidden itemprop="post" itemscope itemtype="http://schema.org/CreativeWork">
+      <meta itemprop="name" content="template | Serein’s Blog">
+      <meta itemprop="description" content="">
+    </span>
+      <header class="post-header">
+        <h1 class="post-title" itemprop="name headline">
+          template
+        </h1>
+
+        <div class="post-meta-container">
+          <div class="post-meta">
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar"></i>
+      </span>
+      <span class="post-meta-item-text">发表于</span>
+
+      <time title="创建时间：2023-11-19 13:25:02" itemprop="dateCreated datePublished" datetime="2023-11-19T13:25:02+08:00">2023-11-19</time>
+    </span>
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar-check"></i>
+      </span>
+      <span class="post-meta-item-text">更新于</span>
+      <time title="修改时间：2023-11-27 14:57:33" itemprop="dateModified" datetime="2023-11-27T14:57:33+08:00">2023-11-27</time>
+    </span>
+
+  
+</div>
+
+        </div>
+      </header>
+
+    
+    
+    
+    <div class="post-body" itemprop="articleBody">
+        <h2 id="并查集DisjointSet"><a href="#并查集DisjointSet" class="headerlink" title="并查集DisjointSet"></a>并查集DisjointSet</h2><p>并查集中每个强连通分量视为一个集合，强连通分量中任意两点均可达</p>
+<p>并查集的两个基本操作</p>
+<ul>
+<li>Find：查找元素所属集合</li>
+<li>Union：合并两个子集为一个新的集合</li>
+</ul>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br></pre></td><td class="code"><pre><span class="line">class Disjointset&#123;</span><br><span class="line">	private: </span><br><span class="line">		vector&lt;int&gt; fa;</span><br><span class="line">    	Disjointset(int max_size): fa(vector&lt;int&gt;(max_size))</span><br><span class="line">        &#123;</span><br><span class="line">            // 初始化fa数组</span><br><span class="line">            iota(fa.begin(), fa.end(), 0);</span><br><span class="line">        &#125;</span><br><span class="line">	public:</span><br><span class="line">        int Find(int x)</span><br><span class="line">        &#123;</span><br><span class="line">            if(fa[x] == x) // 自己就是根结点</span><br><span class="line">                return x;</span><br><span class="line">            else //继续查找父结点，直到根结点</span><br><span class="line">            &#123;</span><br><span class="line">                int parent = Find(fa[x]);</span><br><span class="line">                return parent;</span><br><span class="line">            &#125;</span><br><span class="line">            // 三目运算符写法</span><br><span class="line">            // return fa[x] == x ? x : Find(fa[x]);</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        void Union(int a, int b)</span><br><span class="line">        &#123;</span><br><span class="line">            int pa_a = Find(a);</span><br><span class="line">            int pa_b = Find(b);</span><br><span class="line">            if(pa_a == pa_b) // 同属一个集合中，无需合并</span><br><span class="line">                return;</span><br><span class="line">            fa[pa_a] = pa_b;</span><br><span class="line">            // 也可以无需判断，直接写成 fa[pa_a] = pa_b;</span><br><span class="line">        &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<p>这样子，在树高较高的情况下（链表），find的复杂度可以达到O(n)，可以通过秩或者路径压缩的方法来减小复杂度</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br></pre></td><td class="code"><pre><span class="line">// 秩，代表树的高度</span><br><span class="line">// 当秩为a 与 秩为b 的两个子集合并时，将秩较小的合并到秩较大的集合上；若相等，则任意合并，秩+1</span><br><span class="line">class Disjointset&#123;</span><br><span class="line">	private: </span><br><span class="line">		vector&lt;int&gt; fa;</span><br><span class="line">		vector&lt;int&gt; rank; // 秩</span><br><span class="line">    	Disjointset(int max_size): fa(vector&lt;int&gt;(max_size), rank(vector&lt;int&gt;(max_size, 0)))</span><br><span class="line">        &#123;</span><br><span class="line">            // 初始化fa数组</span><br><span class="line">            iota(fa.begin(), fa.end(), 0);</span><br><span class="line">        &#125;</span><br><span class="line">	public:</span><br><span class="line">        int Find(int x)</span><br><span class="line">        &#123;</span><br><span class="line">            if(fa[x] == x) // 自己就是根结点</span><br><span class="line">                return x;</span><br><span class="line">            else //继续查找父结点，直到根结点</span><br><span class="line">            &#123;</span><br><span class="line">                int parent = Find(fa[x]);</span><br><span class="line">                return parent;</span><br><span class="line">            &#125;</span><br><span class="line">            // 三目运算符写法</span><br><span class="line">            // return fa[x] == x ? x : Find(fa[x]);</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        void Union(int a, int b)</span><br><span class="line">        &#123;</span><br><span class="line">            int pa_a = Find(a);</span><br><span class="line">            int pa_b = Find(b);</span><br><span class="line">            if(rank[pa_a] &gt; rank[pa_b])</span><br><span class="line">            &#123;</span><br><span class="line">            	fa[pa_b] = pa_a;</span><br><span class="line">            &#125;</span><br><span class="line">            else</span><br><span class="line">            &#123;</span><br><span class="line">            	fa[pa_a] = pa_b;</span><br><span class="line">            	if(rank[pa_a] == rank[pa_b])</span><br><span class="line">            		rank[pa_b]++;</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line">&#125;;</span><br><span class="line"></span><br><span class="line"></span><br><span class="line">// 路径压缩</span><br><span class="line">class Disjointset&#123;</span><br><span class="line">	private: </span><br><span class="line">		vector&lt;int&gt; fa;</span><br><span class="line">    	Disjointset(int max_size): fa(vector&lt;int&gt;(max_size))</span><br><span class="line">        &#123;</span><br><span class="line">            // 初始化fa数组</span><br><span class="line">            iota(fa.begin(), fa.end(), 0);</span><br><span class="line">        &#125;</span><br><span class="line">	public:</span><br><span class="line">        int Find(int x)</span><br><span class="line">        &#123;</span><br><span class="line">            // 三目运算符写法</span><br><span class="line">            // return fa[x] == x ? x : Find(fa[x]);</span><br><span class="line">            // 在向上查找根结点时，每个孙子结点都变为子结点，减小树高</span><br><span class="line">            return fa[x] == x ? x : fa[x] = Find(fa[x]);</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        void Union(int a, int b)</span><br><span class="line">        &#123;</span><br><span class="line">            int pa_a = Find(a);</span><br><span class="line">            int pa_b = Find(b);</span><br><span class="line">            if(pa_a == pa_b) // 同属一个集合中，无需合并</span><br><span class="line">                return;</span><br><span class="line">            fa[pa_a] = pa_b;</span><br><span class="line">            // 也可以无需判断，直接写成 fa[pa_a] = pa_b;</span><br><span class="line">        &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<p>时间复杂度：<code>O(n+m×α(m))</code>，其中 n 是图中的顶点数，m 是图中边的数目，α 是反阿克曼函数，在n非常大的时候，α(n) &lt; 5。并查集的初始化需要 O(n)的时间，然后遍历 m 条边并执行 m 次合并操作，最后对 source 和 destination 执行一次查询操作，查询与合并的单次操作时间复杂度是 <code>O(α(m))</code>，因此合并与查询的时间复杂度是 <code>O(m×α(m))</code>，总时间复杂度是 <code>O(n+m×α(m))</code></p>
+<h3 id="2316-统计无向图中无法互相到达点对数"><a href="#2316-统计无向图中无法互相到达点对数" class="headerlink" title="2316. 统计无向图中无法互相到达点对数"></a><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph/">2316. 统计无向图中无法互相到达点对数</a></h3><p>附加数组信息，保存节点数信息</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br></pre></td><td class="code"><pre><span class="line">class Disjointset&#123;</span><br><span class="line">    private:</span><br><span class="line">        vector&lt;int&gt; fa;</span><br><span class="line">        vector&lt;int&gt; rank;</span><br><span class="line">    public:</span><br><span class="line">        Disjointset(int n): fa(vector&lt;int&gt;(n)), rank(n, 1)</span><br><span class="line">        &#123;</span><br><span class="line">            iota(fa.begin(), fa.end(), 0);</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        int find(int x)</span><br><span class="line">        &#123;</span><br><span class="line">            if(x == fa[x])</span><br><span class="line">                return x;</span><br><span class="line">            else</span><br><span class="line">            &#123;</span><br><span class="line">                fa[x] = find(fa[x]);</span><br><span class="line">                return fa[x];</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        void Union(int x, int y)</span><br><span class="line">        &#123;</span><br><span class="line">            int pa_a = find(x);</span><br><span class="line">            int pa_b = find(y);</span><br><span class="line"></span><br><span class="line">            if(pa_a == pa_b)</span><br><span class="line">                return;</span><br><span class="line">            if(rank[pa_a] &gt; rank[pa_b])</span><br><span class="line">            &#123;</span><br><span class="line">                fa[pa_b] = pa_a;</span><br><span class="line">                rank[pa_a] += rank[pa_b];</span><br><span class="line">            &#125;</span><br><span class="line">            else</span><br><span class="line">            &#123;</span><br><span class="line">                fa[pa_a] = pa_b;</span><br><span class="line">                rank[pa_b] += rank[pa_a];</span><br><span class="line">            &#125;   </span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        int get(int x)</span><br><span class="line">        &#123;</span><br><span class="line">            return rank[x];</span><br><span class="line">        &#125;</span><br><span class="line">&#125;;</span><br><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    long long countPairs(int n, vector&lt;vector&lt;int&gt;&gt;&amp; edges) &#123;</span><br><span class="line">        Disjointset disjointset(n);</span><br><span class="line">        for(const auto &amp; edge : edges)</span><br><span class="line">        &#123;</span><br><span class="line">            disjointset.Union(edge[0], edge[1]);</span><br><span class="line">        &#125;</span><br><span class="line">        long long res = 0;</span><br><span class="line">        for(int i = 0; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            res += n - disjointset.get(disjointset.find(i));</span><br><span class="line">        &#125;</span><br><span class="line">        return res / 2;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h2 id="字典树-Trie"><a href="#字典树-Trie" class="headerlink" title="字典树 Trie"></a>字典树 Trie</h2>
+    </div>
+
+    
+    
+    
+
+    <footer class="post-footer">
+
+        
+
+          <div class="post-nav">
+            <div class="post-nav-item">
+                <a href="/2023/09/26/cs144/" rel="prev" title="cs144">
+                  <i class="fa fa-chevron-left"></i> cs144
+                </a>
+            </div>
+            <div class="post-nav-item">
+                <a href="/2024/08/17/git%E6%93%8D%E4%BD%9C/" rel="next" title="git操作">
+                  git操作 <i class="fa fa-chevron-right"></i>
+                </a>
+            </div>
+          </div>
+    </footer>
+  </article>
+</div>
+
+
+
+
+
+
+</div>
+  </main>
+
+  <footer class="footer">
+    <div class="footer-inner">
+
+
+<div class="copyright">
+  &copy; 
+  <span itemprop="copyrightYear">2024</span>
+  <span class="with-love">
+    <i class="fa fa-heart"></i>
+  </span>
+  <span class="author" itemprop="copyrightHolder">Kevin Huang</span>
+</div>
+  <div class="powered-by">由 <a href="https://hexo.io/" rel="noopener" target="_blank">Hexo</a> & <a href="https://theme-next.js.org/muse/" rel="noopener" target="_blank">NexT.Muse</a> 强力驱动
+  </div>
+
+    </div>
+  </footer>
+
+  
+  <div class="toggle sidebar-toggle" role="button">
+    <span class="toggle-line"></span>
+    <span class="toggle-line"></span>
+    <span class="toggle-line"></span>
+  </div>
+  <div class="sidebar-dimmer"></div>
+  <div class="back-to-top" role="button" aria-label="返回顶部">
+    <i class="fa fa-arrow-up fa-lg"></i>
+    <span>0%</span>
+  </div>
+
+<noscript>
+  <div class="noscript-warning">Theme NexT works best with JavaScript enabled</div>
+</noscript>
+
+
+  
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/animejs/3.2.1/anime.min.js" integrity="sha256-XL2inqUJaslATFnHdJOi9GfQ60on8Wx1C2H8DYiN1xY=" crossorigin="anonymous"></script>
+<script src="/js/comments.js"></script><script src="/js/utils.js"></script><script src="/js/motion.js"></script><script src="/js/schemes/muse.js"></script><script src="/js/next-boot.js"></script>
+
+  
+
+
+
+
+  
+
+
+
+
+
+</body>
+</html>
diff --git "a/2024/08/17/git\346\223\215\344\275\234/index.html" "b/2024/08/17/git\346\223\215\344\275\234/index.html"
new file mode 100644
index 0000000..6e520f5
--- /dev/null
+++ "b/2024/08/17/git\346\223\215\344\275\234/index.html"
@@ -0,0 +1,341 @@
+<!DOCTYPE html>
+<html lang="zh-CN">
+<head>
+  <meta charset="UTF-8">
+<meta name="viewport" content="width=device-width">
+<meta name="theme-color" content="#222"><meta name="generator" content="Hexo 6.3.0">
+
+  <link rel="apple-touch-icon" sizes="180x180" href="/images/apple-touch-icon-next.png">
+  <link rel="icon" type="image/png" sizes="32x32" href="/images/favicon-32x32-next.png">
+  <link rel="icon" type="image/png" sizes="16x16" href="/images/favicon-16x16-next.png">
+  <link rel="mask-icon" href="/images/logo.svg" color="#222">
+
+<link rel="stylesheet" href="/css/main.css">
+
+
+
+<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/6.4.0/css/all.min.css" integrity="sha256-HtsXJanqjKTc8vVQjO4YMhiqFoXkfBsjBWcX91T1jr8=" crossorigin="anonymous">
+  <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.1.1/animate.min.css" integrity="sha256-PR7ttpcvz8qrF57fur/yAx1qXMFJeJFiA6pSzWi0OIE=" crossorigin="anonymous">
+
+<script class="next-config" data-name="main" type="application/json">{"hostname":"kevin346-sc.github.io","root":"/","images":"/images","scheme":"Muse","darkmode":false,"version":"8.15.1","exturl":false,"sidebar":{"position":"left","display":"post","padding":18,"offset":12},"copycode":{"enable":false,"style":null},"bookmark":{"enable":false,"color":"#222","save":"auto"},"mediumzoom":false,"lazyload":false,"pangu":false,"comments":{"style":"tabs","active":null,"storage":true,"lazyload":false,"nav":null},"stickytabs":false,"motion":{"enable":true,"async":false,"transition":{"menu_item":"fadeInDown","post_block":"fadeIn","post_header":"fadeInDown","post_body":"fadeInDown","coll_header":"fadeInLeft","sidebar":"fadeInUp"}},"prism":false,"i18n":{"placeholder":"搜索...","empty":"没有找到任何搜索结果：${query}","hits_time":"找到 ${hits} 个搜索结果（用时 ${time} 毫秒）","hits":"找到 ${hits} 个搜索结果"}}</script><script src="/js/config.js"></script>
+
+    <meta name="description" content="假设远程仓库中有main分支，其中有Init的commit  首先克隆同步到本地仓库，git clone https:&#x2F;&#x2F;github.com&#x2F;xx&#x2F;xx.git  为了不扰乱main分支，应该在本地仓库中创建新的分支git checkout -b my-feature  后续在此分支上进行自己的代码修改，修改完成后，使用git diff查看修改的代码，然后可git add . 添加修改到暂存区（">
+<meta property="og:type" content="article">
+<meta property="og:title" content="git操作">
+<meta property="og:url" content="https://kevin346-sc.github.io/2024/08/17/git%E6%93%8D%E4%BD%9C/index.html">
+<meta property="og:site_name" content="Serein’s Blog">
+<meta property="og:description" content="假设远程仓库中有main分支，其中有Init的commit  首先克隆同步到本地仓库，git clone https:&#x2F;&#x2F;github.com&#x2F;xx&#x2F;xx.git  为了不扰乱main分支，应该在本地仓库中创建新的分支git checkout -b my-feature  后续在此分支上进行自己的代码修改，修改完成后，使用git diff查看修改的代码，然后可git add . 添加修改到暂存区（">
+<meta property="og:locale" content="zh_CN">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817191625062.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817191750339.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817191914518.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817192347300.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817192627062.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817193511042.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817193714442.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817193839660.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817194108191.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817194340700.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817194658402.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195333798.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195619809.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195653564.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195853788.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195922651.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817200437211.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817200933821.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817201119527.png">
+<meta property="og:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817201336433.png">
+<meta property="article:published_time" content="2024-08-17T12:44:01.000Z">
+<meta property="article:modified_time" content="2024-08-17T15:48:25.262Z">
+<meta property="article:author" content="Kevin Huang">
+<meta name="twitter:card" content="summary">
+<meta name="twitter:image" content="c:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817191625062.png">
+
+
+<link rel="canonical" href="https://kevin346-sc.github.io/2024/08/17/git%E6%93%8D%E4%BD%9C/">
+
+
+
+<script class="next-config" data-name="page" type="application/json">{"sidebar":"","isHome":false,"isPost":true,"lang":"zh-CN","comments":true,"permalink":"https://kevin346-sc.github.io/2024/08/17/git%E6%93%8D%E4%BD%9C/","path":"2024/08/17/git操作/","title":"git操作"}</script>
+
+<script class="next-config" data-name="calendar" type="application/json">""</script>
+<title>git操作 | Serein’s Blog</title>
+  
+
+
+
+
+
+
+
+
+  <noscript>
+    <link rel="stylesheet" href="/css/noscript.css">
+  </noscript>
+</head>
+
+<body itemscope itemtype="http://schema.org/WebPage" class="use-motion">
+  <div class="headband"></div>
+
+  <main class="main">
+    <div class="column">
+      <header class="header" itemscope itemtype="http://schema.org/WPHeader"><div class="site-brand-container">
+  <div class="site-nav-toggle">
+    <div class="toggle" aria-label="切换导航栏" role="button">
+    </div>
+  </div>
+
+  <div class="site-meta">
+
+    <a href="/" class="brand" rel="start">
+      <i class="logo-line"></i>
+      <p class="site-title">Serein’s Blog</p>
+      <i class="logo-line"></i>
+    </a>
+  </div>
+
+  <div class="site-nav-right">
+    <div class="toggle popup-trigger" aria-label="搜索" role="button">
+    </div>
+  </div>
+</div>
+
+
+
+
+
+
+
+</header>
+        
+  
+  <aside class="sidebar">
+
+    <div class="sidebar-inner sidebar-overview-active">
+      <ul class="sidebar-nav">
+        <li class="sidebar-nav-toc">
+          文章目录
+        </li>
+        <li class="sidebar-nav-overview">
+          站点概览
+        </li>
+      </ul>
+
+      <div class="sidebar-panel-container">
+        <!--noindex-->
+        <div class="post-toc-wrap sidebar-panel">
+        </div>
+        <!--/noindex-->
+
+        <div class="site-overview-wrap sidebar-panel">
+          <div class="site-author animated" itemprop="author" itemscope itemtype="http://schema.org/Person">
+  <p class="site-author-name" itemprop="name">Kevin Huang</p>
+  <div class="site-description" itemprop="description">c++</div>
+</div>
+<div class="site-state-wrap animated">
+  <nav class="site-state">
+      <div class="site-state-item site-state-posts">
+        <a href="/archives/">
+          <span class="site-state-item-count">19</span>
+          <span class="site-state-item-name">日志</span>
+        </a>
+      </div>
+      <div class="site-state-item site-state-tags">
+        <span class="site-state-item-count">2</span>
+        <span class="site-state-item-name">标签</span>
+      </div>
+  </nav>
+</div>
+
+        </div>
+      </div>
+    </div>
+
+    
+  </aside>
+
+
+    </div>
+
+    <div class="main-inner post posts-expand">
+
+
+  
+
+
+<div class="post-block">
+  
+  
+
+  <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="zh-CN">
+    <link itemprop="mainEntityOfPage" href="https://kevin346-sc.github.io/2024/08/17/git%E6%93%8D%E4%BD%9C/">
+
+    <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
+      <meta itemprop="image" content="/images/avatar.gif">
+      <meta itemprop="name" content="Kevin Huang">
+    </span>
+
+    <span hidden itemprop="publisher" itemscope itemtype="http://schema.org/Organization">
+      <meta itemprop="name" content="Serein’s Blog">
+      <meta itemprop="description" content="c++">
+    </span>
+
+    <span hidden itemprop="post" itemscope itemtype="http://schema.org/CreativeWork">
+      <meta itemprop="name" content="git操作 | Serein’s Blog">
+      <meta itemprop="description" content="">
+    </span>
+      <header class="post-header">
+        <h1 class="post-title" itemprop="name headline">
+          git操作
+        </h1>
+
+        <div class="post-meta-container">
+          <div class="post-meta">
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar"></i>
+      </span>
+      <span class="post-meta-item-text">发表于</span>
+      
+
+      <time title="创建时间：2024-08-17 20:44:01 / 修改时间：23:48:25" itemprop="dateCreated datePublished" datetime="2024-08-17T20:44:01+08:00">2024-08-17</time>
+    </span>
+
+  
+</div>
+
+        </div>
+      </header>
+
+    
+    
+    
+    <div class="post-body" itemprop="articleBody">
+        <p>假设远程仓库中有main分支，其中有Init的commit</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817191625062.png" alt="image-20240817191625062"></p>
+<p>首先克隆同步到本地仓库，<code>git clone https://github.com/xx/xx.git</code></p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817191750339.png" alt="image-20240817191750339"></p>
+<p>为了不扰乱main分支，应该在本地仓库中创建新的分支<code>git checkout -b my-feature</code></p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817191914518.png" alt="image-20240817191914518"></p>
+<p>后续在此分支上进行自己的代码修改，修改完成后，使用<code>git diff</code>查看修改的代码，然后可<code>git add .</code> 添加修改到暂存区（staging）并告知本地git，<code>git commit -m &quot;f-commit&quot;</code>提交commit给local git</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817192347300.png" alt="image-20240817192347300"></p>
+<p><code>git push -u origin my-feature</code>同步到远程仓库，此时远程仓库中也会新增<code>my-feature</code>分支</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817192627062.png" alt="image-20240817192627062"></p>
+<p>如果此时远程仓库的代码有更新，则需要先拉取远程仓库main到本地的main，先切换到main分支<code>git checkout main</code>，<u>值得注意的是，这时候disk中的代码是Init状态的代码，并非在<code>f-commit</code>下的代码</u></p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817193511042.png" alt="image-20240817193511042"></p>
+<p>这时候使用pull拉取<code>git pull origin main</code>，这时本地仓库与远程仓库状态一样，都有两个分支，切换回my-feature分支，为了在此分支上同步main分支代码更新，使用<code>git rebase main</code>，先让main的最新修改与当前分支同步，在这个基础上尝试添加该分支之前的commit(即<code>f-commit</code>)，如果有<code>rebase conflict</code>，需要手动选择保留哪个修改，这时候my-feature分支上会在f-commit前插入与远程分支一样的update commit</p>
+<p> <img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817193714442.png" alt="image-20240817193714442"></p>
+<p>再将本地同步到远程，<code>git push -f origin my-feature</code>，push需要加-f表示强制push，因为此时远程仓库的my-feature分支同样也有Init，update和f-commit三个commit</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817193839660.png" alt="image-20240817193839660"></p>
+<p>将my-feature分支合并到main分支中<code>pull request</code></p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817194108191.png" alt="image-20240817194108191"></p>
+<p>使用<code>squash and merge</code>，将一个分支上的所有改变合并成一个commit，合并完成后删除远程的my-feature分支，同样在本地仓库上<code>git checkout main</code> 切换到main分支再<code>git branch -D my-feature</code>删除my-feature，最后在main分支上<code>git pull origin main</code>同步远程仓库的更新，如此反复</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817194340700.png" alt="image-20240817194340700"></p>
+<p>以上内容来源于<a target="_blank" rel="noopener" href="https://www.youtube.com/watch?v=uj8hjLyEBmU">https://www.youtube.com/watch?v=uj8hjLyEBmU</a></p>
+<p>关于撤销</p>
+<p>假设初始状态下四个区域一致，disk是硬盘，staging暂存区，local本地仓库以及远端仓库remote</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817194658402.png" alt="image-20240817194658402"></p>
+<p>如果发生修改change，但并未进行<code>git add</code>等操作，也就是说只在硬盘上修改，如果想要撤销，可以使用<code>git checkout &lt;changed_file&gt;</code> 或者<code>git restore &lt;changed_file&gt;</code>直接回退到Init状态，也就是上一次commit这个文件的状态，新版本的git更推荐使用restore</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195333798.png" alt="image-20240817195333798"></p>
+<p>在git add 后，也就是修改被同步到暂存区”git status -&gt; Changes to be commited”，如果想要撤销在暂存区的修改而保留硬盘上的修改，也就是取消git add的效果，就可以使用<code>git reset &lt;changed_file&gt;</code>或者<code>git restore --staged &lt;changed_file&gt;</code></p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195619809.png" alt="image-20240817195619809"></p>
+<p>如果想要连同硬盘上的修改也撤销，可以使用<code>git checkout HEAD &lt;changed_file&gt;</code>表示将文件撤销到最近一次commit的状态（HEAD）</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195653564.png" alt="image-20240817195653564"></p>
+<p>在git commit后，修改被提交到了本地git中，如果仅撤销本地git的修改，即取消git commit的效果，则可以使用<code>git reset --soft HEAD~1</code>，因为HEAD表示最近的一次commit，所以这里使用<code>HEAD~1</code>来表示想要回退到的Init状态</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195853788.png" alt="image-20240817195853788"></p>
+<p>进一步，如果想要取消连同取消git commit 和 git add 的效果，只保留在硬盘上的修改，那么可以使用<code>git reset HEAD~1</code>进行实现，也可以使用<code>git reset --mixed HEAD~1</code></p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195922651.png" alt="image-20240817195922651"></p>
+<p>要是连硬盘上的修改也撤销，就可以使用<code>git reset --hard HEAD~1</code></p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817200437211.png" alt="image-20240817200437211"></p>
+<p>另一种撤销git revert，本质上是通过添加一个新的commit，使得看起来将change删除了，<code>git revert HEAD</code>这里的HEAD就是指commit过的change</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817200933821.png" alt="image-20240817200933821"></p>
+<p>使用revert的好处有1. 可以撤销中间提交的任意一个commit </p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817201119527.png" alt="image-20240817201119527"></p>
+<p>2.当修改push到远端remote仓库后，想要撤销公有分支上的修改，那么就只能使用revert，然后再push到远端仓库，从结果上撤销这个修改，否则会令使用这个公有分支的开发者混乱；也有可能这个分支是私有分支，就可以使用<code>git reset --hard HEAD~1</code>并推送到远端<code>git push -f</code>，-f 就是让remote强行接受这个分支变化，但不能用在共有分支上</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817201336433.png" alt="image-20240817201336433"></p>
+<p>以上内容来源于<a target="_blank" rel="noopener" href="https://www.youtube.com/watch?v=ol7CMoJuAvI&t=17s">https://www.youtube.com/watch?v=ol7CMoJuAvI&amp;t=17s</a></p>
+
+    </div>
+
+    
+    
+    
+
+    <footer class="post-footer">
+
+        
+
+          <div class="post-nav">
+            <div class="post-nav-item">
+                <a href="/2023/11/19/template/" rel="prev" title="template">
+                  <i class="fa fa-chevron-left"></i> template
+                </a>
+            </div>
+            <div class="post-nav-item">
+            </div>
+          </div>
+    </footer>
+  </article>
+</div>
+
+
+
+
+
+
+</div>
+  </main>
+
+  <footer class="footer">
+    <div class="footer-inner">
+
+
+<div class="copyright">
+  &copy; 
+  <span itemprop="copyrightYear">2024</span>
+  <span class="with-love">
+    <i class="fa fa-heart"></i>
+  </span>
+  <span class="author" itemprop="copyrightHolder">Kevin Huang</span>
+</div>
+  <div class="powered-by">由 <a href="https://hexo.io/" rel="noopener" target="_blank">Hexo</a> & <a href="https://theme-next.js.org/muse/" rel="noopener" target="_blank">NexT.Muse</a> 强力驱动
+  </div>
+
+    </div>
+  </footer>
+
+  
+  <div class="toggle sidebar-toggle" role="button">
+    <span class="toggle-line"></span>
+    <span class="toggle-line"></span>
+    <span class="toggle-line"></span>
+  </div>
+  <div class="sidebar-dimmer"></div>
+  <div class="back-to-top" role="button" aria-label="返回顶部">
+    <i class="fa fa-arrow-up fa-lg"></i>
+    <span>0%</span>
+  </div>
+
+<noscript>
+  <div class="noscript-warning">Theme NexT works best with JavaScript enabled</div>
+</noscript>
+
+
+  
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/animejs/3.2.1/anime.min.js" integrity="sha256-XL2inqUJaslATFnHdJOi9GfQ60on8Wx1C2H8DYiN1xY=" crossorigin="anonymous"></script>
+<script src="/js/comments.js"></script><script src="/js/utils.js"></script><script src="/js/motion.js"></script><script src="/js/schemes/muse.js"></script><script src="/js/next-boot.js"></script>
+
+  
+
+
+
+
+  
+
+
+
+
+
+</body>
+</html>
diff --git a/archives/2022/10/index.html b/archives/2022/10/index.html
index 68af160..6363f68 100644
--- a/archives/2022/10/index.html
+++ b/archives/2022/10/index.html
@@ -114,7 +114,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -144,7 +144,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <div class="post-block">
     <div class="post-content">
       <div class="collection-title">
-        <span class="collection-header">嗯..! 目前共计 17 篇日志。 继续努力。</span>
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
       </div>
 
       
@@ -228,7 +228,7 @@ <h1 class="site-title">Serein’s Blog</h1>
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/archives/2022/11/index.html b/archives/2022/11/index.html
index 25a20f4..0f63213 100644
--- a/archives/2022/11/index.html
+++ b/archives/2022/11/index.html
@@ -114,7 +114,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -144,7 +144,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <div class="post-block">
     <div class="post-content">
       <div class="collection-title">
-        <span class="collection-header">嗯..! 目前共计 17 篇日志。 继续努力。</span>
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
       </div>
 
       
@@ -228,7 +228,7 @@ <h1 class="site-title">Serein’s Blog</h1>
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/archives/2022/12/index.html b/archives/2022/12/index.html
index 3d3f052..ac30f20 100644
--- a/archives/2022/12/index.html
+++ b/archives/2022/12/index.html
@@ -114,7 +114,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -144,7 +144,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <div class="post-block">
     <div class="post-content">
       <div class="collection-title">
-        <span class="collection-header">嗯..! 目前共计 17 篇日志。 继续努力。</span>
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
       </div>
 
       
@@ -188,7 +188,7 @@ <h1 class="site-title">Serein’s Blog</h1>
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/archives/2022/index.html b/archives/2022/index.html
index 0d4de39..e9f942f 100644
--- a/archives/2022/index.html
+++ b/archives/2022/index.html
@@ -114,7 +114,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -144,7 +144,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <div class="post-block">
     <div class="post-content">
       <div class="collection-title">
-        <span class="collection-header">嗯..! 目前共计 17 篇日志。 继续努力。</span>
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
       </div>
 
       
@@ -308,7 +308,7 @@ <h1 class="site-title">Serein’s Blog</h1>
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/archives/2023/03/index.html b/archives/2023/03/index.html
index 4e776c7..52d6d4b 100644
--- a/archives/2023/03/index.html
+++ b/archives/2023/03/index.html
@@ -114,7 +114,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -144,7 +144,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <div class="post-block">
     <div class="post-content">
       <div class="collection-title">
-        <span class="collection-header">嗯..! 目前共计 17 篇日志。 继续努力。</span>
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
       </div>
 
       
@@ -228,7 +228,7 @@ <h1 class="site-title">Serein’s Blog</h1>
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/archives/2023/04/index.html b/archives/2023/04/index.html
index 11edbc2..a7b794a 100644
--- a/archives/2023/04/index.html
+++ b/archives/2023/04/index.html
@@ -114,7 +114,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -144,7 +144,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <div class="post-block">
     <div class="post-content">
       <div class="collection-title">
-        <span class="collection-header">嗯..! 目前共计 17 篇日志。 继续努力。</span>
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
       </div>
 
       
@@ -268,7 +268,7 @@ <h1 class="site-title">Serein’s Blog</h1>
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/archives/2023/05/index.html b/archives/2023/05/index.html
index f8fc6fc..36559d9 100644
--- a/archives/2023/05/index.html
+++ b/archives/2023/05/index.html
@@ -114,7 +114,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -144,7 +144,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <div class="post-block">
     <div class="post-content">
       <div class="collection-title">
-        <span class="collection-header">嗯..! 目前共计 17 篇日志。 继续努力。</span>
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
       </div>
 
       
@@ -188,7 +188,7 @@ <h1 class="site-title">Serein’s Blog</h1>
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/archives/2023/09/index.html b/archives/2023/09/index.html
index fe47d47..c3a3bc1 100644
--- a/archives/2023/09/index.html
+++ b/archives/2023/09/index.html
@@ -114,7 +114,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -144,7 +144,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <div class="post-block">
     <div class="post-content">
       <div class="collection-title">
-        <span class="collection-header">嗯..! 目前共计 17 篇日志。 继续努力。</span>
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
       </div>
 
       
@@ -188,7 +188,7 @@ <h1 class="site-title">Serein’s Blog</h1>
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/archives/2023/11/index.html b/archives/2023/11/index.html
new file mode 100644
index 0000000..ad70690
--- /dev/null
+++ b/archives/2023/11/index.html
@@ -0,0 +1,236 @@
+<!DOCTYPE html>
+<html lang="zh-CN">
+<head>
+  <meta charset="UTF-8">
+<meta name="viewport" content="width=device-width">
+<meta name="theme-color" content="#222"><meta name="generator" content="Hexo 6.3.0">
+
+  <link rel="apple-touch-icon" sizes="180x180" href="/images/apple-touch-icon-next.png">
+  <link rel="icon" type="image/png" sizes="32x32" href="/images/favicon-32x32-next.png">
+  <link rel="icon" type="image/png" sizes="16x16" href="/images/favicon-16x16-next.png">
+  <link rel="mask-icon" href="/images/logo.svg" color="#222">
+
+<link rel="stylesheet" href="/css/main.css">
+
+
+
+<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/6.4.0/css/all.min.css" integrity="sha256-HtsXJanqjKTc8vVQjO4YMhiqFoXkfBsjBWcX91T1jr8=" crossorigin="anonymous">
+  <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.1.1/animate.min.css" integrity="sha256-PR7ttpcvz8qrF57fur/yAx1qXMFJeJFiA6pSzWi0OIE=" crossorigin="anonymous">
+
+<script class="next-config" data-name="main" type="application/json">{"hostname":"kevin346-sc.github.io","root":"/","images":"/images","scheme":"Muse","darkmode":false,"version":"8.15.1","exturl":false,"sidebar":{"position":"left","display":"post","padding":18,"offset":12},"copycode":{"enable":false,"style":null},"bookmark":{"enable":false,"color":"#222","save":"auto"},"mediumzoom":false,"lazyload":false,"pangu":false,"comments":{"style":"tabs","active":null,"storage":true,"lazyload":false,"nav":null},"stickytabs":false,"motion":{"enable":true,"async":false,"transition":{"menu_item":"fadeInDown","post_block":"fadeIn","post_header":"fadeInDown","post_body":"fadeInDown","coll_header":"fadeInLeft","sidebar":"fadeInUp"}},"prism":false,"i18n":{"placeholder":"搜索...","empty":"没有找到任何搜索结果：${query}","hits_time":"找到 ${hits} 个搜索结果（用时 ${time} 毫秒）","hits":"找到 ${hits} 个搜索结果"}}</script><script src="/js/config.js"></script>
+
+    <meta name="description" content="c++">
+<meta property="og:type" content="website">
+<meta property="og:title" content="Serein’s Blog">
+<meta property="og:url" content="https://kevin346-sc.github.io/archives/2023/11/index.html">
+<meta property="og:site_name" content="Serein’s Blog">
+<meta property="og:description" content="c++">
+<meta property="og:locale" content="zh_CN">
+<meta property="article:author" content="Kevin Huang">
+<meta name="twitter:card" content="summary">
+
+
+<link rel="canonical" href="https://kevin346-sc.github.io/archives/2023/11/">
+
+
+
+<script class="next-config" data-name="page" type="application/json">{"sidebar":"","isHome":false,"isPost":false,"lang":"zh-CN","comments":"","permalink":"","path":"archives/2023/11/index.html","title":""}</script>
+
+<script class="next-config" data-name="calendar" type="application/json">""</script>
+<title>归档 | Serein’s Blog</title>
+  
+
+
+
+
+
+
+
+
+  <noscript>
+    <link rel="stylesheet" href="/css/noscript.css">
+  </noscript>
+</head>
+
+<body itemscope itemtype="http://schema.org/WebPage" class="use-motion">
+  <div class="headband"></div>
+
+  <main class="main">
+    <div class="column">
+      <header class="header" itemscope itemtype="http://schema.org/WPHeader"><div class="site-brand-container">
+  <div class="site-nav-toggle">
+    <div class="toggle" aria-label="切换导航栏" role="button">
+    </div>
+  </div>
+
+  <div class="site-meta">
+
+    <a href="/" class="brand" rel="start">
+      <i class="logo-line"></i>
+      <h1 class="site-title">Serein’s Blog</h1>
+      <i class="logo-line"></i>
+    </a>
+  </div>
+
+  <div class="site-nav-right">
+    <div class="toggle popup-trigger" aria-label="搜索" role="button">
+    </div>
+  </div>
+</div>
+
+
+
+
+
+
+
+</header>
+        
+  
+  <aside class="sidebar">
+
+    <div class="sidebar-inner sidebar-overview-active">
+      <ul class="sidebar-nav">
+        <li class="sidebar-nav-toc">
+          文章目录
+        </li>
+        <li class="sidebar-nav-overview">
+          站点概览
+        </li>
+      </ul>
+
+      <div class="sidebar-panel-container">
+        <!--noindex-->
+        <div class="post-toc-wrap sidebar-panel">
+        </div>
+        <!--/noindex-->
+
+        <div class="site-overview-wrap sidebar-panel">
+          <div class="site-author animated" itemprop="author" itemscope itemtype="http://schema.org/Person">
+  <p class="site-author-name" itemprop="name">Kevin Huang</p>
+  <div class="site-description" itemprop="description">c++</div>
+</div>
+<div class="site-state-wrap animated">
+  <nav class="site-state">
+      <div class="site-state-item site-state-posts">
+        <a href="/archives/">
+          <span class="site-state-item-count">19</span>
+          <span class="site-state-item-name">日志</span>
+        </a>
+      </div>
+      <div class="site-state-item site-state-tags">
+        <span class="site-state-item-count">2</span>
+        <span class="site-state-item-name">标签</span>
+      </div>
+  </nav>
+</div>
+
+        </div>
+      </div>
+    </div>
+
+    
+  </aside>
+
+
+    </div>
+
+    <div class="main-inner archive posts-collapse">
+
+
+  
+  
+  
+  <div class="post-block">
+    <div class="post-content">
+      <div class="collection-title">
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
+      </div>
+
+      
+    <div class="collection-year">
+      <span class="collection-header">2023</span>
+    </div>
+
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2023-11-19T13:25:02+08:00"
+              content="2023-11-19">
+          11-19
+        </time>
+      </div>
+
+      <div class="post-title">
+          <a class="post-title-link" href="/2023/11/19/template/" itemprop="url">
+            <span itemprop="name">template</span>
+          </a>
+      </div>
+
+      
+    </header>
+  </article>
+
+
+    </div>
+  </div>
+  
+  
+  
+
+</div>
+  </main>
+
+  <footer class="footer">
+    <div class="footer-inner">
+
+
+<div class="copyright">
+  &copy; 
+  <span itemprop="copyrightYear">2024</span>
+  <span class="with-love">
+    <i class="fa fa-heart"></i>
+  </span>
+  <span class="author" itemprop="copyrightHolder">Kevin Huang</span>
+</div>
+  <div class="powered-by">由 <a href="https://hexo.io/" rel="noopener" target="_blank">Hexo</a> & <a href="https://theme-next.js.org/muse/" rel="noopener" target="_blank">NexT.Muse</a> 强力驱动
+  </div>
+
+    </div>
+  </footer>
+
+  
+  <div class="toggle sidebar-toggle" role="button">
+    <span class="toggle-line"></span>
+    <span class="toggle-line"></span>
+    <span class="toggle-line"></span>
+  </div>
+  <div class="sidebar-dimmer"></div>
+  <div class="back-to-top" role="button" aria-label="返回顶部">
+    <i class="fa fa-arrow-up fa-lg"></i>
+    <span>0%</span>
+  </div>
+
+<noscript>
+  <div class="noscript-warning">Theme NexT works best with JavaScript enabled</div>
+</noscript>
+
+
+  
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/animejs/3.2.1/anime.min.js" integrity="sha256-XL2inqUJaslATFnHdJOi9GfQ60on8Wx1C2H8DYiN1xY=" crossorigin="anonymous"></script>
+<script src="/js/comments.js"></script><script src="/js/utils.js"></script><script src="/js/motion.js"></script><script src="/js/schemes/muse.js"></script><script src="/js/next-boot.js"></script>
+
+  
+
+
+
+
+  
+
+
+
+
+
+</body>
+</html>
diff --git a/archives/2023/index.html b/archives/2023/index.html
index 14edfa7..ff72c36 100644
--- a/archives/2023/index.html
+++ b/archives/2023/index.html
@@ -114,7 +114,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -144,7 +144,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <div class="post-block">
     <div class="post-content">
       <div class="collection-title">
-        <span class="collection-header">嗯..! 目前共计 17 篇日志。 继续努力。</span>
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
       </div>
 
       
@@ -152,6 +152,26 @@ <h1 class="site-title">Serein’s Blog</h1>
       <span class="collection-header">2023</span>
     </div>
 
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2023-11-19T13:25:02+08:00"
+              content="2023-11-19">
+          11-19
+        </time>
+      </div>
+
+      <div class="post-title">
+          <a class="post-title-link" href="/2023/11/19/template/" itemprop="url">
+            <span itemprop="name">template</span>
+          </a>
+      </div>
+
+      
+    </header>
+  </article>
+
   <article itemscope itemtype="http://schema.org/Article">
     <header class="post-header">
       <div class="post-meta-container">
@@ -332,32 +352,15 @@ <h1 class="site-title">Serein’s Blog</h1>
     </header>
   </article>
 
-  <article itemscope itemtype="http://schema.org/Article">
-    <header class="post-header">
-      <div class="post-meta-container">
-        <time itemprop="dateCreated"
-              datetime="2023-03-05T14:15:33+08:00"
-              content="2023-03-05">
-          03-05
-        </time>
-      </div>
-
-      <div class="post-title">
-          <a class="post-title-link" href="/2023/03/05/%E6%94%B9%E9%80%A0%E8%AE%A1%E5%88%92/" itemprop="url">
-            <span itemprop="name">改造计划</span>
-          </a>
-      </div>
-
-      
-    </header>
-  </article>
-
 
     </div>
   </div>
   
   
   
+  <nav class="pagination">
+    <span class="page-number current">1</span><a class="page-number" href="/archives/2023/page/2/">2</a><a class="extend next" rel="next" title="下一页" aria-label="下一页" href="/archives/2023/page/2/"><i class="fa fa-angle-right"></i></a>
+  </nav>
 
 </div>
   </main>
@@ -368,7 +371,7 @@ <h1 class="site-title">Serein’s Blog</h1>
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/archives/2023/page/2/index.html b/archives/2023/page/2/index.html
new file mode 100644
index 0000000..ce121d6
--- /dev/null
+++ b/archives/2023/page/2/index.html
@@ -0,0 +1,239 @@
+<!DOCTYPE html>
+<html lang="zh-CN">
+<head>
+  <meta charset="UTF-8">
+<meta name="viewport" content="width=device-width">
+<meta name="theme-color" content="#222"><meta name="generator" content="Hexo 6.3.0">
+
+  <link rel="apple-touch-icon" sizes="180x180" href="/images/apple-touch-icon-next.png">
+  <link rel="icon" type="image/png" sizes="32x32" href="/images/favicon-32x32-next.png">
+  <link rel="icon" type="image/png" sizes="16x16" href="/images/favicon-16x16-next.png">
+  <link rel="mask-icon" href="/images/logo.svg" color="#222">
+
+<link rel="stylesheet" href="/css/main.css">
+
+
+
+<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/6.4.0/css/all.min.css" integrity="sha256-HtsXJanqjKTc8vVQjO4YMhiqFoXkfBsjBWcX91T1jr8=" crossorigin="anonymous">
+  <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.1.1/animate.min.css" integrity="sha256-PR7ttpcvz8qrF57fur/yAx1qXMFJeJFiA6pSzWi0OIE=" crossorigin="anonymous">
+
+<script class="next-config" data-name="main" type="application/json">{"hostname":"kevin346-sc.github.io","root":"/","images":"/images","scheme":"Muse","darkmode":false,"version":"8.15.1","exturl":false,"sidebar":{"position":"left","display":"post","padding":18,"offset":12},"copycode":{"enable":false,"style":null},"bookmark":{"enable":false,"color":"#222","save":"auto"},"mediumzoom":false,"lazyload":false,"pangu":false,"comments":{"style":"tabs","active":null,"storage":true,"lazyload":false,"nav":null},"stickytabs":false,"motion":{"enable":true,"async":false,"transition":{"menu_item":"fadeInDown","post_block":"fadeIn","post_header":"fadeInDown","post_body":"fadeInDown","coll_header":"fadeInLeft","sidebar":"fadeInUp"}},"prism":false,"i18n":{"placeholder":"搜索...","empty":"没有找到任何搜索结果：${query}","hits_time":"找到 ${hits} 个搜索结果（用时 ${time} 毫秒）","hits":"找到 ${hits} 个搜索结果"}}</script><script src="/js/config.js"></script>
+
+    <meta name="description" content="c++">
+<meta property="og:type" content="website">
+<meta property="og:title" content="Serein’s Blog">
+<meta property="og:url" content="https://kevin346-sc.github.io/archives/2023/page/2/index.html">
+<meta property="og:site_name" content="Serein’s Blog">
+<meta property="og:description" content="c++">
+<meta property="og:locale" content="zh_CN">
+<meta property="article:author" content="Kevin Huang">
+<meta name="twitter:card" content="summary">
+
+
+<link rel="canonical" href="https://kevin346-sc.github.io/archives/2023/page/2/">
+
+
+
+<script class="next-config" data-name="page" type="application/json">{"sidebar":"","isHome":false,"isPost":false,"lang":"zh-CN","comments":"","permalink":"","path":"archives/2023/page/2/index.html","title":""}</script>
+
+<script class="next-config" data-name="calendar" type="application/json">""</script>
+<title>归档 | Serein’s Blog</title>
+  
+
+
+
+
+
+
+
+
+  <noscript>
+    <link rel="stylesheet" href="/css/noscript.css">
+  </noscript>
+</head>
+
+<body itemscope itemtype="http://schema.org/WebPage" class="use-motion">
+  <div class="headband"></div>
+
+  <main class="main">
+    <div class="column">
+      <header class="header" itemscope itemtype="http://schema.org/WPHeader"><div class="site-brand-container">
+  <div class="site-nav-toggle">
+    <div class="toggle" aria-label="切换导航栏" role="button">
+    </div>
+  </div>
+
+  <div class="site-meta">
+
+    <a href="/" class="brand" rel="start">
+      <i class="logo-line"></i>
+      <h1 class="site-title">Serein’s Blog</h1>
+      <i class="logo-line"></i>
+    </a>
+  </div>
+
+  <div class="site-nav-right">
+    <div class="toggle popup-trigger" aria-label="搜索" role="button">
+    </div>
+  </div>
+</div>
+
+
+
+
+
+
+
+</header>
+        
+  
+  <aside class="sidebar">
+
+    <div class="sidebar-inner sidebar-overview-active">
+      <ul class="sidebar-nav">
+        <li class="sidebar-nav-toc">
+          文章目录
+        </li>
+        <li class="sidebar-nav-overview">
+          站点概览
+        </li>
+      </ul>
+
+      <div class="sidebar-panel-container">
+        <!--noindex-->
+        <div class="post-toc-wrap sidebar-panel">
+        </div>
+        <!--/noindex-->
+
+        <div class="site-overview-wrap sidebar-panel">
+          <div class="site-author animated" itemprop="author" itemscope itemtype="http://schema.org/Person">
+  <p class="site-author-name" itemprop="name">Kevin Huang</p>
+  <div class="site-description" itemprop="description">c++</div>
+</div>
+<div class="site-state-wrap animated">
+  <nav class="site-state">
+      <div class="site-state-item site-state-posts">
+        <a href="/archives/">
+          <span class="site-state-item-count">19</span>
+          <span class="site-state-item-name">日志</span>
+        </a>
+      </div>
+      <div class="site-state-item site-state-tags">
+        <span class="site-state-item-count">2</span>
+        <span class="site-state-item-name">标签</span>
+      </div>
+  </nav>
+</div>
+
+        </div>
+      </div>
+    </div>
+
+    
+  </aside>
+
+
+    </div>
+
+    <div class="main-inner archive posts-collapse">
+
+
+  
+  
+  
+  <div class="post-block">
+    <div class="post-content">
+      <div class="collection-title">
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
+      </div>
+
+      
+    <div class="collection-year">
+      <span class="collection-header">2023</span>
+    </div>
+
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2023-03-05T14:15:33+08:00"
+              content="2023-03-05">
+          03-05
+        </time>
+      </div>
+
+      <div class="post-title">
+          <a class="post-title-link" href="/2023/03/05/%E6%94%B9%E9%80%A0%E8%AE%A1%E5%88%92/" itemprop="url">
+            <span itemprop="name">改造计划</span>
+          </a>
+      </div>
+
+      
+    </header>
+  </article>
+
+
+    </div>
+  </div>
+  
+  
+  
+  <nav class="pagination">
+    <a class="extend prev" rel="prev" title="上一页" aria-label="上一页" href="/archives/2023/"><i class="fa fa-angle-left"></i></a><a class="page-number" href="/archives/2023/">1</a><span class="page-number current">2</span>
+  </nav>
+
+</div>
+  </main>
+
+  <footer class="footer">
+    <div class="footer-inner">
+
+
+<div class="copyright">
+  &copy; 
+  <span itemprop="copyrightYear">2024</span>
+  <span class="with-love">
+    <i class="fa fa-heart"></i>
+  </span>
+  <span class="author" itemprop="copyrightHolder">Kevin Huang</span>
+</div>
+  <div class="powered-by">由 <a href="https://hexo.io/" rel="noopener" target="_blank">Hexo</a> & <a href="https://theme-next.js.org/muse/" rel="noopener" target="_blank">NexT.Muse</a> 强力驱动
+  </div>
+
+    </div>
+  </footer>
+
+  
+  <div class="toggle sidebar-toggle" role="button">
+    <span class="toggle-line"></span>
+    <span class="toggle-line"></span>
+    <span class="toggle-line"></span>
+  </div>
+  <div class="sidebar-dimmer"></div>
+  <div class="back-to-top" role="button" aria-label="返回顶部">
+    <i class="fa fa-arrow-up fa-lg"></i>
+    <span>0%</span>
+  </div>
+
+<noscript>
+  <div class="noscript-warning">Theme NexT works best with JavaScript enabled</div>
+</noscript>
+
+
+  
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/animejs/3.2.1/anime.min.js" integrity="sha256-XL2inqUJaslATFnHdJOi9GfQ60on8Wx1C2H8DYiN1xY=" crossorigin="anonymous"></script>
+<script src="/js/comments.js"></script><script src="/js/utils.js"></script><script src="/js/motion.js"></script><script src="/js/schemes/muse.js"></script><script src="/js/next-boot.js"></script>
+
+  
+
+
+
+
+  
+
+
+
+
+
+</body>
+</html>
diff --git a/archives/2024/08/index.html b/archives/2024/08/index.html
new file mode 100644
index 0000000..2ef6c2d
--- /dev/null
+++ b/archives/2024/08/index.html
@@ -0,0 +1,236 @@
+<!DOCTYPE html>
+<html lang="zh-CN">
+<head>
+  <meta charset="UTF-8">
+<meta name="viewport" content="width=device-width">
+<meta name="theme-color" content="#222"><meta name="generator" content="Hexo 6.3.0">
+
+  <link rel="apple-touch-icon" sizes="180x180" href="/images/apple-touch-icon-next.png">
+  <link rel="icon" type="image/png" sizes="32x32" href="/images/favicon-32x32-next.png">
+  <link rel="icon" type="image/png" sizes="16x16" href="/images/favicon-16x16-next.png">
+  <link rel="mask-icon" href="/images/logo.svg" color="#222">
+
+<link rel="stylesheet" href="/css/main.css">
+
+
+
+<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/6.4.0/css/all.min.css" integrity="sha256-HtsXJanqjKTc8vVQjO4YMhiqFoXkfBsjBWcX91T1jr8=" crossorigin="anonymous">
+  <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.1.1/animate.min.css" integrity="sha256-PR7ttpcvz8qrF57fur/yAx1qXMFJeJFiA6pSzWi0OIE=" crossorigin="anonymous">
+
+<script class="next-config" data-name="main" type="application/json">{"hostname":"kevin346-sc.github.io","root":"/","images":"/images","scheme":"Muse","darkmode":false,"version":"8.15.1","exturl":false,"sidebar":{"position":"left","display":"post","padding":18,"offset":12},"copycode":{"enable":false,"style":null},"bookmark":{"enable":false,"color":"#222","save":"auto"},"mediumzoom":false,"lazyload":false,"pangu":false,"comments":{"style":"tabs","active":null,"storage":true,"lazyload":false,"nav":null},"stickytabs":false,"motion":{"enable":true,"async":false,"transition":{"menu_item":"fadeInDown","post_block":"fadeIn","post_header":"fadeInDown","post_body":"fadeInDown","coll_header":"fadeInLeft","sidebar":"fadeInUp"}},"prism":false,"i18n":{"placeholder":"搜索...","empty":"没有找到任何搜索结果：${query}","hits_time":"找到 ${hits} 个搜索结果（用时 ${time} 毫秒）","hits":"找到 ${hits} 个搜索结果"}}</script><script src="/js/config.js"></script>
+
+    <meta name="description" content="c++">
+<meta property="og:type" content="website">
+<meta property="og:title" content="Serein’s Blog">
+<meta property="og:url" content="https://kevin346-sc.github.io/archives/2024/08/index.html">
+<meta property="og:site_name" content="Serein’s Blog">
+<meta property="og:description" content="c++">
+<meta property="og:locale" content="zh_CN">
+<meta property="article:author" content="Kevin Huang">
+<meta name="twitter:card" content="summary">
+
+
+<link rel="canonical" href="https://kevin346-sc.github.io/archives/2024/08/">
+
+
+
+<script class="next-config" data-name="page" type="application/json">{"sidebar":"","isHome":false,"isPost":false,"lang":"zh-CN","comments":"","permalink":"","path":"archives/2024/08/index.html","title":""}</script>
+
+<script class="next-config" data-name="calendar" type="application/json">""</script>
+<title>归档 | Serein’s Blog</title>
+  
+
+
+
+
+
+
+
+
+  <noscript>
+    <link rel="stylesheet" href="/css/noscript.css">
+  </noscript>
+</head>
+
+<body itemscope itemtype="http://schema.org/WebPage" class="use-motion">
+  <div class="headband"></div>
+
+  <main class="main">
+    <div class="column">
+      <header class="header" itemscope itemtype="http://schema.org/WPHeader"><div class="site-brand-container">
+  <div class="site-nav-toggle">
+    <div class="toggle" aria-label="切换导航栏" role="button">
+    </div>
+  </div>
+
+  <div class="site-meta">
+
+    <a href="/" class="brand" rel="start">
+      <i class="logo-line"></i>
+      <h1 class="site-title">Serein’s Blog</h1>
+      <i class="logo-line"></i>
+    </a>
+  </div>
+
+  <div class="site-nav-right">
+    <div class="toggle popup-trigger" aria-label="搜索" role="button">
+    </div>
+  </div>
+</div>
+
+
+
+
+
+
+
+</header>
+        
+  
+  <aside class="sidebar">
+
+    <div class="sidebar-inner sidebar-overview-active">
+      <ul class="sidebar-nav">
+        <li class="sidebar-nav-toc">
+          文章目录
+        </li>
+        <li class="sidebar-nav-overview">
+          站点概览
+        </li>
+      </ul>
+
+      <div class="sidebar-panel-container">
+        <!--noindex-->
+        <div class="post-toc-wrap sidebar-panel">
+        </div>
+        <!--/noindex-->
+
+        <div class="site-overview-wrap sidebar-panel">
+          <div class="site-author animated" itemprop="author" itemscope itemtype="http://schema.org/Person">
+  <p class="site-author-name" itemprop="name">Kevin Huang</p>
+  <div class="site-description" itemprop="description">c++</div>
+</div>
+<div class="site-state-wrap animated">
+  <nav class="site-state">
+      <div class="site-state-item site-state-posts">
+        <a href="/archives/">
+          <span class="site-state-item-count">19</span>
+          <span class="site-state-item-name">日志</span>
+        </a>
+      </div>
+      <div class="site-state-item site-state-tags">
+        <span class="site-state-item-count">2</span>
+        <span class="site-state-item-name">标签</span>
+      </div>
+  </nav>
+</div>
+
+        </div>
+      </div>
+    </div>
+
+    
+  </aside>
+
+
+    </div>
+
+    <div class="main-inner archive posts-collapse">
+
+
+  
+  
+  
+  <div class="post-block">
+    <div class="post-content">
+      <div class="collection-title">
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
+      </div>
+
+      
+    <div class="collection-year">
+      <span class="collection-header">2024</span>
+    </div>
+
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2024-08-17T20:44:01+08:00"
+              content="2024-08-17">
+          08-17
+        </time>
+      </div>
+
+      <div class="post-title">
+          <a class="post-title-link" href="/2024/08/17/git%E6%93%8D%E4%BD%9C/" itemprop="url">
+            <span itemprop="name">git操作</span>
+          </a>
+      </div>
+
+      
+    </header>
+  </article>
+
+
+    </div>
+  </div>
+  
+  
+  
+
+</div>
+  </main>
+
+  <footer class="footer">
+    <div class="footer-inner">
+
+
+<div class="copyright">
+  &copy; 
+  <span itemprop="copyrightYear">2024</span>
+  <span class="with-love">
+    <i class="fa fa-heart"></i>
+  </span>
+  <span class="author" itemprop="copyrightHolder">Kevin Huang</span>
+</div>
+  <div class="powered-by">由 <a href="https://hexo.io/" rel="noopener" target="_blank">Hexo</a> & <a href="https://theme-next.js.org/muse/" rel="noopener" target="_blank">NexT.Muse</a> 强力驱动
+  </div>
+
+    </div>
+  </footer>
+
+  
+  <div class="toggle sidebar-toggle" role="button">
+    <span class="toggle-line"></span>
+    <span class="toggle-line"></span>
+    <span class="toggle-line"></span>
+  </div>
+  <div class="sidebar-dimmer"></div>
+  <div class="back-to-top" role="button" aria-label="返回顶部">
+    <i class="fa fa-arrow-up fa-lg"></i>
+    <span>0%</span>
+  </div>
+
+<noscript>
+  <div class="noscript-warning">Theme NexT works best with JavaScript enabled</div>
+</noscript>
+
+
+  
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/animejs/3.2.1/anime.min.js" integrity="sha256-XL2inqUJaslATFnHdJOi9GfQ60on8Wx1C2H8DYiN1xY=" crossorigin="anonymous"></script>
+<script src="/js/comments.js"></script><script src="/js/utils.js"></script><script src="/js/motion.js"></script><script src="/js/schemes/muse.js"></script><script src="/js/next-boot.js"></script>
+
+  
+
+
+
+
+  
+
+
+
+
+
+</body>
+</html>
diff --git a/archives/2024/index.html b/archives/2024/index.html
new file mode 100644
index 0000000..5a1da50
--- /dev/null
+++ b/archives/2024/index.html
@@ -0,0 +1,236 @@
+<!DOCTYPE html>
+<html lang="zh-CN">
+<head>
+  <meta charset="UTF-8">
+<meta name="viewport" content="width=device-width">
+<meta name="theme-color" content="#222"><meta name="generator" content="Hexo 6.3.0">
+
+  <link rel="apple-touch-icon" sizes="180x180" href="/images/apple-touch-icon-next.png">
+  <link rel="icon" type="image/png" sizes="32x32" href="/images/favicon-32x32-next.png">
+  <link rel="icon" type="image/png" sizes="16x16" href="/images/favicon-16x16-next.png">
+  <link rel="mask-icon" href="/images/logo.svg" color="#222">
+
+<link rel="stylesheet" href="/css/main.css">
+
+
+
+<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/6.4.0/css/all.min.css" integrity="sha256-HtsXJanqjKTc8vVQjO4YMhiqFoXkfBsjBWcX91T1jr8=" crossorigin="anonymous">
+  <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.1.1/animate.min.css" integrity="sha256-PR7ttpcvz8qrF57fur/yAx1qXMFJeJFiA6pSzWi0OIE=" crossorigin="anonymous">
+
+<script class="next-config" data-name="main" type="application/json">{"hostname":"kevin346-sc.github.io","root":"/","images":"/images","scheme":"Muse","darkmode":false,"version":"8.15.1","exturl":false,"sidebar":{"position":"left","display":"post","padding":18,"offset":12},"copycode":{"enable":false,"style":null},"bookmark":{"enable":false,"color":"#222","save":"auto"},"mediumzoom":false,"lazyload":false,"pangu":false,"comments":{"style":"tabs","active":null,"storage":true,"lazyload":false,"nav":null},"stickytabs":false,"motion":{"enable":true,"async":false,"transition":{"menu_item":"fadeInDown","post_block":"fadeIn","post_header":"fadeInDown","post_body":"fadeInDown","coll_header":"fadeInLeft","sidebar":"fadeInUp"}},"prism":false,"i18n":{"placeholder":"搜索...","empty":"没有找到任何搜索结果：${query}","hits_time":"找到 ${hits} 个搜索结果（用时 ${time} 毫秒）","hits":"找到 ${hits} 个搜索结果"}}</script><script src="/js/config.js"></script>
+
+    <meta name="description" content="c++">
+<meta property="og:type" content="website">
+<meta property="og:title" content="Serein’s Blog">
+<meta property="og:url" content="https://kevin346-sc.github.io/archives/2024/index.html">
+<meta property="og:site_name" content="Serein’s Blog">
+<meta property="og:description" content="c++">
+<meta property="og:locale" content="zh_CN">
+<meta property="article:author" content="Kevin Huang">
+<meta name="twitter:card" content="summary">
+
+
+<link rel="canonical" href="https://kevin346-sc.github.io/archives/2024/">
+
+
+
+<script class="next-config" data-name="page" type="application/json">{"sidebar":"","isHome":false,"isPost":false,"lang":"zh-CN","comments":"","permalink":"","path":"archives/2024/index.html","title":""}</script>
+
+<script class="next-config" data-name="calendar" type="application/json">""</script>
+<title>归档 | Serein’s Blog</title>
+  
+
+
+
+
+
+
+
+
+  <noscript>
+    <link rel="stylesheet" href="/css/noscript.css">
+  </noscript>
+</head>
+
+<body itemscope itemtype="http://schema.org/WebPage" class="use-motion">
+  <div class="headband"></div>
+
+  <main class="main">
+    <div class="column">
+      <header class="header" itemscope itemtype="http://schema.org/WPHeader"><div class="site-brand-container">
+  <div class="site-nav-toggle">
+    <div class="toggle" aria-label="切换导航栏" role="button">
+    </div>
+  </div>
+
+  <div class="site-meta">
+
+    <a href="/" class="brand" rel="start">
+      <i class="logo-line"></i>
+      <h1 class="site-title">Serein’s Blog</h1>
+      <i class="logo-line"></i>
+    </a>
+  </div>
+
+  <div class="site-nav-right">
+    <div class="toggle popup-trigger" aria-label="搜索" role="button">
+    </div>
+  </div>
+</div>
+
+
+
+
+
+
+
+</header>
+        
+  
+  <aside class="sidebar">
+
+    <div class="sidebar-inner sidebar-overview-active">
+      <ul class="sidebar-nav">
+        <li class="sidebar-nav-toc">
+          文章目录
+        </li>
+        <li class="sidebar-nav-overview">
+          站点概览
+        </li>
+      </ul>
+
+      <div class="sidebar-panel-container">
+        <!--noindex-->
+        <div class="post-toc-wrap sidebar-panel">
+        </div>
+        <!--/noindex-->
+
+        <div class="site-overview-wrap sidebar-panel">
+          <div class="site-author animated" itemprop="author" itemscope itemtype="http://schema.org/Person">
+  <p class="site-author-name" itemprop="name">Kevin Huang</p>
+  <div class="site-description" itemprop="description">c++</div>
+</div>
+<div class="site-state-wrap animated">
+  <nav class="site-state">
+      <div class="site-state-item site-state-posts">
+        <a href="/archives/">
+          <span class="site-state-item-count">19</span>
+          <span class="site-state-item-name">日志</span>
+        </a>
+      </div>
+      <div class="site-state-item site-state-tags">
+        <span class="site-state-item-count">2</span>
+        <span class="site-state-item-name">标签</span>
+      </div>
+  </nav>
+</div>
+
+        </div>
+      </div>
+    </div>
+
+    
+  </aside>
+
+
+    </div>
+
+    <div class="main-inner archive posts-collapse">
+
+
+  
+  
+  
+  <div class="post-block">
+    <div class="post-content">
+      <div class="collection-title">
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
+      </div>
+
+      
+    <div class="collection-year">
+      <span class="collection-header">2024</span>
+    </div>
+
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2024-08-17T20:44:01+08:00"
+              content="2024-08-17">
+          08-17
+        </time>
+      </div>
+
+      <div class="post-title">
+          <a class="post-title-link" href="/2024/08/17/git%E6%93%8D%E4%BD%9C/" itemprop="url">
+            <span itemprop="name">git操作</span>
+          </a>
+      </div>
+
+      
+    </header>
+  </article>
+
+
+    </div>
+  </div>
+  
+  
+  
+
+</div>
+  </main>
+
+  <footer class="footer">
+    <div class="footer-inner">
+
+
+<div class="copyright">
+  &copy; 
+  <span itemprop="copyrightYear">2024</span>
+  <span class="with-love">
+    <i class="fa fa-heart"></i>
+  </span>
+  <span class="author" itemprop="copyrightHolder">Kevin Huang</span>
+</div>
+  <div class="powered-by">由 <a href="https://hexo.io/" rel="noopener" target="_blank">Hexo</a> & <a href="https://theme-next.js.org/muse/" rel="noopener" target="_blank">NexT.Muse</a> 强力驱动
+  </div>
+
+    </div>
+  </footer>
+
+  
+  <div class="toggle sidebar-toggle" role="button">
+    <span class="toggle-line"></span>
+    <span class="toggle-line"></span>
+    <span class="toggle-line"></span>
+  </div>
+  <div class="sidebar-dimmer"></div>
+  <div class="back-to-top" role="button" aria-label="返回顶部">
+    <i class="fa fa-arrow-up fa-lg"></i>
+    <span>0%</span>
+  </div>
+
+<noscript>
+  <div class="noscript-warning">Theme NexT works best with JavaScript enabled</div>
+</noscript>
+
+
+  
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/animejs/3.2.1/anime.min.js" integrity="sha256-XL2inqUJaslATFnHdJOi9GfQ60on8Wx1C2H8DYiN1xY=" crossorigin="anonymous"></script>
+<script src="/js/comments.js"></script><script src="/js/utils.js"></script><script src="/js/motion.js"></script><script src="/js/schemes/muse.js"></script><script src="/js/next-boot.js"></script>
+
+  
+
+
+
+
+  
+
+
+
+
+
+</body>
+</html>
diff --git a/archives/index.html b/archives/index.html
index 5947e2f..d9c2893 100644
--- a/archives/index.html
+++ b/archives/index.html
@@ -114,7 +114,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -144,14 +144,57 @@ <h1 class="site-title">Serein’s Blog</h1>
   <div class="post-block">
     <div class="post-content">
       <div class="collection-title">
-        <span class="collection-header">嗯..! 目前共计 17 篇日志。 继续努力。</span>
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
       </div>
 
       
+    <div class="collection-year">
+      <span class="collection-header">2024</span>
+    </div>
+
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2024-08-17T20:44:01+08:00"
+              content="2024-08-17">
+          08-17
+        </time>
+      </div>
+
+      <div class="post-title">
+          <a class="post-title-link" href="/2024/08/17/git%E6%93%8D%E4%BD%9C/" itemprop="url">
+            <span itemprop="name">git操作</span>
+          </a>
+      </div>
+
+      
+    </header>
+  </article>
     <div class="collection-year">
       <span class="collection-header">2023</span>
     </div>
 
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2023-11-19T13:25:02+08:00"
+              content="2023-11-19">
+          11-19
+        </time>
+      </div>
+
+      <div class="post-title">
+          <a class="post-title-link" href="/2023/11/19/template/" itemprop="url">
+            <span itemprop="name">template</span>
+          </a>
+      </div>
+
+      
+    </header>
+  </article>
+
   <article itemscope itemtype="http://schema.org/Article">
     <header class="post-header">
       <div class="post-meta-container">
@@ -312,46 +355,6 @@ <h1 class="site-title">Serein’s Blog</h1>
     </header>
   </article>
 
-  <article itemscope itemtype="http://schema.org/Article">
-    <header class="post-header">
-      <div class="post-meta-container">
-        <time itemprop="dateCreated"
-              datetime="2023-03-10T20:46:47+08:00"
-              content="2023-03-10">
-          03-10
-        </time>
-      </div>
-
-      <div class="post-title">
-          <a class="post-title-link" href="/2023/03/10/lab/" itemprop="url">
-            <span itemprop="name">lab</span>
-          </a>
-      </div>
-
-      
-    </header>
-  </article>
-
-  <article itemscope itemtype="http://schema.org/Article">
-    <header class="post-header">
-      <div class="post-meta-container">
-        <time itemprop="dateCreated"
-              datetime="2023-03-05T14:15:33+08:00"
-              content="2023-03-05">
-          03-05
-        </time>
-      </div>
-
-      <div class="post-title">
-          <a class="post-title-link" href="/2023/03/05/%E6%94%B9%E9%80%A0%E8%AE%A1%E5%88%92/" itemprop="url">
-            <span itemprop="name">改造计划</span>
-          </a>
-      </div>
-
-      
-    </header>
-  </article>
-
 
     </div>
   </div>
@@ -371,7 +374,7 @@ <h1 class="site-title">Serein’s Blog</h1>
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/archives/page/2/index.html b/archives/page/2/index.html
index ae8427c..e2b4f66 100644
--- a/archives/page/2/index.html
+++ b/archives/page/2/index.html
@@ -114,7 +114,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -144,10 +144,53 @@ <h1 class="site-title">Serein’s Blog</h1>
   <div class="post-block">
     <div class="post-content">
       <div class="collection-title">
-        <span class="collection-header">嗯..! 目前共计 17 篇日志。 继续努力。</span>
+        <span class="collection-header">嗯..! 目前共计 19 篇日志。 继续努力。</span>
       </div>
 
       
+    <div class="collection-year">
+      <span class="collection-header">2023</span>
+    </div>
+
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2023-03-10T20:46:47+08:00"
+              content="2023-03-10">
+          03-10
+        </time>
+      </div>
+
+      <div class="post-title">
+          <a class="post-title-link" href="/2023/03/10/lab/" itemprop="url">
+            <span itemprop="name">lab</span>
+          </a>
+      </div>
+
+      
+    </header>
+  </article>
+
+  <article itemscope itemtype="http://schema.org/Article">
+    <header class="post-header">
+      <div class="post-meta-container">
+        <time itemprop="dateCreated"
+              datetime="2023-03-05T14:15:33+08:00"
+              content="2023-03-05">
+          03-05
+        </time>
+      </div>
+
+      <div class="post-title">
+          <a class="post-title-link" href="/2023/03/05/%E6%94%B9%E9%80%A0%E8%AE%A1%E5%88%92/" itemprop="url">
+            <span itemprop="name">改造计划</span>
+          </a>
+      </div>
+
+      
+    </header>
+  </article>
     <div class="collection-year">
       <span class="collection-header">2022</span>
     </div>
@@ -311,7 +354,7 @@ <h1 class="site-title">Serein’s Blog</h1>
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/css/main.css b/css/main.css
index 69fe7fd..ef1f7c6 100644
--- a/css/main.css
+++ b/css/main.css
@@ -2353,7 +2353,7 @@ ul.breadcrumb li:last-child {
   vertical-align: middle;
 }
 .links-of-author a::before {
-  background: #ff96fa;
+  background: #bd6cb9;
   display: inline-block;
   margin-right: 3px;
   transform: translateY(-2px);
diff --git a/index.html b/index.html
index 094c1bf..c92141c 100644
--- a/index.html
+++ b/index.html
@@ -114,7 +114,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -140,6 +140,208 @@ <h1 class="site-title">Serein’s Blog</h1>
     
 
 
+<div class="post-block">
+  
+  
+
+  <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
+    <link itemprop="mainEntityOfPage" href="https://kevin346-sc.github.io/2024/08/17/git%E6%93%8D%E4%BD%9C/">
+
+    <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
+      <meta itemprop="image" content="/images/avatar.gif">
+      <meta itemprop="name" content="Kevin Huang">
+    </span>
+
+    <span hidden itemprop="publisher" itemscope itemtype="http://schema.org/Organization">
+      <meta itemprop="name" content="Serein’s Blog">
+      <meta itemprop="description" content="c++">
+    </span>
+
+    <span hidden itemprop="post" itemscope itemtype="http://schema.org/CreativeWork">
+      <meta itemprop="name" content="undefined | Serein’s Blog">
+      <meta itemprop="description" content="">
+    </span>
+      <header class="post-header">
+        <h2 class="post-title" itemprop="name headline">
+          <a href="/2024/08/17/git%E6%93%8D%E4%BD%9C/" class="post-title-link" itemprop="url">git操作</a>
+        </h2>
+
+        <div class="post-meta-container">
+          <div class="post-meta">
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar"></i>
+      </span>
+      <span class="post-meta-item-text">发表于</span>
+      
+
+      <time title="创建时间：2024-08-17 20:44:01 / 修改时间：23:48:25" itemprop="dateCreated datePublished" datetime="2024-08-17T20:44:01+08:00">2024-08-17</time>
+    </span>
+
+  
+</div>
+
+        </div>
+      </header>
+
+    
+    
+    
+    <div class="post-body" itemprop="articleBody">
+          <p>假设远程仓库中有main分支，其中有Init的commit</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817191625062.png" alt="image-20240817191625062"></p>
+<p>首先克隆同步到本地仓库，<code>git clone https://github.com/xx/xx.git</code></p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817191750339.png" alt="image-20240817191750339"></p>
+<p>为了不扰乱main分支，应该在本地仓库中创建新的分支<code>git checkout -b my-feature</code></p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817191914518.png" alt="image-20240817191914518"></p>
+<p>后续在此分支上进行自己的代码修改，修改完成后，使用<code>git diff</code>查看修改的代码，然后可<code>git add .</code> 添加修改到暂存区（staging）并告知本地git，<code>git commit -m &quot;f-commit&quot;</code>提交commit给local git</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817192347300.png" alt="image-20240817192347300"></p>
+<p><code>git push -u origin my-feature</code>同步到远程仓库，此时远程仓库中也会新增<code>my-feature</code>分支</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817192627062.png" alt="image-20240817192627062"></p>
+<p>如果此时远程仓库的代码有更新，则需要先拉取远程仓库main到本地的main，先切换到main分支<code>git checkout main</code>，<u>值得注意的是，这时候disk中的代码是Init状态的代码，并非在<code>f-commit</code>下的代码</u></p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817193511042.png" alt="image-20240817193511042"></p>
+<p>这时候使用pull拉取<code>git pull origin main</code>，这时本地仓库与远程仓库状态一样，都有两个分支，切换回my-feature分支，为了在此分支上同步main分支代码更新，使用<code>git rebase main</code>，先让main的最新修改与当前分支同步，在这个基础上尝试添加该分支之前的commit(即<code>f-commit</code>)，如果有<code>rebase conflict</code>，需要手动选择保留哪个修改，这时候my-feature分支上会在f-commit前插入与远程分支一样的update commit</p>
+<p> <img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817193714442.png" alt="image-20240817193714442"></p>
+<p>再将本地同步到远程，<code>git push -f origin my-feature</code>，push需要加-f表示强制push，因为此时远程仓库的my-feature分支同样也有Init，update和f-commit三个commit</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817193839660.png" alt="image-20240817193839660"></p>
+<p>将my-feature分支合并到main分支中<code>pull request</code></p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817194108191.png" alt="image-20240817194108191"></p>
+<p>使用<code>squash and merge</code>，将一个分支上的所有改变合并成一个commit，合并完成后删除远程的my-feature分支，同样在本地仓库上<code>git checkout main</code> 切换到main分支再<code>git branch -D my-feature</code>删除my-feature，最后在main分支上<code>git pull origin main</code>同步远程仓库的更新，如此反复</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817194340700.png" alt="image-20240817194340700"></p>
+<p>以上内容来源于<a target="_blank" rel="noopener" href="https://www.youtube.com/watch?v=uj8hjLyEBmU">https://www.youtube.com/watch?v=uj8hjLyEBmU</a></p>
+<p>关于撤销</p>
+<p>假设初始状态下四个区域一致，disk是硬盘，staging暂存区，local本地仓库以及远端仓库remote</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817194658402.png" alt="image-20240817194658402"></p>
+<p>如果发生修改change，但并未进行<code>git add</code>等操作，也就是说只在硬盘上修改，如果想要撤销，可以使用<code>git checkout &lt;changed_file&gt;</code> 或者<code>git restore &lt;changed_file&gt;</code>直接回退到Init状态，也就是上一次commit这个文件的状态，新版本的git更推荐使用restore</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195333798.png" alt="image-20240817195333798"></p>
+<p>在git add 后，也就是修改被同步到暂存区”git status -&gt; Changes to be commited”，如果想要撤销在暂存区的修改而保留硬盘上的修改，也就是取消git add的效果，就可以使用<code>git reset &lt;changed_file&gt;</code>或者<code>git restore --staged &lt;changed_file&gt;</code></p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195619809.png" alt="image-20240817195619809"></p>
+<p>如果想要连同硬盘上的修改也撤销，可以使用<code>git checkout HEAD &lt;changed_file&gt;</code>表示将文件撤销到最近一次commit的状态（HEAD）</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195653564.png" alt="image-20240817195653564"></p>
+<p>在git commit后，修改被提交到了本地git中，如果仅撤销本地git的修改，即取消git commit的效果，则可以使用<code>git reset --soft HEAD~1</code>，因为HEAD表示最近的一次commit，所以这里使用<code>HEAD~1</code>来表示想要回退到的Init状态</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195853788.png" alt="image-20240817195853788"></p>
+<p>进一步，如果想要取消连同取消git commit 和 git add 的效果，只保留在硬盘上的修改，那么可以使用<code>git reset HEAD~1</code>进行实现，也可以使用<code>git reset --mixed HEAD~1</code></p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817195922651.png" alt="image-20240817195922651"></p>
+<p>要是连硬盘上的修改也撤销，就可以使用<code>git reset --hard HEAD~1</code></p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817200437211.png" alt="image-20240817200437211"></p>
+<p>另一种撤销git revert，本质上是通过添加一个新的commit，使得看起来将change删除了，<code>git revert HEAD</code>这里的HEAD就是指commit过的change</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817200933821.png" alt="image-20240817200933821"></p>
+<p>使用revert的好处有1. 可以撤销中间提交的任意一个commit </p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817201119527.png" alt="image-20240817201119527"></p>
+<p>2.当修改push到远端remote仓库后，想要撤销公有分支上的修改，那么就只能使用revert，然后再push到远端仓库，从结果上撤销这个修改，否则会令使用这个公有分支的开发者混乱；也有可能这个分支是私有分支，就可以使用<code>git reset --hard HEAD~1</code>并推送到远端<code>git push -f</code>，-f 就是让remote强行接受这个分支变化，但不能用在共有分支上</p>
+<p><img src="C:\Users\kevin\AppData\Roaming\Typora\typora-user-images\image-20240817201336433.png" alt="image-20240817201336433"></p>
+<p>以上内容来源于<a target="_blank" rel="noopener" href="https://www.youtube.com/watch?v=ol7CMoJuAvI&t=17s">https://www.youtube.com/watch?v=ol7CMoJuAvI&amp;t=17s</a></p>
+
+      
+    </div>
+
+    
+    
+    
+
+    <footer class="post-footer">
+        <div class="post-eof"></div>
+      
+    </footer>
+  </article>
+</div>
+
+
+
+
+    
+
+
+<div class="post-block">
+  
+  
+
+  <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
+    <link itemprop="mainEntityOfPage" href="https://kevin346-sc.github.io/2023/11/19/template/">
+
+    <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
+      <meta itemprop="image" content="/images/avatar.gif">
+      <meta itemprop="name" content="Kevin Huang">
+    </span>
+
+    <span hidden itemprop="publisher" itemscope itemtype="http://schema.org/Organization">
+      <meta itemprop="name" content="Serein’s Blog">
+      <meta itemprop="description" content="c++">
+    </span>
+
+    <span hidden itemprop="post" itemscope itemtype="http://schema.org/CreativeWork">
+      <meta itemprop="name" content="undefined | Serein’s Blog">
+      <meta itemprop="description" content="">
+    </span>
+      <header class="post-header">
+        <h2 class="post-title" itemprop="name headline">
+          <a href="/2023/11/19/template/" class="post-title-link" itemprop="url">template</a>
+        </h2>
+
+        <div class="post-meta-container">
+          <div class="post-meta">
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar"></i>
+      </span>
+      <span class="post-meta-item-text">发表于</span>
+
+      <time title="创建时间：2023-11-19 13:25:02" itemprop="dateCreated datePublished" datetime="2023-11-19T13:25:02+08:00">2023-11-19</time>
+    </span>
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar-check"></i>
+      </span>
+      <span class="post-meta-item-text">更新于</span>
+      <time title="修改时间：2023-11-27 14:57:33" itemprop="dateModified" datetime="2023-11-27T14:57:33+08:00">2023-11-27</time>
+    </span>
+
+  
+</div>
+
+        </div>
+      </header>
+
+    
+    
+    
+    <div class="post-body" itemprop="articleBody">
+          <h2 id="并查集DisjointSet"><a href="#并查集DisjointSet" class="headerlink" title="并查集DisjointSet"></a>并查集DisjointSet</h2><p>并查集中每个强连通分量视为一个集合，强连通分量中任意两点均可达</p>
+<p>并查集的两个基本操作</p>
+<ul>
+<li>Find：查找元素所属集合</li>
+<li>Union：合并两个子集为一个新的集合</li>
+</ul>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br></pre></td><td class="code"><pre><span class="line">class Disjointset&#123;</span><br><span class="line">	private: </span><br><span class="line">		vector&lt;int&gt; fa;</span><br><span class="line">    	Disjointset(int max_size): fa(vector&lt;int&gt;(max_size))</span><br><span class="line">        &#123;</span><br><span class="line">            // 初始化fa数组</span><br><span class="line">            iota(fa.begin(), fa.end(), 0);</span><br><span class="line">        &#125;</span><br><span class="line">	public:</span><br><span class="line">        int Find(int x)</span><br><span class="line">        &#123;</span><br><span class="line">            if(fa[x] == x) // 自己就是根结点</span><br><span class="line">                return x;</span><br><span class="line">            else //继续查找父结点，直到根结点</span><br><span class="line">            &#123;</span><br><span class="line">                int parent = Find(fa[x]);</span><br><span class="line">                return parent;</span><br><span class="line">            &#125;</span><br><span class="line">            // 三目运算符写法</span><br><span class="line">            // return fa[x] == x ? x : Find(fa[x]);</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        void Union(int a, int b)</span><br><span class="line">        &#123;</span><br><span class="line">            int pa_a = Find(a);</span><br><span class="line">            int pa_b = Find(b);</span><br><span class="line">            if(pa_a == pa_b) // 同属一个集合中，无需合并</span><br><span class="line">                return;</span><br><span class="line">            fa[pa_a] = pa_b;</span><br><span class="line">            // 也可以无需判断，直接写成 fa[pa_a] = pa_b;</span><br><span class="line">        &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<p>这样子，在树高较高的情况下（链表），find的复杂度可以达到O(n)，可以通过秩或者路径压缩的方法来减小复杂度</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br></pre></td><td class="code"><pre><span class="line">// 秩，代表树的高度</span><br><span class="line">// 当秩为a 与 秩为b 的两个子集合并时，将秩较小的合并到秩较大的集合上；若相等，则任意合并，秩+1</span><br><span class="line">class Disjointset&#123;</span><br><span class="line">	private: </span><br><span class="line">		vector&lt;int&gt; fa;</span><br><span class="line">		vector&lt;int&gt; rank; // 秩</span><br><span class="line">    	Disjointset(int max_size): fa(vector&lt;int&gt;(max_size), rank(vector&lt;int&gt;(max_size, 0)))</span><br><span class="line">        &#123;</span><br><span class="line">            // 初始化fa数组</span><br><span class="line">            iota(fa.begin(), fa.end(), 0);</span><br><span class="line">        &#125;</span><br><span class="line">	public:</span><br><span class="line">        int Find(int x)</span><br><span class="line">        &#123;</span><br><span class="line">            if(fa[x] == x) // 自己就是根结点</span><br><span class="line">                return x;</span><br><span class="line">            else //继续查找父结点，直到根结点</span><br><span class="line">            &#123;</span><br><span class="line">                int parent = Find(fa[x]);</span><br><span class="line">                return parent;</span><br><span class="line">            &#125;</span><br><span class="line">            // 三目运算符写法</span><br><span class="line">            // return fa[x] == x ? x : Find(fa[x]);</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        void Union(int a, int b)</span><br><span class="line">        &#123;</span><br><span class="line">            int pa_a = Find(a);</span><br><span class="line">            int pa_b = Find(b);</span><br><span class="line">            if(rank[pa_a] &gt; rank[pa_b])</span><br><span class="line">            &#123;</span><br><span class="line">            	fa[pa_b] = pa_a;</span><br><span class="line">            &#125;</span><br><span class="line">            else</span><br><span class="line">            &#123;</span><br><span class="line">            	fa[pa_a] = pa_b;</span><br><span class="line">            	if(rank[pa_a] == rank[pa_b])</span><br><span class="line">            		rank[pa_b]++;</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line">&#125;;</span><br><span class="line"></span><br><span class="line"></span><br><span class="line">// 路径压缩</span><br><span class="line">class Disjointset&#123;</span><br><span class="line">	private: </span><br><span class="line">		vector&lt;int&gt; fa;</span><br><span class="line">    	Disjointset(int max_size): fa(vector&lt;int&gt;(max_size))</span><br><span class="line">        &#123;</span><br><span class="line">            // 初始化fa数组</span><br><span class="line">            iota(fa.begin(), fa.end(), 0);</span><br><span class="line">        &#125;</span><br><span class="line">	public:</span><br><span class="line">        int Find(int x)</span><br><span class="line">        &#123;</span><br><span class="line">            // 三目运算符写法</span><br><span class="line">            // return fa[x] == x ? x : Find(fa[x]);</span><br><span class="line">            // 在向上查找根结点时，每个孙子结点都变为子结点，减小树高</span><br><span class="line">            return fa[x] == x ? x : fa[x] = Find(fa[x]);</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        void Union(int a, int b)</span><br><span class="line">        &#123;</span><br><span class="line">            int pa_a = Find(a);</span><br><span class="line">            int pa_b = Find(b);</span><br><span class="line">            if(pa_a == pa_b) // 同属一个集合中，无需合并</span><br><span class="line">                return;</span><br><span class="line">            fa[pa_a] = pa_b;</span><br><span class="line">            // 也可以无需判断，直接写成 fa[pa_a] = pa_b;</span><br><span class="line">        &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<p>时间复杂度：<code>O(n+m×α(m))</code>，其中 n 是图中的顶点数，m 是图中边的数目，α 是反阿克曼函数，在n非常大的时候，α(n) &lt; 5。并查集的初始化需要 O(n)的时间，然后遍历 m 条边并执行 m 次合并操作，最后对 source 和 destination 执行一次查询操作，查询与合并的单次操作时间复杂度是 <code>O(α(m))</code>，因此合并与查询的时间复杂度是 <code>O(m×α(m))</code>，总时间复杂度是 <code>O(n+m×α(m))</code></p>
+<h3 id="2316-统计无向图中无法互相到达点对数"><a href="#2316-统计无向图中无法互相到达点对数" class="headerlink" title="2316. 统计无向图中无法互相到达点对数"></a><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph/">2316. 统计无向图中无法互相到达点对数</a></h3><p>附加数组信息，保存节点数信息</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br></pre></td><td class="code"><pre><span class="line">class Disjointset&#123;</span><br><span class="line">    private:</span><br><span class="line">        vector&lt;int&gt; fa;</span><br><span class="line">        vector&lt;int&gt; rank;</span><br><span class="line">    public:</span><br><span class="line">        Disjointset(int n): fa(vector&lt;int&gt;(n)), rank(n, 1)</span><br><span class="line">        &#123;</span><br><span class="line">            iota(fa.begin(), fa.end(), 0);</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        int find(int x)</span><br><span class="line">        &#123;</span><br><span class="line">            if(x == fa[x])</span><br><span class="line">                return x;</span><br><span class="line">            else</span><br><span class="line">            &#123;</span><br><span class="line">                fa[x] = find(fa[x]);</span><br><span class="line">                return fa[x];</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        void Union(int x, int y)</span><br><span class="line">        &#123;</span><br><span class="line">            int pa_a = find(x);</span><br><span class="line">            int pa_b = find(y);</span><br><span class="line"></span><br><span class="line">            if(pa_a == pa_b)</span><br><span class="line">                return;</span><br><span class="line">            if(rank[pa_a] &gt; rank[pa_b])</span><br><span class="line">            &#123;</span><br><span class="line">                fa[pa_b] = pa_a;</span><br><span class="line">                rank[pa_a] += rank[pa_b];</span><br><span class="line">            &#125;</span><br><span class="line">            else</span><br><span class="line">            &#123;</span><br><span class="line">                fa[pa_a] = pa_b;</span><br><span class="line">                rank[pa_b] += rank[pa_a];</span><br><span class="line">            &#125;   </span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        int get(int x)</span><br><span class="line">        &#123;</span><br><span class="line">            return rank[x];</span><br><span class="line">        &#125;</span><br><span class="line">&#125;;</span><br><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    long long countPairs(int n, vector&lt;vector&lt;int&gt;&gt;&amp; edges) &#123;</span><br><span class="line">        Disjointset disjointset(n);</span><br><span class="line">        for(const auto &amp; edge : edges)</span><br><span class="line">        &#123;</span><br><span class="line">            disjointset.Union(edge[0], edge[1]);</span><br><span class="line">        &#125;</span><br><span class="line">        long long res = 0;</span><br><span class="line">        for(int i = 0; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            res += n - disjointset.get(disjointset.find(i));</span><br><span class="line">        &#125;</span><br><span class="line">        return res / 2;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h2 id="字典树-Trie"><a href="#字典树-Trie" class="headerlink" title="字典树 Trie"></a>字典树 Trie</h2>
+      
+    </div>
+
+    
+    
+    
+
+    <footer class="post-footer">
+        <div class="post-eof"></div>
+      
+    </footer>
+  </article>
+</div>
+
+
+
+
+    
+
+
 <div class="post-block">
   
   
@@ -176,6 +378,13 @@ <h2 class="post-title" itemprop="name headline">
 
       <time title="创建时间：2023-09-26 15:10:29" itemprop="dateCreated datePublished" datetime="2023-09-26T15:10:29+08:00">2023-09-26</time>
     </span>
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar-check"></i>
+      </span>
+      <span class="post-meta-item-text">更新于</span>
+      <time title="修改时间：2023-10-18 09:43:38" itemprop="dateModified" datetime="2023-10-18T09:43:38+08:00">2023-10-18</time>
+    </span>
 
   
 </div>
@@ -187,7 +396,25 @@ <h2 class="post-title" itemprop="name headline">
     
     
     <div class="post-body" itemprop="articleBody">
-          
+          <h1 id="LAB0文档"><a href="#LAB0文档" class="headerlink" title="LAB0文档"></a>LAB0<a target="_blank" rel="noopener" href="https://cs144.github.io/assignments/check0.pdf">文档</a></h1><h2 id="环境搭建"><a href="#环境搭建" class="headerlink" title="环境搭建"></a>环境搭建</h2><p>选择 VirtualBox + <a target="_blank" rel="noopener" href="https://stanford.edu/class/cs144/vm_files/cs144-intel-2023.ova">CS144 Image</a> + Xshell 远程连接 + vscode remote插件远程开发环境</p>
+<p>安装好VirtualBox后，导入下载的实验虚拟电脑.ova文件，以cs144为账号和密码登录至虚拟机，首次登录需要修改密码</p>
+<p>Xshell中建立以localhost为ip，2222为端口号的ssh连接，输入账号密码即可进行连接</p>
+<p>在vscode中安装remote explorer插件，如图打开config配置文件，</p>
+<p><img src="https://raw.githubusercontent.com/kevin346-sc/figure/main/202309262117800.png"></p>
+<p>写上ssh连接信息</p>
+<p><img src="https://raw.githubusercontent.com/kevin346-sc/figure/main/202309262117167.png"></p>
+<p>或者点击加号新建一个ssh连接，并输入命令行</p>
+<p><img src="https://raw.githubusercontent.com/kevin346-sc/figure/main/202309262117837.png"></p>
+<p>还可以在虚拟机中添加本地电脑的ssh公钥，从而实现免密码的登录</p>
+<h2 id="实验Networking-by-hand"><a href="#实验Networking-by-hand" class="headerlink" title="实验Networking  by hand"></a>实验Networking  by hand</h2><h3 id="Fetch-a-Web-page"><a href="#Fetch-a-Web-page" class="headerlink" title="Fetch a Web page"></a>Fetch a Web page</h3><p>访问<a target="_blank" rel="noopener" href="http://cs144.keithw.org/hello">网页</a>并获取结果</p>
+<p>依次输入<code>telnet cs144.keithw.org http</code> 表明telnet程序通过http服务访问</p>
+<p><code>GET /hello HTTP/1.1</code> 表明GET方法获取URL下的路径</p>
+<p><code>Host: cs144.keithw/org</code> 表明URL中的主机名</p>
+<p><code>Connection: close</code> 表明在服务器完成响应后关闭连接</p>
+<p>需要在较短时间内完成命令输入，否则会出现408超时</p>
+<h3 id="Send-yourself-an-email"><a href="#Send-yourself-an-email" class="headerlink" title="Send yourself an email"></a>Send yourself an email</h3><p>使用telnet还可以指定让telnet程序通过smtp进行邮件发送</p>
+<h3 id="Listening-and-connecting"><a href="#Listening-and-connecting" class="headerlink" title="Listening and connecting"></a>Listening and connecting</h3><p><code>netcat -v -l -p 9090</code>即可以对端口9090进行监听，开启另一个终端输入<code>telnet localhost 9090</code>对9090端口进行访问，此时可以在两个终端上互相发送消息并立即显示到另一个终端上</p>
+
       
     </div>
 
@@ -1210,253 +1437,6 @@ <h2 id="库CentOS与Ubuntu哪个更适合做服务器系统"><a href="#库CentOS
 
 
 
-    
-
-
-<div class="post-block">
-  
-  
-
-  <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://kevin346-sc.github.io/2023/03/10/lab/">
-
-    <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
-      <meta itemprop="image" content="/images/avatar.gif">
-      <meta itemprop="name" content="Kevin Huang">
-    </span>
-
-    <span hidden itemprop="publisher" itemscope itemtype="http://schema.org/Organization">
-      <meta itemprop="name" content="Serein’s Blog">
-      <meta itemprop="description" content="c++">
-    </span>
-
-    <span hidden itemprop="post" itemscope itemtype="http://schema.org/CreativeWork">
-      <meta itemprop="name" content="undefined | Serein’s Blog">
-      <meta itemprop="description" content="">
-    </span>
-      <header class="post-header">
-        <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/03/10/lab/" class="post-title-link" itemprop="url">lab</a>
-        </h2>
-
-        <div class="post-meta-container">
-          <div class="post-meta">
-    <span class="post-meta-item">
-      <span class="post-meta-item-icon">
-        <i class="far fa-calendar"></i>
-      </span>
-      <span class="post-meta-item-text">发表于</span>
-
-      <time title="创建时间：2023-03-10 20:46:47" itemprop="dateCreated datePublished" datetime="2023-03-10T20:46:47+08:00">2023-03-10</time>
-    </span>
-    <span class="post-meta-item">
-      <span class="post-meta-item-icon">
-        <i class="far fa-calendar-check"></i>
-      </span>
-      <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-03-11 10:49:20" itemprop="dateModified" datetime="2023-03-11T10:49:20+08:00">2023-03-11</time>
-    </span>
-
-  
-</div>
-
-        </div>
-      </header>
-
-    
-    
-    
-    <div class="post-body" itemprop="articleBody">
-          <h1 id="0、docker搭建linux环境（for-Windows）"><a href="#0、docker搭建linux环境（for-Windows）" class="headerlink" title="0、docker搭建linux环境（for Windows）"></a>0、docker搭建linux环境（for Windows）</h1><h2 id="docker官网下载-docker-desktop"><a href="#docker官网下载-docker-desktop" class="headerlink" title="docker官网下载 docker desktop"></a><a target="_blank" rel="noopener" href="https://www.docker.com/">docker官网</a>下载 docker desktop</h2><p>右上角点击Get Started，选择Download for Windows进行下载并安装</p>
-<img src="C:\myblog\source\_posts\lab\docker_download.png" style="zoom:50%;" />
-
-<p>打开cmd，通过<code>docker --version</code> 命令查看是否安装成功</p>
-<h2 id="配置docker镜像"><a href="#配置docker镜像" class="headerlink" title="配置docker镜像"></a>配置docker镜像</h2><p>打开docker desktop，在设置中找到Docker Engine，将原有文本修改成如下并Apply &amp; restart</p>
-<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br></pre></td><td class="code"><pre><span class="line">&#123;</span><br><span class="line">  &quot;experimental&quot;: false,</span><br><span class="line">  &quot;registry-mirrors&quot;: [</span><br><span class="line">    &quot;https://docker.mirrors.ustc.edu.cn&quot;</span><br><span class="line">  ],</span><br><span class="line">  &quot;features&quot;: &#123;</span><br><span class="line">    &quot;buildkit&quot;: true</span><br><span class="line">  &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
-
-<img src="C:\myblog\source\_posts\lab\docker_engine.png" style="zoom:50%;" />
-
-<p>cmd中输入<code>docker info</code>并显示有如下信息即可</p>
-<p><img src="C:\myblog\source_posts\lab\docker_info.png"></p>
-<h2 id="拉取Linux镜像并新建容器"><a href="#拉取Linux镜像并新建容器" class="headerlink" title="拉取Linux镜像并新建容器"></a>拉取Linux镜像并新建容器</h2><p>这里选择CentOS系统，当然也可以使用其他系统，只需要修改命令参数</p>
-<p>输入<code>docker pull centos</code>即可拉取最新的centos镜像，如果需要特定版本的镜像，则在系统名字后加上版本参数如<code>docker pull centos:7</code></p>
-<p>还可以输入<code>docker images</code>查看本地主机上的镜像</p>
-<p><img src="C:\myblog\source_posts\lab\docker_images.png"></p>
-<p>其中，</p>
-<p>RESPOSITORY 是镜像的仓库源，TAG 是镜像的标签，代表不同版本，IMAGE ID 是镜像ID，CREATED 是镜像的创建时间，SIZE是镜像的大小</p>
-<p>docker中镜像相当于一个类，如果运行还需要将类进行实例化，也就是新建一个容器</p>
-<p><code>docker run -it centos /bin/bash</code></p>
-<p>其中，</p>
-<p>选项-i 指交互式操作，-t 指终端，it通常一起使用，&#x2F;bin&#x2F;bash 表面希望有个交互式shell，centos不指定版本则默认使用最新版本即lastest</p>
-<p><code>[root@9c2ab6d80ac1 /]#</code>即进入centos系统界面</p>
-<h2 id="打开原有容器而非创建"><a href="#打开原有容器而非创建" class="headerlink" title="打开原有容器而非创建"></a>打开原有容器而非创建</h2><p>以刚新建的centost容器为例，</p>
-<img src="C:\myblog\source\_posts\lab\docker_name.png" style="zoom:80%;" />
-
-<ul>
-<li>从docker desktop复制其name或者ID号</li>
-<li><code>docker start 9c2ab6d80ac14f1edf1dec3f89c9b6f759018913f2e13a8086c3c30c24ba0dd9</code>或者<code>docker start csapp_env</code>让容器启动</li>
-<li><code>docker exec -it 9c2ab6d80ac14f1edf1dec3f89c9b6f759018913f2e13a8086c3c30c24ba0dd9 /bin/bash</code>以交互式操作进入容器</li>
-<li><code>[root@9c2ab6d80ac1 /]#</code>centos系统界面</li>
-<li>退出容器则输入<code>exit</code></li>
-</ul>
-<p>这里，除了<code>exec</code>也可以使用<code>attach</code>命令进入容器，<code>attach</code>如果从这个容器退出，就会导致容器的停止</p>
-<h1 id="1、datalab"><a href="#1、datalab" class="headerlink" title="1、datalab"></a>1、datalab</h1><h2 id="挂载目录实现Linux机与主机文件同步"><a href="#挂载目录实现Linux机与主机文件同步" class="headerlink" title="挂载目录实现Linux机与主机文件同步"></a>挂载目录实现Linux机与主机文件同步</h2><ul>
-<li>首先在主机中建立要共享的文件夹，复制其绝对路径，如C:\Users\amour\csapp\lab</li>
-<li>运行<code>docker container run -it -v &quot;C:\Users\amour\csapp\lab&quot;:/csapp --name=csapp_env contos /bin/bash</code>，实现挂载，其中，在容器中的目录名为<code>csapp</code>，容器名为<code>csapp_env</code></li>
-<li>验证挂载情况，进入容器中的目录<code>cd csapp</code>，再用<code>ls</code>指令查看子文件是否与主机中的一致</li>
-</ul>
-<h2 id="配置编译环境"><a href="#配置编译环境" class="headerlink" title="配置编译环境"></a>配置编译环境</h2><ul>
-<li><p>更新yum源，<code>yum -y update</code></p>
-<p>[报错1] 由于本地语言环境不适配可能会出现<code>Failed to set locale, defaulting to C.UTF-8</code>报错，则需要先安装响应的语言包和语言环境</p>
-<ul>
-<li><p><code>locale -a</code>查看目前已安装的语言包</p>
-</li>
-<li><p><code>yum install glibc-langpack-zh</code>安装中文语言包</p>
-<p>[报错2] 这一步可能又会出现<code>Failed to download metadata for repo &#39;appstream&#39;</code>,需要将软件包修改源，在<code>/etc/yum.repos</code>中更新<code>repos.d</code>使用<code>vault.centos.org</code>代替<code>mirror.centos.org</code></p>
-<ul>
-<li><p>cd &#x2F;etc&#x2F;yum.repos.d</p>
-</li>
-<li><p>vi CentOS-Linux-BaseOS.repo</p>
-<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">[baseos]</span><br><span class="line">name=CentOS Linux $releasever - BaseOS</span><br><span class="line">#mirrorlist=http://mirrorlist.centos.org/release=$releasever&amp;arch=$basearch&amp;repo=BaseOS&amp;infra=$infra</span><br><span class="line">#baseurl=http://mirror.centos.org/$contentdir/$releasever/BaseOS/$basearch/os/</span><br><span class="line">baseurl=https://vault.centos.org/centos/$releasever/BaseOS/$basearch/os/</span><br><span class="line">gpgcheck=1</span><br><span class="line">enabled=1</span><br><span class="line">gpgkey=file:///etc/pki/rpm-gpg/RPM-GPG-KEY-centosofficial</span><br></pre></td></tr></table></figure>
-</li>
-<li><p>vi CentOS-Linux-AppStream.repo</p>
-<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">[appstream]</span><br><span class="line">name=CentOS Linux $releasever - AppStream</span><br><span class="line">#mirrorlist=http://mirrorlist.centos.org/?release=$releasever&amp;arch=$basearch&amp;repo=AppStream&amp;infra=$infra</span><br><span class="line">#baseurl=http://mirror.centos.org/$contentdir/$releasever/AppStream/$basearch/os/</span><br><span class="line">baseurl=https://vault.centos.org/centos/$releasever/AppStream/$basearch/os/ </span><br><span class="line">gpgcheck=1</span><br><span class="line">enabled=1</span><br><span class="line">gpgkey=file:///etc/pki/rpm-gpg/RPM-GPG-KEY-centosofficial</span><br></pre></td></tr></table></figure></li>
-</ul>
-</li>
-<li><p>dnf install glibc-langpack-en</p>
-</li>
-<li><p>此时再输入<code>locale -a</code>查看目前的语言包，发现除了原有的<code>C.utf8</code>之外，还有其他的<code>en_utf8</code>和<code>zh_utf8</code>，至此，已解决语言环境不适配导致无法使用yum更新下载的问题</p>
-</li>
-</ul>
-</li>
-<li><p><code>yum install sudo</code>安装sudo</p>
-</li>
-<li><p><code>yum install make automake gcc gcc-c++ kernel-devel</code>安装c&#x2F;c++编译环境</p>
-</li>
-<li><p><code>yum install gdb</code>安装gdb调试器</p>
-</li>
-<li><p><code>yum install glibc-debel.i686</code>安装32位嵌入式C库</p>
-</li>
-<li><p>完成配置</p>
-</li>
-</ul>
-<p>至此，可以在主机的编译器中编写代码保存到共享目录中，在docker的虚拟centos容器中编译和运行代码</p>
-<p>如：在共享目录中创建<code>hello.c</code>文件并编写好，进入容器中的共享文件夹<code>cd csapp/L0/</code>，使用<code>make hello</code>进行编译，<code>./hello</code>即可运行</p>
-
-      
-    </div>
-
-    
-    
-    
-
-    <footer class="post-footer">
-        <div class="post-eof"></div>
-      
-    </footer>
-  </article>
-</div>
-
-
-
-
-    
-
-
-<div class="post-block">
-  
-  
-
-  <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
-    <link itemprop="mainEntityOfPage" href="https://kevin346-sc.github.io/2023/03/05/%E6%94%B9%E9%80%A0%E8%AE%A1%E5%88%92/">
-
-    <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
-      <meta itemprop="image" content="/images/avatar.gif">
-      <meta itemprop="name" content="Kevin Huang">
-    </span>
-
-    <span hidden itemprop="publisher" itemscope itemtype="http://schema.org/Organization">
-      <meta itemprop="name" content="Serein’s Blog">
-      <meta itemprop="description" content="c++">
-    </span>
-
-    <span hidden itemprop="post" itemscope itemtype="http://schema.org/CreativeWork">
-      <meta itemprop="name" content="undefined | Serein’s Blog">
-      <meta itemprop="description" content="">
-    </span>
-      <header class="post-header">
-        <h2 class="post-title" itemprop="name headline">
-          <a href="/2023/03/05/%E6%94%B9%E9%80%A0%E8%AE%A1%E5%88%92/" class="post-title-link" itemprop="url">改造计划</a>
-        </h2>
-
-        <div class="post-meta-container">
-          <div class="post-meta">
-    <span class="post-meta-item">
-      <span class="post-meta-item-icon">
-        <i class="far fa-calendar"></i>
-      </span>
-      <span class="post-meta-item-text">发表于</span>
-
-      <time title="创建时间：2023-03-05 14:15:33" itemprop="dateCreated datePublished" datetime="2023-03-05T14:15:33+08:00">2023-03-05</time>
-    </span>
-    <span class="post-meta-item">
-      <span class="post-meta-item-icon">
-        <i class="far fa-calendar-check"></i>
-      </span>
-      <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-03-09 17:02:40" itemprop="dateModified" datetime="2023-03-09T17:02:40+08:00">2023-03-09</time>
-    </span>
-
-  
-</div>
-
-        </div>
-      </header>
-
-    
-    
-    
-    <div class="post-body" itemprop="articleBody">
-          <h1 id="面向招聘要求和面经学习"><a href="#面向招聘要求和面经学习" class="headerlink" title="面向招聘要求和面经学习"></a>面向招聘要求和面经学习</h1><h2 id="基础语法-面经"><a href="#基础语法-面经" class="headerlink" title="基础语法 + 面经"></a>基础语法 + 面经</h2><p>利用宿舍时间10:00-11:00 C++ Primer</p>
-<p>牛客网面经、习题</p>
-<h2 id="操作系统（重点）"><a href="#操作系统（重点）" class="headerlink" title="操作系统（重点）"></a>操作系统（重点）</h2><p>网课：CMU15-413</p>
-<p>书籍：CSAPP + 现代操作系统</p>
-<p>项目相关：labs</p>
-<p>牛客网习题</p>
-<h2 id="计网"><a href="#计网" class="headerlink" title="计网"></a>计网</h2><p>网课：王道</p>
-<p>小林coding</p>
-<h2 id="数据库"><a href="#数据库" class="headerlink" title="数据库"></a>数据库</h2><p>网课：CMU15-445</p>
-<p>书籍：MySQL必知必会（REDIS？）</p>
-<p>小林coding</p>
-<h2 id="数据结构"><a href="#数据结构" class="headerlink" title="数据结构"></a>数据结构</h2><p>蓝桥杯真题库 + 代码随想录LeetCode + CODETOP</p>
-<p>每日两题</p>
-<h2 id="嵌入式"><a href="#嵌入式" class="headerlink" title="嵌入式"></a>嵌入式</h2><p>Linux原子哥</p>
-<h2 id="webserver项目"><a href="#webserver项目" class="headerlink" title="webserver项目"></a>webserver项目</h2><p>C++ set自定义排序问题</p>
-<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br></pre></td><td class="code"><pre><span class="line">class node &#123;</span><br><span class="line">public:</span><br><span class="line">    int x;</span><br><span class="line">    int y;</span><br><span class="line">    int stime;</span><br><span class="line">    int fintime;</span><br><span class="line"></span><br><span class="line">    node(int xx, int yy, int st ,int ot) : x(xx), y(yy), stime(st), fintime(st + ot) &#123;&#125;</span><br><span class="line"></span><br><span class="line">    bool operator &lt; (node n) const</span><br><span class="line">    &#123;</span><br><span class="line">        if (n.fintime != fintime)</span><br><span class="line">            return fintime &lt; n.fintime;</span><br><span class="line">        else if (x != n.x)</span><br><span class="line">            return x &lt; n.x;</span><br><span class="line">        else</span><br><span class="line">            return y &lt; n.y;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    bool operator &lt; (const node* n) const</span><br><span class="line">    &#123;</span><br><span class="line">        if (n-&gt;fintime != fintime)</span><br><span class="line">            return fintime &lt; n-&gt;fintime;</span><br><span class="line">        else if (x != n-&gt;x)</span><br><span class="line">            return x &lt; n-&gt;x;</span><br><span class="line">        else</span><br><span class="line">            return y &lt; n-&gt;y;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
-
-<p>利用 <code>&lt;</code> 运算符重载，如果<code>set&lt;node*&gt; nodes</code>，此时排序会出现混乱</p>
-<p>而定义<code>set&lt;node&gt; nodes</code>则不会，并且使用仿函数也正常</p>
-<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br></pre></td><td class="code"><pre><span class="line">class comp&#123;</span><br><span class="line">public:</span><br><span class="line">bool operator()( const node&amp; l, const node&amp; r) const</span><br><span class="line">&#123;</span><br><span class="line">    if (l.fintime != r.fintime)</span><br><span class="line">        return l.fintime &lt; r.fintime;</span><br><span class="line">    else if (l.x != r.x)</span><br><span class="line">        return l.x &lt; r.x;</span><br><span class="line">    else</span><br><span class="line">        return l.y &lt; r.y;</span><br><span class="line">&#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
-
-<p><code>set&lt;node, comp&gt; nodes</code>或<code>set&lt;node*, comp&gt; nodes</code></p>
-
-      
-    </div>
-
-    
-    
-    
-
-    <footer class="post-footer">
-        <div class="post-eof"></div>
-      
-    </footer>
-  </article>
-</div>
-
-
-
-
   <nav class="pagination">
     <span class="page-number current">1</span><a class="page-number" href="/page/2/">2</a><a class="extend next" rel="next" title="下一页" aria-label="下一页" href="/page/2/"><i class="fa fa-angle-right"></i></a>
   </nav>
@@ -1470,7 +1450,7 @@ <h2 id="webserver项目"><a href="#webserver项目" class="headerlink" title="we
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/page/2/index.html b/page/2/index.html
index 702da74..364d1e0 100644
--- a/page/2/index.html
+++ b/page/2/index.html
@@ -114,7 +114,7 @@ <h1 class="site-title">Serein’s Blog</h1>
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -140,6 +140,253 @@ <h1 class="site-title">Serein’s Blog</h1>
     
 
 
+<div class="post-block">
+  
+  
+
+  <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
+    <link itemprop="mainEntityOfPage" href="https://kevin346-sc.github.io/2023/03/10/lab/">
+
+    <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
+      <meta itemprop="image" content="/images/avatar.gif">
+      <meta itemprop="name" content="Kevin Huang">
+    </span>
+
+    <span hidden itemprop="publisher" itemscope itemtype="http://schema.org/Organization">
+      <meta itemprop="name" content="Serein’s Blog">
+      <meta itemprop="description" content="c++">
+    </span>
+
+    <span hidden itemprop="post" itemscope itemtype="http://schema.org/CreativeWork">
+      <meta itemprop="name" content="undefined | Serein’s Blog">
+      <meta itemprop="description" content="">
+    </span>
+      <header class="post-header">
+        <h2 class="post-title" itemprop="name headline">
+          <a href="/2023/03/10/lab/" class="post-title-link" itemprop="url">lab</a>
+        </h2>
+
+        <div class="post-meta-container">
+          <div class="post-meta">
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar"></i>
+      </span>
+      <span class="post-meta-item-text">发表于</span>
+
+      <time title="创建时间：2023-03-10 20:46:47" itemprop="dateCreated datePublished" datetime="2023-03-10T20:46:47+08:00">2023-03-10</time>
+    </span>
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar-check"></i>
+      </span>
+      <span class="post-meta-item-text">更新于</span>
+      <time title="修改时间：2023-03-11 10:49:20" itemprop="dateModified" datetime="2023-03-11T10:49:20+08:00">2023-03-11</time>
+    </span>
+
+  
+</div>
+
+        </div>
+      </header>
+
+    
+    
+    
+    <div class="post-body" itemprop="articleBody">
+          <h1 id="0、docker搭建linux环境（for-Windows）"><a href="#0、docker搭建linux环境（for-Windows）" class="headerlink" title="0、docker搭建linux环境（for Windows）"></a>0、docker搭建linux环境（for Windows）</h1><h2 id="docker官网下载-docker-desktop"><a href="#docker官网下载-docker-desktop" class="headerlink" title="docker官网下载 docker desktop"></a><a target="_blank" rel="noopener" href="https://www.docker.com/">docker官网</a>下载 docker desktop</h2><p>右上角点击Get Started，选择Download for Windows进行下载并安装</p>
+<img src="C:\myblog\source\_posts\lab\docker_download.png" style="zoom:50%;" />
+
+<p>打开cmd，通过<code>docker --version</code> 命令查看是否安装成功</p>
+<h2 id="配置docker镜像"><a href="#配置docker镜像" class="headerlink" title="配置docker镜像"></a>配置docker镜像</h2><p>打开docker desktop，在设置中找到Docker Engine，将原有文本修改成如下并Apply &amp; restart</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br></pre></td><td class="code"><pre><span class="line">&#123;</span><br><span class="line">  &quot;experimental&quot;: false,</span><br><span class="line">  &quot;registry-mirrors&quot;: [</span><br><span class="line">    &quot;https://docker.mirrors.ustc.edu.cn&quot;</span><br><span class="line">  ],</span><br><span class="line">  &quot;features&quot;: &#123;</span><br><span class="line">    &quot;buildkit&quot;: true</span><br><span class="line">  &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
+
+<img src="C:\myblog\source\_posts\lab\docker_engine.png" style="zoom:50%;" />
+
+<p>cmd中输入<code>docker info</code>并显示有如下信息即可</p>
+<p><img src="C:\myblog\source_posts\lab\docker_info.png"></p>
+<h2 id="拉取Linux镜像并新建容器"><a href="#拉取Linux镜像并新建容器" class="headerlink" title="拉取Linux镜像并新建容器"></a>拉取Linux镜像并新建容器</h2><p>这里选择CentOS系统，当然也可以使用其他系统，只需要修改命令参数</p>
+<p>输入<code>docker pull centos</code>即可拉取最新的centos镜像，如果需要特定版本的镜像，则在系统名字后加上版本参数如<code>docker pull centos:7</code></p>
+<p>还可以输入<code>docker images</code>查看本地主机上的镜像</p>
+<p><img src="C:\myblog\source_posts\lab\docker_images.png"></p>
+<p>其中，</p>
+<p>RESPOSITORY 是镜像的仓库源，TAG 是镜像的标签，代表不同版本，IMAGE ID 是镜像ID，CREATED 是镜像的创建时间，SIZE是镜像的大小</p>
+<p>docker中镜像相当于一个类，如果运行还需要将类进行实例化，也就是新建一个容器</p>
+<p><code>docker run -it centos /bin/bash</code></p>
+<p>其中，</p>
+<p>选项-i 指交互式操作，-t 指终端，it通常一起使用，&#x2F;bin&#x2F;bash 表面希望有个交互式shell，centos不指定版本则默认使用最新版本即lastest</p>
+<p><code>[root@9c2ab6d80ac1 /]#</code>即进入centos系统界面</p>
+<h2 id="打开原有容器而非创建"><a href="#打开原有容器而非创建" class="headerlink" title="打开原有容器而非创建"></a>打开原有容器而非创建</h2><p>以刚新建的centost容器为例，</p>
+<img src="C:\myblog\source\_posts\lab\docker_name.png" style="zoom:80%;" />
+
+<ul>
+<li>从docker desktop复制其name或者ID号</li>
+<li><code>docker start 9c2ab6d80ac14f1edf1dec3f89c9b6f759018913f2e13a8086c3c30c24ba0dd9</code>或者<code>docker start csapp_env</code>让容器启动</li>
+<li><code>docker exec -it 9c2ab6d80ac14f1edf1dec3f89c9b6f759018913f2e13a8086c3c30c24ba0dd9 /bin/bash</code>以交互式操作进入容器</li>
+<li><code>[root@9c2ab6d80ac1 /]#</code>centos系统界面</li>
+<li>退出容器则输入<code>exit</code></li>
+</ul>
+<p>这里，除了<code>exec</code>也可以使用<code>attach</code>命令进入容器，<code>attach</code>如果从这个容器退出，就会导致容器的停止</p>
+<h1 id="1、datalab"><a href="#1、datalab" class="headerlink" title="1、datalab"></a>1、datalab</h1><h2 id="挂载目录实现Linux机与主机文件同步"><a href="#挂载目录实现Linux机与主机文件同步" class="headerlink" title="挂载目录实现Linux机与主机文件同步"></a>挂载目录实现Linux机与主机文件同步</h2><ul>
+<li>首先在主机中建立要共享的文件夹，复制其绝对路径，如C:\Users\amour\csapp\lab</li>
+<li>运行<code>docker container run -it -v &quot;C:\Users\amour\csapp\lab&quot;:/csapp --name=csapp_env contos /bin/bash</code>，实现挂载，其中，在容器中的目录名为<code>csapp</code>，容器名为<code>csapp_env</code></li>
+<li>验证挂载情况，进入容器中的目录<code>cd csapp</code>，再用<code>ls</code>指令查看子文件是否与主机中的一致</li>
+</ul>
+<h2 id="配置编译环境"><a href="#配置编译环境" class="headerlink" title="配置编译环境"></a>配置编译环境</h2><ul>
+<li><p>更新yum源，<code>yum -y update</code></p>
+<p>[报错1] 由于本地语言环境不适配可能会出现<code>Failed to set locale, defaulting to C.UTF-8</code>报错，则需要先安装响应的语言包和语言环境</p>
+<ul>
+<li><p><code>locale -a</code>查看目前已安装的语言包</p>
+</li>
+<li><p><code>yum install glibc-langpack-zh</code>安装中文语言包</p>
+<p>[报错2] 这一步可能又会出现<code>Failed to download metadata for repo &#39;appstream&#39;</code>,需要将软件包修改源，在<code>/etc/yum.repos</code>中更新<code>repos.d</code>使用<code>vault.centos.org</code>代替<code>mirror.centos.org</code></p>
+<ul>
+<li><p>cd &#x2F;etc&#x2F;yum.repos.d</p>
+</li>
+<li><p>vi CentOS-Linux-BaseOS.repo</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">[baseos]</span><br><span class="line">name=CentOS Linux $releasever - BaseOS</span><br><span class="line">#mirrorlist=http://mirrorlist.centos.org/release=$releasever&amp;arch=$basearch&amp;repo=BaseOS&amp;infra=$infra</span><br><span class="line">#baseurl=http://mirror.centos.org/$contentdir/$releasever/BaseOS/$basearch/os/</span><br><span class="line">baseurl=https://vault.centos.org/centos/$releasever/BaseOS/$basearch/os/</span><br><span class="line">gpgcheck=1</span><br><span class="line">enabled=1</span><br><span class="line">gpgkey=file:///etc/pki/rpm-gpg/RPM-GPG-KEY-centosofficial</span><br></pre></td></tr></table></figure>
+</li>
+<li><p>vi CentOS-Linux-AppStream.repo</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">[appstream]</span><br><span class="line">name=CentOS Linux $releasever - AppStream</span><br><span class="line">#mirrorlist=http://mirrorlist.centos.org/?release=$releasever&amp;arch=$basearch&amp;repo=AppStream&amp;infra=$infra</span><br><span class="line">#baseurl=http://mirror.centos.org/$contentdir/$releasever/AppStream/$basearch/os/</span><br><span class="line">baseurl=https://vault.centos.org/centos/$releasever/AppStream/$basearch/os/ </span><br><span class="line">gpgcheck=1</span><br><span class="line">enabled=1</span><br><span class="line">gpgkey=file:///etc/pki/rpm-gpg/RPM-GPG-KEY-centosofficial</span><br></pre></td></tr></table></figure></li>
+</ul>
+</li>
+<li><p>dnf install glibc-langpack-en</p>
+</li>
+<li><p>此时再输入<code>locale -a</code>查看目前的语言包，发现除了原有的<code>C.utf8</code>之外，还有其他的<code>en_utf8</code>和<code>zh_utf8</code>，至此，已解决语言环境不适配导致无法使用yum更新下载的问题</p>
+</li>
+</ul>
+</li>
+<li><p><code>yum install sudo</code>安装sudo</p>
+</li>
+<li><p><code>yum install make automake gcc gcc-c++ kernel-devel</code>安装c&#x2F;c++编译环境</p>
+</li>
+<li><p><code>yum install gdb</code>安装gdb调试器</p>
+</li>
+<li><p><code>yum install glibc-debel.i686</code>安装32位嵌入式C库</p>
+</li>
+<li><p>完成配置</p>
+</li>
+</ul>
+<p>至此，可以在主机的编译器中编写代码保存到共享目录中，在docker的虚拟centos容器中编译和运行代码</p>
+<p>如：在共享目录中创建<code>hello.c</code>文件并编写好，进入容器中的共享文件夹<code>cd csapp/L0/</code>，使用<code>make hello</code>进行编译，<code>./hello</code>即可运行</p>
+
+      
+    </div>
+
+    
+    
+    
+
+    <footer class="post-footer">
+        <div class="post-eof"></div>
+      
+    </footer>
+  </article>
+</div>
+
+
+
+
+    
+
+
+<div class="post-block">
+  
+  
+
+  <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="">
+    <link itemprop="mainEntityOfPage" href="https://kevin346-sc.github.io/2023/03/05/%E6%94%B9%E9%80%A0%E8%AE%A1%E5%88%92/">
+
+    <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
+      <meta itemprop="image" content="/images/avatar.gif">
+      <meta itemprop="name" content="Kevin Huang">
+    </span>
+
+    <span hidden itemprop="publisher" itemscope itemtype="http://schema.org/Organization">
+      <meta itemprop="name" content="Serein’s Blog">
+      <meta itemprop="description" content="c++">
+    </span>
+
+    <span hidden itemprop="post" itemscope itemtype="http://schema.org/CreativeWork">
+      <meta itemprop="name" content="undefined | Serein’s Blog">
+      <meta itemprop="description" content="">
+    </span>
+      <header class="post-header">
+        <h2 class="post-title" itemprop="name headline">
+          <a href="/2023/03/05/%E6%94%B9%E9%80%A0%E8%AE%A1%E5%88%92/" class="post-title-link" itemprop="url">改造计划</a>
+        </h2>
+
+        <div class="post-meta-container">
+          <div class="post-meta">
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar"></i>
+      </span>
+      <span class="post-meta-item-text">发表于</span>
+
+      <time title="创建时间：2023-03-05 14:15:33" itemprop="dateCreated datePublished" datetime="2023-03-05T14:15:33+08:00">2023-03-05</time>
+    </span>
+    <span class="post-meta-item">
+      <span class="post-meta-item-icon">
+        <i class="far fa-calendar-check"></i>
+      </span>
+      <span class="post-meta-item-text">更新于</span>
+      <time title="修改时间：2023-03-09 17:02:40" itemprop="dateModified" datetime="2023-03-09T17:02:40+08:00">2023-03-09</time>
+    </span>
+
+  
+</div>
+
+        </div>
+      </header>
+
+    
+    
+    
+    <div class="post-body" itemprop="articleBody">
+          <h1 id="面向招聘要求和面经学习"><a href="#面向招聘要求和面经学习" class="headerlink" title="面向招聘要求和面经学习"></a>面向招聘要求和面经学习</h1><h2 id="基础语法-面经"><a href="#基础语法-面经" class="headerlink" title="基础语法 + 面经"></a>基础语法 + 面经</h2><p>利用宿舍时间10:00-11:00 C++ Primer</p>
+<p>牛客网面经、习题</p>
+<h2 id="操作系统（重点）"><a href="#操作系统（重点）" class="headerlink" title="操作系统（重点）"></a>操作系统（重点）</h2><p>网课：CMU15-413</p>
+<p>书籍：CSAPP + 现代操作系统</p>
+<p>项目相关：labs</p>
+<p>牛客网习题</p>
+<h2 id="计网"><a href="#计网" class="headerlink" title="计网"></a>计网</h2><p>网课：王道</p>
+<p>小林coding</p>
+<h2 id="数据库"><a href="#数据库" class="headerlink" title="数据库"></a>数据库</h2><p>网课：CMU15-445</p>
+<p>书籍：MySQL必知必会（REDIS？）</p>
+<p>小林coding</p>
+<h2 id="数据结构"><a href="#数据结构" class="headerlink" title="数据结构"></a>数据结构</h2><p>蓝桥杯真题库 + 代码随想录LeetCode + CODETOP</p>
+<p>每日两题</p>
+<h2 id="嵌入式"><a href="#嵌入式" class="headerlink" title="嵌入式"></a>嵌入式</h2><p>Linux原子哥</p>
+<h2 id="webserver项目"><a href="#webserver项目" class="headerlink" title="webserver项目"></a>webserver项目</h2><p>C++ set自定义排序问题</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br></pre></td><td class="code"><pre><span class="line">class node &#123;</span><br><span class="line">public:</span><br><span class="line">    int x;</span><br><span class="line">    int y;</span><br><span class="line">    int stime;</span><br><span class="line">    int fintime;</span><br><span class="line"></span><br><span class="line">    node(int xx, int yy, int st ,int ot) : x(xx), y(yy), stime(st), fintime(st + ot) &#123;&#125;</span><br><span class="line"></span><br><span class="line">    bool operator &lt; (node n) const</span><br><span class="line">    &#123;</span><br><span class="line">        if (n.fintime != fintime)</span><br><span class="line">            return fintime &lt; n.fintime;</span><br><span class="line">        else if (x != n.x)</span><br><span class="line">            return x &lt; n.x;</span><br><span class="line">        else</span><br><span class="line">            return y &lt; n.y;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    bool operator &lt; (const node* n) const</span><br><span class="line">    &#123;</span><br><span class="line">        if (n-&gt;fintime != fintime)</span><br><span class="line">            return fintime &lt; n-&gt;fintime;</span><br><span class="line">        else if (x != n-&gt;x)</span><br><span class="line">            return x &lt; n-&gt;x;</span><br><span class="line">        else</span><br><span class="line">            return y &lt; n-&gt;y;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<p>利用 <code>&lt;</code> 运算符重载，如果<code>set&lt;node*&gt; nodes</code>，此时排序会出现混乱</p>
+<p>而定义<code>set&lt;node&gt; nodes</code>则不会，并且使用仿函数也正常</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br></pre></td><td class="code"><pre><span class="line">class comp&#123;</span><br><span class="line">public:</span><br><span class="line">bool operator()( const node&amp; l, const node&amp; r) const</span><br><span class="line">&#123;</span><br><span class="line">    if (l.fintime != r.fintime)</span><br><span class="line">        return l.fintime &lt; r.fintime;</span><br><span class="line">    else if (l.x != r.x)</span><br><span class="line">        return l.x &lt; r.x;</span><br><span class="line">    else</span><br><span class="line">        return l.y &lt; r.y;</span><br><span class="line">&#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<p><code>set&lt;node, comp&gt; nodes</code>或<code>set&lt;node*, comp&gt; nodes</code></p>
+
+      
+    </div>
+
+    
+    
+    
+
+    <footer class="post-footer">
+        <div class="post-eof"></div>
+      
+    </footer>
+  </article>
+</div>
+
+
+
+
+    
+
+
 <div class="post-block">
   
   
@@ -181,7 +428,7 @@ <h2 class="post-title" itemprop="name headline">
         <i class="far fa-calendar-check"></i>
       </span>
       <span class="post-meta-item-text">更新于</span>
-      <time title="修改时间：2023-02-27 13:44:18" itemprop="dateModified" datetime="2023-02-27T13:44:18+08:00">2023-02-27</time>
+      <time title="修改时间：2023-10-11 10:35:43" itemprop="dateModified" datetime="2023-10-11T10:35:43+08:00">2023-10-11</time>
     </span>
 
   
@@ -413,7 +660,101 @@ <h3 id="总结-6"><a href="#总结-6" class="headerlink" title="总结"></a>总
 <p>If an optimal product contains a factor f &gt;&#x3D; 4, then you can replace it with factors 2 and f-2 without losing optimality, as 2*(f-2) &#x3D; 2f-4 &gt;&#x3D; f. So you never need a factor greater than or equal to 4, meaning you only need factors 1, 2 and 3 (and 1 is of course wasteful and you’d only use it for n&#x3D;2 and n&#x3D;3, where it’s needed).</p>
 <p>For the rest I agree, 3<em>3 is simply better than 2</em>2*2, so you’d never use 2 more than twice.、</p>
 </blockquote>
-<h1 id="01背包"><a href="#01背包" class="headerlink" title="01背包"></a>01背包</h1><h1 id="完全背包"><a href="#完全背包" class="headerlink" title="完全背包"></a>完全背包</h1><h1 id="多重背包"><a href="#多重背包" class="headerlink" title="多重背包"></a>多重背包</h1>
+<h1 id="股票系列-状态机DP"><a href="#股票系列-状态机DP" class="headerlink" title="股票系列(状态机DP)"></a>股票系列(状态机DP)</h1><h2 id="买卖股票的最佳时机"><a href="#买卖股票的最佳时机" class="headerlink" title="买卖股票的最佳时机"></a><strong><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/">买卖股票的最佳时机</a></strong></h2><p>单笔交易的最大利润</p>
+<h3 id="DP-7"><a href="#DP-7" class="headerlink" title="DP"></a>DP</h3><p>用二维数组<code>dp</code>储存持有股票和非持有股票两种状态下的最大利润，</p>
+<ul>
+<li><p><code>dp[i][0]</code>表示当前不持有股票的最大利润，可得<code>dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i])</code>，即继续保持前一天不持股的最大利润，或者是将前一天的股票卖出得今天的最大利润</p>
+</li>
+<li><p><code>dp[i][1]</code>表示当前持有股票的最大利润，可得<code>dp[i][1] = max(dp[i - 1][1], -prices[i])</code>，即继续保持前一天持股或持当天股的最大值，也就是保持最低买入股价</p>
+</li>
+<li><p>根据状态转移方程将<code>dp[0][0] = 0, dp[0][1] = -price[0]</code>作为初始值</p>
+</li>
+</ul>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n][2];</span><br><span class="line">        memset(dp, 0, sizeof dp);</span><br><span class="line">        dp[0][0] = 0, dp[0][1] = -prices[0];</span><br><span class="line">        for(int i = 1; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i]);</span><br><span class="line">            dp[i][1] = max(dp[i - 1][1], - prices[i]);</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n - 1][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h3 id="优化DP"><a href="#优化DP" class="headerlink" title="优化DP"></a>优化DP</h3><p>两种状态更新过程中，只需要<code>dp[i - 1][0]</code>和<code>dp[i - 1][1]</code>两个值，那么即可用两个变量代替二维数组</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int f0 = 0, f1 = -prices[0];</span><br><span class="line">        for(const auto&amp; price : prices)</span><br><span class="line">        &#123;</span><br><span class="line">        	f1 = max(f1, -price);</span><br><span class="line">        	f0 = max(f0, f1 + price);</span><br><span class="line">        &#125;</span><br><span class="line">        return f0;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h2 id="买卖股票的最佳时机-II"><a href="#买卖股票的最佳时机-II" class="headerlink" title="### 买卖股票的最佳时机 II"></a>### <a target="_blank" rel="noopener" href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/">买卖股票的最佳时机 II</a></h2><p>多笔交易的最大利润</p>
+<h3 id="DP-8"><a href="#DP-8" class="headerlink" title="DP"></a>DP</h3><p>用二维数组<code>dp</code>储存持有股票和非持有股票两种状态下的最大利润</p>
+<ul>
+<li><p><code>dp[i][0]</code>表示当前不持有股票的最大利润，可得<code>dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i])</code>，即继续保持前一天不持股的最大利润，或者是将前一天的股票卖出得今天的最大利润</p>
+</li>
+<li><p><code>dp[i][1]</code>表示当前持有股票的最大利润，可得<code>dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] - prices[i])</code>，即继续保持前一天持股，或者将前一天持的股卖出获得利润，同一天入股的最大利润</p>
+</li>
+<li><p>根据状态转移方程将<code>dp[0][0] = 0, dp[0][1] = -price[0]</code>作为初始值</p>
+</li>
+</ul>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n][2];</span><br><span class="line">        memset(dp, 0, sizeof dp);</span><br><span class="line">        dp[0][0] = 0, dp[0][1] = -prices[0];</span><br><span class="line">        for(int i = 1; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i]);</span><br><span class="line">            dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] - prices[i]);</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n - 1][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h3 id="优化DP-1"><a href="#优化DP-1" class="headerlink" title="优化DP"></a>优化DP</h3><p>同样地，在更新过程中只用到了<code>dp[i - 1][0]</code>和<code>dp[i - 1][1]</code>两个值，用两个变量代替二维数组，另外还需要一个变量保存中间值</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        f0 = 0, f1 = -prices[0], tmp = 0;</span><br><span class="line">        for(const auto &amp; price : prices)</span><br><span class="line">        &#123;</span><br><span class="line">        	tmp = f0;</span><br><span class="line">        	f0 = max(f0, f1 + price);</span><br><span class="line">        	f1 = max(f1, tmp - price);</span><br><span class="line">        &#125;</span><br><span class="line">        return f0;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h3 id="贪心解法"><a href="#贪心解法" class="headerlink" title="贪心解法"></a>贪心解法</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int res = 0;</span><br><span class="line">        for(int i = 0; i &lt; n - 1; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            if(prices[i + 1] &gt; prices[i])</span><br><span class="line">                res += prices[i + 1] - prices[i];</span><br><span class="line">        &#125;</span><br><span class="line">        return res;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h2 id="买卖股票的最佳时机含冷冻期"><a href="#买卖股票的最佳时机含冷冻期" class="headerlink" title="买卖股票的最佳时机含冷冻期"></a><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/">买卖股票的最佳时机含冷冻期</a></h2><p>卖出股票后不能在第二天买入股票</p>
+<h3 id="DP-9"><a href="#DP-9" class="headerlink" title="DP"></a>DP</h3><p>用二维数组<code>dp</code>储存持有股票和非持有股票两种状态下的最大利润</p>
+<ul>
+<li><p><code>dp[i][0]</code>表示当前不持有股票的最大利润，可得<code>dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i])</code>，即继续保持前一天不持股的最大利润，或者是将前一天的股票卖出得今天的最大利润</p>
+</li>
+<li><p><code>dp[i][1]</code>表示当前持有股票的最大利润，由题意有一天的冷冻期可得<code>dp[i][1] = max(dp[i - 1][1], dp[i - 2][0] - prices[i])</code>，即继续保持前一天持股，或者将两天前持的股卖出获得利润，然后在当天入股的最大利润</p>
+</li>
+<li><p>根据状态转移方程将<code>dp[0][0] = 0, dp[0][1] = -price[0]</code>作为初始值</p>
+</li>
+</ul>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br></pre></td><td class="code"><pre><span class="line">/*BUGGY*/</span><br><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n][2];</span><br><span class="line">        memset(dp, 0, sizeof dp);</span><br><span class="line">        dp[0][0] = 0, dp[0][1] = -prices[0];</span><br><span class="line">        for (int i = 1; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i]);</span><br><span class="line">            if (i - 2 &gt;= 0)</span><br><span class="line">                dp[i][1] = max(dp[i - 1][1], dp[i - 2][0] - prices[i]);</span><br><span class="line">            else</span><br><span class="line">                dp[i][1] = dp[i - 1][1];</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n - 1][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<p>在考虑一个长度为3的数组作输入时，如[2, 1, 4]，初始值被设为第一天的利润，当i&#x3D;1时并没有更新，显然不合理，对此，可以将else 语句改为<code>dp[i][1] = max(dp[i - 1][1], prices[i])</code>；另外，也可以不增加额外的判断语句，将二维数组长度更改为<code>dp[n + 1][2]</code>或者<code>dp[n + 2][2]</code></p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br></pre></td><td class="code"><pre><span class="line">-----dp[n+1][2]-----</span><br><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n + 1][2];</span><br><span class="line">        memset(dp, 0, sizeof dp);</span><br><span class="line">        dp[0][0] = 0, dp[0][1] = -prices[0];</span><br><span class="line">        for (int i = 0; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            dp[i + 1][0] = max(dp[i][0], dp[i][1] + prices[i]);</span><br><span class="line">            if(i - 1 &gt;= 0)</span><br><span class="line">                dp[i + 1][1] = max(dp[i][1], dp[i - 1][0] - prices[i]);</span><br><span class="line">            else</span><br><span class="line">                dp[i + 1][1] = dp[i][1];</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br><span class="line"></span><br><span class="line">-----dp[n+2][2]-----</span><br><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n + 2][2];</span><br><span class="line">        memset(dp, 0, sizeof dp);</span><br><span class="line">        dp[0][0] = 0, dp[1][1] = -prices[0];</span><br><span class="line">        for (int i = 0; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            dp[i + 2][0] = max(dp[i + 1][0], dp[i + 1][1] + prices[i]);</span><br><span class="line">            dp[i + 2][1] = max(dp[i + 1][1], dp[i][0] - prices[i]);</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n + 1][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h3 id="优化DP-2"><a href="#优化DP-2" class="headerlink" title="优化DP"></a>优化DP</h3><p>可以观察到，更新二维数组时，只用到<code>dp[i - 1][0]</code>,<code>dp[i - 1][1]</code>和<code>dp[i - 2][0]</code>三个值，即可以用三个变量代替二维数组</p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int f0 = 0, f1 = -prices[0], last = 0, tmp = 0, second = 0;</span><br><span class="line">        for (const auto&amp; price : prices)</span><br><span class="line">        &#123;</span><br><span class="line">            tmp = f0;</span><br><span class="line">            f0 = max(f0, f1 + price);</span><br><span class="line">            f1 = max(f1, second - price);</span><br><span class="line">            second = last;</span><br><span class="line">            last = f0;</span><br><span class="line">        &#125;</span><br><span class="line">        return f0;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h2 id="买卖股票的最佳时机含手续费"><a href="#买卖股票的最佳时机含手续费" class="headerlink" title="买卖股票的最佳时机含手续费"></a><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/">买卖股票的最佳时机含手续费</a></h2><p>无限制次数交易，但每笔交易需要手续费，是买卖股票的最佳时机II的变形题</p>
+<h3 id="DP-10"><a href="#DP-10" class="headerlink" title="DP"></a><strong>DP</strong></h3><p>用二维数组<code>dp</code>储存持有股票和非持有股票两种状态下的最大利润</p>
+<ul>
+<li><p><code>dp[i][0]</code>表示当前不持有股票的最大利润，可得<code>dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i])</code>，即继续保持前一天不持股的最大利润，或者是将前一天的股票卖出得今天的最大利润</p>
+</li>
+<li><p><code>dp[i][1]</code>表示当前持有股票的最大利润，可得<code>dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] - prices[i])</code>，即继续保持前一天持股，或者将前一天持的股卖出获得利润，当天入股的最大利润</p>
+</li>
+<li><p>根据状态转移方程将<code>dp[0][0] = 0, dp[0][1] = -price[0]</code>作为初始值</p>
+</li>
+</ul>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices, int fee) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n][2];</span><br><span class="line">        memset(dp, 0, sizeof dp);</span><br><span class="line">        dp[0][0] = 0, dp[0][1] = -prices[0];</span><br><span class="line">        for(int i = 1; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i] - fee);</span><br><span class="line">            dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] - prices[i]);</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n - 1][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+
+
+<h2 id="买卖股票的最佳时机-IV"><a href="#买卖股票的最佳时机-IV" class="headerlink" title="买卖股票的最佳时机 IV"></a><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iv/">买卖股票的最佳时机 IV</a></h2><p>最多完成k笔交易，需要增加一种状态表示交易数</p>
+<h3 id="DFS递归-记忆化"><a href="#DFS递归-记忆化" class="headerlink" title="DFS递归+记忆化"></a>DFS递归+记忆化</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(int k, vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int memo[n+1][k+2][2];</span><br><span class="line">        memset(memo, -1, sizeof memo);</span><br><span class="line"></span><br><span class="line">        function&lt;int (int, int, bool)&gt; dfs = [&amp;](int i, int j, bool flag)-&gt; int&#123;</span><br><span class="line">            if(j &lt; 0) // 交易次数为负，返回INT_MIN</span><br><span class="line">                return INT_MIN;</span><br><span class="line">            if(i &lt; 0) // 初始化时并没有利润，返回INT_MIN或0</span><br><span class="line">                return flag ? INT_MIN : 0;</span><br><span class="line">            if(memo[i][j][flag] != -1)</span><br><span class="line">                return memo[i][j][flag];</span><br><span class="line">            if(flag) // 持有股票</span><br><span class="line">            &#123;</span><br><span class="line">                memo[i][j][flag] = max(dfs(i - 1, j, 1), dfs(i - 1, j, 0) - prices[i]);</span><br><span class="line">                return memo[i][j][flag];</span><br><span class="line">            &#125;</span><br><span class="line">            memo[i][j][flag] = max(dfs(i - 1, j, 0), dfs(i - 1, j - 1, 1) + prices[i]);</span><br><span class="line">            return memo[i][j][flag];</span><br><span class="line">        &#125;;</span><br><span class="line"></span><br><span class="line">        return dfs(n - 1, k, 0);</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br><span class="line"></span><br></pre></td></tr></table></figure>
+
+<p>递归结束条件：交易次数不足 或 遍历完所有天数的股票，前者返回负无穷，后者返回0或负无穷作为从头开始搜索的初始条件——不持股票状态下，最大利润为0；持股票时，最大利润为负无穷</p>
+<h3 id="DP-11"><a href="#DP-11" class="headerlink" title="DP"></a><strong>DP</strong></h3><p>用三维数组<code>dp</code>储存持股和交易次数两大类状态下的最大利润</p>
+<ul>
+<li><p><code>dp[i][j][0]</code>表示当前<strong>不持有股票</strong>，<strong>交易次数为j (j &lt;&#x3D; k)<strong>时的最大利润，可得<code>dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j - 1][1] + prices[i])</code>，即继续保持前一天的最大利润，</strong>不持股也不交易</strong>，或者是<strong>在前一天持股，当天卖出状态下</strong>的最大利润</p>
+</li>
+<li><p><code>dp[i][j][1]</code>表示当前**持有股票，交易次数为j (j &lt;&#x3D; k)**的最大利润，可得<code>dp[i][j][1] = max(dp[i - 1][j][1], dp[i - 1][j][0] - prices[i])</code>，即继续保持前一天持股不交易，或者**在前一天不持股，当天购入状态下的最大利润**。<u>统一将卖出股票时才算交易完成，交易次数+1</u></p>
+</li>
+<li><p>根据状态转移方程，三维数组元素初始化为大负数（由题目数据量可知&lt;1000），再将<code>dp[0][j][0] = 0</code>作为初始值</p>
+</li>
+</ul>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(int k, vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n + 1][k + 2][2]; // [-1, k] 避免 k = -1 情况，整体右移； i同理</span><br><span class="line">        memset(dp, -0x7f, sizeof dp);// 全都初始化为INT_MIN</span><br><span class="line">        // fill_n(dp, (n+1)*2*(k+2), INT_MIN); </span><br><span class="line">        for(int j = 0; j &lt; k + 2; j++) // 在交易次数为0且不持股时，最大利润初始化为0</span><br><span class="line">        // &#123;</span><br><span class="line">            // dp[1][j][0] = 0;</span><br><span class="line">            // dp[1][j][1] = -prices[0];</span><br><span class="line">        // &#125;</span><br><span class="line">            dp[0][j][0] = 0;</span><br><span class="line">        // dp[0][j][1]? ---&gt; 需要 i 从 0 开始遍历</span><br><span class="line">        for(int i = 0; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            for(int j = 1; j &lt; k + 2; j++)</span><br><span class="line">            &#123;</span><br><span class="line">                dp[i + 1][j][0] = max(dp[i][j][0], dp[i][j - 1][1] + prices[i]);</span><br><span class="line">                dp[i + 1][j][1] = max(dp[i][j][1], dp[i][j][0] - prices[i]);</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n][k + 1][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<p>由DFS翻译成递推，可得初始条件为<code>dp[0][j][0] = 0, dp[0][j][1] = -prices[0]</code>，可以从<code>i=1</code>开始遍历而不是<code>i=0</code></p>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(int k, vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n + 1][k + 2][2]; // [-1, k] 避免 k = -1 情况，整体右移； i同理</span><br><span class="line">        memset(dp, -0x7f, sizeof dp);// 全都初始化为INT_MIN</span><br><span class="line">        // fill_n(dp, (n+1)*2*(k+2), INT_MIN); </span><br><span class="line">        for(int j = 0; j &lt; k + 2; j++) // 在交易次数为0且不持股时，最大利润初始化为0</span><br><span class="line">        &#123;</span><br><span class="line">            dp[0][j][0] = 0;</span><br><span class="line">            dp[0][j][1] = -prices[0];</span><br><span class="line">        &#125;</span><br><span class="line">            // dp[0][j][0] = 0;</span><br><span class="line">        // dp[0][j][1]? ---&gt; 需要 i 从 0 开始遍历</span><br><span class="line">        for(int i = 1; i &lt;= n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            for(int j = 1; j &lt; k + 2; j++)</span><br><span class="line">            &#123;</span><br><span class="line">                dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j - 1][1] + prices[i - 1]);</span><br><span class="line">                dp[i][j][1] = max(dp[i - 1][j][1], dp[i - 1][j][0] - prices[i - 1]);</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n][k + 1][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h2 id="买卖股票的最佳时机-III"><a href="#买卖股票的最佳时机-III" class="headerlink" title="买卖股票的最佳时机 III"></a><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iii/">买卖股票的最佳时机 III</a></h2><p>最多完成两笔交易，固定数组第三维为3，表示交易的次数</p>
+<h3 id="DP-12"><a href="#DP-12" class="headerlink" title="DP"></a><strong>DP</strong></h3><p>用三维数组<code>dp</code>储存持股和交易次数两大类状态下的最大利润</p>
+<ul>
+<li><p><code>dp[i][j][0]</code>表示当前<strong>不持有股票</strong>，<strong>交易次数为j (j &lt;&#x3D; 2)<strong>时的最大利润，可得<code>dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j - 1][1] + prices[i])</code>，即继续保持前一天的最大利润，</strong>不持股也不交易</strong>，或者是<strong>在前一天持股，当天卖出状态下</strong>的最大利润</p>
+</li>
+<li><p><code>dp[i][j][1]</code>表示当前**持有股票，交易次数为j (j &lt;&#x3D; 2)**的最大利润，可得<code>dp[i][j][1] = max(dp[i - 1][j][1], dp[i - 1][j][0] - prices[i])</code>，即继续保持前一天持股不交易，或者**在前一天不持股，当天购入状态下的最大利润**。<u>统一将卖出股票时才算交易完成，交易次数+1</u></p>
+</li>
+<li><p>根据状态转移方程，三维数组元素初始化为大负数（由题目数据量可知&lt;100000），再将<code>dp[0][j][0] = 0</code>作为初始值</p>
+</li>
+</ul>
+<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br></pre></td><td class="code"><pre><span class="line">class Solution &#123;</span><br><span class="line">public:</span><br><span class="line">    int maxProfit(vector&lt;int&gt;&amp; prices) &#123;</span><br><span class="line">        int n = prices.size();</span><br><span class="line">        int dp[n + 1][4][2]; // [-1, k] 避免 k = -1 情况，整体右移； i同理</span><br><span class="line">        memset(dp, -0x7f, sizeof dp);// 全都初始化为INT_MIN</span><br><span class="line">        // fill_n(dp, (n+1)*2*(k+2), INT_MIN); </span><br><span class="line">        for(int j = 0; j &lt; 4; j++) // 在交易次数为0且不持股时，最大利润初始化为0</span><br><span class="line">        // &#123;</span><br><span class="line">            // dp[1][j][0] = 0;</span><br><span class="line">            // dp[1][j][1] = -prices[0];</span><br><span class="line">        // &#125;</span><br><span class="line">            dp[0][j][0] = 0;</span><br><span class="line">        // dp[0][j][1]? ---&gt; 需要 i 从 0 开始遍历</span><br><span class="line">        for(int i = 0; i &lt; n; i++)</span><br><span class="line">        &#123;</span><br><span class="line">            for(int j = 1; j &lt; 4; j++)</span><br><span class="line">            &#123;</span><br><span class="line">                dp[i + 1][j][0] = max(dp[i][j][0], dp[i][j - 1][1] + prices[i]);</span><br><span class="line">                dp[i + 1][j][1] = max(dp[i][j][1], dp[i][j][0] - prices[i]);</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line">        return dp[n][3][0];</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+
       
     </div>
 
@@ -4485,7 +4826,7 @@ <h2 class="post-title" itemprop="name headline">
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/tags/notes/index.html b/tags/notes/index.html
index 79f4d46..0d49419 100644
--- a/tags/notes/index.html
+++ b/tags/notes/index.html
@@ -114,7 +114,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -189,7 +189,7 @@ <h1 class="collection-header">notes
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>
diff --git a/tags/plan/index.html b/tags/plan/index.html
index 4769b30..83b5792 100644
--- a/tags/plan/index.html
+++ b/tags/plan/index.html
@@ -114,7 +114,7 @@
   <nav class="site-state">
       <div class="site-state-item site-state-posts">
         <a href="/archives/">
-          <span class="site-state-item-count">17</span>
+          <span class="site-state-item-count">19</span>
           <span class="site-state-item-name">日志</span>
         </a>
       </div>
@@ -189,7 +189,7 @@ <h1 class="collection-header">plan
 
 <div class="copyright">
   &copy; 
-  <span itemprop="copyrightYear">2023</span>
+  <span itemprop="copyrightYear">2024</span>
   <span class="with-love">
     <i class="fa fa-heart"></i>
   </span>