diff --git a/README.md b/README.md
index 102364b45..4353c362e 100644
--- a/README.md
+++ b/README.md
@@ -4,42 +4,42 @@
     
 - [1004.Maximum continuity1Number III Maximum continuity1Number III](https://longsizhuo.github.io/post/ed19b576.html)
 - [1017. Negative binary conversion](https://longsizhuo.github.io/post/dce95dce.html)
-- [1124. The longest period of performance One question daily](https://longsizhuo.github.io/post/a5d1dfda.html)
 - [1017.Negative binary conversion](https://longsizhuo.github.io/post/80cafdc8.html)
+- [1124. The longest period of performance One question daily](https://longsizhuo.github.io/post/a5d1dfda.html)
 - [1138. The path on the letter board One question daily](https://longsizhuo.github.io/post/fd471847.html)
-- [1233Delete the subfolder folder One question daily](https://longsizhuo.github.io/post/6610c769.html)
 - [1139. The greatest 1 Formation of the border  One question daily](https://longsizhuo.github.io/post/eb193c1f.html)
+- [1233Delete the subfolder folder One question daily](https://longsizhuo.github.io/post/6610c769.html)
 - [1234. Replace the sub -string to get a balanced string One question daily](https://longsizhuo.github.io/post/56d97dcf.html)
 - [1237. Find out the positive combination of the given square  One question daily](https://longsizhuo.github.io/post/14b94db7.html)
 - [1250. examine「Good array」 One question daily](https://longsizhuo.github.io/post/435a9a0d.html)
-- [142.Ring linkedII](https://longsizhuo.github.io/post/e2c9cca9.html)
 - [1551. Make all the minimum operations of all elements in the array](https://longsizhuo.github.io/post/b2a927d5.html)
+- [142.Ring linkedII](https://longsizhuo.github.io/post/e2c9cca9.html)
 - [1590.Make the array and energyPDivide](https://longsizhuo.github.io/post/59825e1f.html)
 - [1604Warn alert person who uses the same employee card within one hour One question daily](https://longsizhuo.github.io/post/bb7bcf54.html)
 - [1653. The minimum number of times to balance the string balance](https://longsizhuo.github.io/post/cac21f27.html)
 - [1663. The smallest string with a given value One question daily](https://longsizhuo.github.io/post/4d7252f8.html)
+- [1664. Number of schemes to generate balance numbers One question daily](https://longsizhuo.github.io/post/1978f474.html)
 - [1669. Merge two linked watches One question daily](https://longsizhuo.github.io/post/d482ac75.html)
 - [1798You can construct the maximum number of continuity One question daily](https://longsizhuo.github.io/post/3667cd44.html)
 - [1801-1803 Liech buckle novice！](https://longsizhuo.github.io/post/2f3e8e26.html)
-- [1664. Number of schemes to generate balance numbers One question daily](https://longsizhuo.github.io/post/1978f474.html)
 - [1813. Sentence similarity III](https://longsizhuo.github.io/post/69c2a1dd.html)
 - [1814. Statistics the number of good pairs in an array One question daily](https://longsizhuo.github.io/post/ceb1e67f.html)
 - [1817. Find the number of users of users active One question daily](https://longsizhuo.github.io/post/d0a9337b.html)
 - [1819.Different numbers in the sequence](https://longsizhuo.github.io/post/de522cea.html)
 - [1825. Seek out MK average value](https://longsizhuo.github.io/post/6be57ef7.html)
-- [1828. Statistics the number of a circle mid -point One question daily](https://longsizhuo.github.io/post/3277549c.html)
 - [1825. Seek out MK average value](https://longsizhuo.github.io/post/6be57ef7.html)
+- [1828. Statistics the number of a circle mid -point One question daily](https://longsizhuo.github.io/post/3277549c.html)
 - [19.Delete the countdown of the linked listNNode](https://longsizhuo.github.io/post/c916b663.html)
 - [PythonCoincidence，Random algorithmO(nlogn)Push](https://longsizhuo.github.io/post/a1d26db4.html)
 - [2085. Public string that has occurred once](https://longsizhuo.github.io/post/bbe4bff6.html)
 - [209.Small length array](https://longsizhuo.github.io/post/e6227611.html)
 - [217. Existing duplicate elements C++/Python3](https://longsizhuo.github.io/post/717042a6.html)
 - [217. Existing duplicate elements C++/Python3](https://longsizhuo.github.io/post/717042a6.html)
+- [219.Existing duplicate elements II Hash table graphics](https://longsizhuo.github.io/post/16b0e9f1.html)
 - [221Maximum square](https://longsizhuo.github.io/post/e03edda.html)
 - [One question daily 2283](https://longsizhuo.github.io/post/c3f7f59f.html)
-- [219.Existing duplicate elements II Hash table graphics](https://longsizhuo.github.io/post/16b0e9f1.html)
-- [One question daily 2299. Code inspection device II](https://longsizhuo.github.io/post/7ded25bb.html)
 - [One question daily 2293. Great mini game](https://longsizhuo.github.io/post/9df6242c.html)
+- [One question daily 2299. Code inspection device II](https://longsizhuo.github.io/post/7ded25bb.html)
 - [2303. Calculate the total taxable amount](https://longsizhuo.github.io/post/11597f8b.html)
 - [2309. The best English letters with both appropriates and lowercases One question daily](https://longsizhuo.github.io/post/b4953d62.html)
 - [2315. Statistical star number One question daily](https://longsizhuo.github.io/post/dc8d7590.html)
@@ -74,11 +74,11 @@
 - [76Minimum cover string](https://longsizhuo.github.io/post/ae10d3c1.html)
 - [Python beat98.40% collectionsofCounter method！](https://longsizhuo.github.io/post/73b5ce9c.html)
 - [9021_TUT_1](https://longsizhuo.github.io/post/ac786f6f.html)
-- [9021_TUT_2](https://longsizhuo.github.io/post/becdc081.html)
-- [977.Orderly array square](https://longsizhuo.github.io/post/a386fcdc.html)
 - [964E](https://longsizhuo.github.io/post/2280b647.html)
+- [977.Orderly array square](https://longsizhuo.github.io/post/a386fcdc.html)
 - [994.Rotten orange](https://longsizhuo.github.io/post/56e64fdd.html)
 - [Sword finger Offer 43. 1～n Integer 1 Number of times](https://longsizhuo.github.io/post/f0d96a1f.html)
+- [9021_TUT_2](https://longsizhuo.github.io/post/becdc081.html)
 - [121.The best time for buying and selling stocks](https://longsizhuo.github.io/post/3a21fe32.html)
 - [1222.Can attack the queen of the king](https://longsizhuo.github.io/post/a6577367.html)
 - [122.The best time for buying and selling stocksII](https://longsizhuo.github.io/post/a75da5a.html)
@@ -100,9 +100,9 @@
 - [LCP 50.Gem supply](https://longsizhuo.github.io/post/762ca698.html)
 - [brief_alternate Assignment](https://longsizhuo.github.io/post/dbbd7d58.html)
 - [GOlanguage# GOlanguage可爱捏](https://longsizhuo.github.io/post/67fc8613.html)
-- [Top of an article](https://longsizhuo.github.io/post/edc2b94.html)
 - [Inline expansion](https://longsizhuo.github.io/post/2660e935.html)
 - [Some doubt](https://longsizhuo.github.io/post/941aeb72.html)
+- [Top of an article](https://longsizhuo.github.io/post/edc2b94.html)
 - [math](https://longsizhuo.github.io/post/a927044d.html)
 - [Sword finger Offer 68 - II. The recent public ancestor of the binary tree](https://longsizhuo.github.io/post/36f314aa.html)
 - [Sword finger Offer II 021. Delete the countdown of the linked list n Node](https://longsizhuo.github.io/post/3ed2f01c.html)
diff --git a/archives/2022/12/index.html b/archives/2022/12/index.html
index 1b4210cc6..15212ed2b 100644
--- a/archives/2022/12/index.html
+++ b/archives/2022/12/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2022/index.html b/archives/2022/index.html
index 3696f07d7..b6ce05b9a 100644
--- a/archives/2022/index.html
+++ b/archives/2022/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2023/12/index.html b/archives/2023/12/index.html
index c8a826863..4b5a8e6ae 100644
--- a/archives/2023/12/index.html
+++ b/archives/2023/12/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2023/index.html b/archives/2023/index.html
index f61844031..11d9ab89a 100644
--- a/archives/2023/index.html
+++ b/archives/2023/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/index.html b/archives/2024/01/index.html
index 790a9351a..c594cffdb 100644
--- a/archives/2024/01/index.html
+++ b/archives/2024/01/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/10/index.html b/archives/2024/01/page/10/index.html
index 71494a137..4f7696c31 100644
--- a/archives/2024/01/page/10/index.html
+++ b/archives/2024/01/page/10/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/e2c9cca9.html" class="archive-article-date">
+	      	<a href="/post/b2a927d5.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/e2c9cca9.html">142.Ring linkedII</a>
+      <a class="archive-article-title" href="/post/b2a927d5.html">1551. Make all the minimum operations of all elements in the array</a>
     </h2>
   
 
@@ -346,6 +346,10 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
+        		</li>
       		
 		</ul>
 	</div>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/11/index.html b/archives/2024/01/page/11/index.html
index 0ff0b1964..5d115a048 100644
--- a/archives/2024/01/page/11/index.html
+++ b/archives/2024/01/page/11/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/b2a927d5.html" class="archive-article-date">
+	      	<a href="/post/e2c9cca9.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/b2a927d5.html">1551. Make all the minimum operations of all elements in the array</a>
+      <a class="archive-article-title" href="/post/e2c9cca9.html">142.Ring linkedII</a>
     </h2>
   
 
@@ -346,10 +346,6 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
-        		</li>
       		
 		</ul>
 	</div>
@@ -422,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/12/index.html b/archives/2024/01/page/12/index.html
index 2ed5d0059..0d3bde46e 100644
--- a/archives/2024/01/page/12/index.html
+++ b/archives/2024/01/page/12/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/13/index.html b/archives/2024/01/page/13/index.html
index 7903967ed..14fa13af8 100644
--- a/archives/2024/01/page/13/index.html
+++ b/archives/2024/01/page/13/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/14/index.html b/archives/2024/01/page/14/index.html
index 35194f335..5b2376f92 100644
--- a/archives/2024/01/page/14/index.html
+++ b/archives/2024/01/page/14/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/15/index.html b/archives/2024/01/page/15/index.html
index 0fc5950b9..4a33fb36c 100644
--- a/archives/2024/01/page/15/index.html
+++ b/archives/2024/01/page/15/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/16/index.html b/archives/2024/01/page/16/index.html
index 800048e3f..e00cf3105 100644
--- a/archives/2024/01/page/16/index.html
+++ b/archives/2024/01/page/16/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/d482ac75.html" class="archive-article-date">
+	      	<a href="/post/1978f474.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/d482ac75.html">1669. Merge two linked watches One question daily</a>
+      <a class="archive-article-title" href="/post/1978f474.html">1664. Number of schemes to generate balance numbers One question daily</a>
     </h2>
   
 
@@ -352,7 +352,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Linked</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
         		</li>
       		
 		</ul>
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/17/index.html b/archives/2024/01/page/17/index.html
index 7fae1cf0d..68c02145e 100644
--- a/archives/2024/01/page/17/index.html
+++ b/archives/2024/01/page/17/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/3667cd44.html" class="archive-article-date">
+	      	<a href="/post/d482ac75.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/3667cd44.html">1798You can construct the maximum number of continuity One question daily</a>
+      <a class="archive-article-title" href="/post/d482ac75.html">1669. Merge two linked watches One question daily</a>
     </h2>
   
 
@@ -348,7 +348,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">One question daily</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Linked</a>
         		</li>
       		
 		</ul>
@@ -422,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/18/index.html b/archives/2024/01/page/18/index.html
index 98826551f..ecc1735f6 100644
--- a/archives/2024/01/page/18/index.html
+++ b/archives/2024/01/page/18/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/2f3e8e26.html" class="archive-article-date">
+	      	<a href="/post/3667cd44.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/2f3e8e26.html">1801-1803 Liech buckle novice！</a>
+      <a class="archive-article-title" href="/post/3667cd44.html">1798You can construct the maximum number of continuity One question daily</a>
     </h2>
   
 
@@ -344,7 +344,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/19/index.html b/archives/2024/01/page/19/index.html
index dd4c686db..18c9da36d 100644
--- a/archives/2024/01/page/19/index.html
+++ b/archives/2024/01/page/19/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/1978f474.html" class="archive-article-date">
+	      	<a href="/post/2f3e8e26.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/1978f474.html">1664. Number of schemes to generate balance numbers One question daily</a>
+      <a class="archive-article-title" href="/post/2f3e8e26.html">1801-1803 Liech buckle novice！</a>
     </h2>
   
 
@@ -344,15 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">One question daily</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -426,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/2/index.html b/archives/2024/01/page/2/index.html
index 19583a750..ab34b3160 100644
--- a/archives/2024/01/page/2/index.html
+++ b/archives/2024/01/page/2/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/a5d1dfda.html" class="archive-article-date">
+	      	<a href="/post/80cafdc8.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/a5d1dfda.html">1124. The longest period of performance One question daily</a>
+      <a class="archive-article-title" href="/post/80cafdc8.html">1017.Negative binary conversion</a>
     </h2>
   
 
@@ -346,10 +346,6 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
-        		</li>
       		
 		</ul>
 	</div>
@@ -422,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/20/index.html b/archives/2024/01/page/20/index.html
index 22bf93107..363b77ade 100644
--- a/archives/2024/01/page/20/index.html
+++ b/archives/2024/01/page/20/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/21/index.html b/archives/2024/01/page/21/index.html
index 07b8a14aa..076ad2d10 100644
--- a/archives/2024/01/page/21/index.html
+++ b/archives/2024/01/page/21/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/22/index.html b/archives/2024/01/page/22/index.html
index 121158338..78da01a64 100644
--- a/archives/2024/01/page/22/index.html
+++ b/archives/2024/01/page/22/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/23/index.html b/archives/2024/01/page/23/index.html
index 817a520c7..208bbcf8c 100644
--- a/archives/2024/01/page/23/index.html
+++ b/archives/2024/01/page/23/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/24/index.html b/archives/2024/01/page/24/index.html
index c12f20035..967f3fea5 100644
--- a/archives/2024/01/page/24/index.html
+++ b/archives/2024/01/page/24/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/25/index.html b/archives/2024/01/page/25/index.html
index 2276642e0..9404d6502 100644
--- a/archives/2024/01/page/25/index.html
+++ b/archives/2024/01/page/25/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/3277549c.html" class="archive-article-date">
+	      	<a href="/post/6be57ef7.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/3277549c.html">1828. Statistics the number of a circle mid -point One question daily</a>
+      <a class="archive-article-title" href="/post/6be57ef7.html">1825. Seek out MK average value</a>
     </h2>
   
 
@@ -344,11 +344,15 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">unsolved</a>
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">difficulty</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color3">Multiple set</a>
         		</li>
       		
 		</ul>
@@ -422,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/26/index.html b/archives/2024/01/page/26/index.html
index 6707382cc..940a5a700 100644
--- a/archives/2024/01/page/26/index.html
+++ b/archives/2024/01/page/26/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/6be57ef7.html" class="archive-article-date">
+	      	<a href="/post/3277549c.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/6be57ef7.html">1825. Seek out MK average value</a>
+      <a class="archive-article-title" href="/post/3277549c.html">1828. Statistics the number of a circle mid -point One question daily</a>
     </h2>
   
 
@@ -344,15 +344,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">unsolved</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">difficulty</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color3">Multiple set</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
         		</li>
       		
 		</ul>
@@ -426,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/27/index.html b/archives/2024/01/page/27/index.html
index d99658571..d7aee3e87 100644
--- a/archives/2024/01/page/27/index.html
+++ b/archives/2024/01/page/27/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/28/index.html b/archives/2024/01/page/28/index.html
index 96454ddd6..f2a382de5 100644
--- a/archives/2024/01/page/28/index.html
+++ b/archives/2024/01/page/28/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/29/index.html b/archives/2024/01/page/29/index.html
index fb72a6bf5..6a731675c 100644
--- a/archives/2024/01/page/29/index.html
+++ b/archives/2024/01/page/29/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/3/index.html b/archives/2024/01/page/3/index.html
index 90162e5fe..872987fbb 100644
--- a/archives/2024/01/page/3/index.html
+++ b/archives/2024/01/page/3/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/80cafdc8.html" class="archive-article-date">
+	      	<a href="/post/a5d1dfda.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/80cafdc8.html">1017.Negative binary conversion</a>
+      <a class="archive-article-title" href="/post/a5d1dfda.html">1124. The longest period of performance One question daily</a>
     </h2>
   
 
@@ -346,6 +346,10 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
+        		</li>
       		
 		</ul>
 	</div>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/30/index.html b/archives/2024/01/page/30/index.html
index 0ff422987..28a2ace8c 100644
--- a/archives/2024/01/page/30/index.html
+++ b/archives/2024/01/page/30/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/31/index.html b/archives/2024/01/page/31/index.html
index 754ab9bfc..e983026ba 100644
--- a/archives/2024/01/page/31/index.html
+++ b/archives/2024/01/page/31/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/32/index.html b/archives/2024/01/page/32/index.html
index f6352db1d..1e17080cf 100644
--- a/archives/2024/01/page/32/index.html
+++ b/archives/2024/01/page/32/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/e03edda.html" class="archive-article-date">
+	      	<a href="/post/16b0e9f1.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/e03edda.html">221Maximum square</a>
+      <a class="archive-article-title" href="/post/16b0e9f1.html">219.Existing duplicate elements II Hash table graphics</a>
     </h2>
   
 
@@ -344,15 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">solved</a>
         		</li>
       		
 		</ul>
@@ -426,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/33/index.html b/archives/2024/01/page/33/index.html
index a79d1f3bd..99bd4209d 100644
--- a/archives/2024/01/page/33/index.html
+++ b/archives/2024/01/page/33/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/c3f7f59f.html" class="archive-article-date">
+	      	<a href="/post/e03edda.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/c3f7f59f.html">One question daily 2283</a>
+      <a class="archive-article-title" href="/post/e03edda.html">221Maximum square</a>
     </h2>
   
 
@@ -344,7 +344,15 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -418,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/34/index.html b/archives/2024/01/page/34/index.html
index 433080d2e..2cd530a8f 100644
--- a/archives/2024/01/page/34/index.html
+++ b/archives/2024/01/page/34/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/16b0e9f1.html" class="archive-article-date">
+	      	<a href="/post/c3f7f59f.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/16b0e9f1.html">219.Existing duplicate elements II Hash table graphics</a>
+      <a class="archive-article-title" href="/post/c3f7f59f.html">One question daily 2283</a>
     </h2>
   
 
@@ -344,7 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">solved</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/35/index.html b/archives/2024/01/page/35/index.html
index 40b651625..79c61145a 100644
--- a/archives/2024/01/page/35/index.html
+++ b/archives/2024/01/page/35/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/7ded25bb.html" class="archive-article-date">
+	      	<a href="/post/9df6242c.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/7ded25bb.html">One question daily 2299. Code inspection device II</a>
+      <a class="archive-article-title" href="/post/9df6242c.html">One question daily 2293. Great mini game</a>
     </h2>
   
 
@@ -344,11 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">Bit operation</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -422,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/36/index.html b/archives/2024/01/page/36/index.html
index f54f402b1..b43bd3e59 100644
--- a/archives/2024/01/page/36/index.html
+++ b/archives/2024/01/page/36/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/9df6242c.html" class="archive-article-date">
+	      	<a href="/post/7ded25bb.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/9df6242c.html">One question daily 2293. Great mini game</a>
+      <a class="archive-article-title" href="/post/7ded25bb.html">One question daily 2299. Code inspection device II</a>
     </h2>
   
 
@@ -344,7 +344,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">Bit operation</a>
         		</li>
       		
 		</ul>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/37/index.html b/archives/2024/01/page/37/index.html
index d514e72fa..efb9b1b0f 100644
--- a/archives/2024/01/page/37/index.html
+++ b/archives/2024/01/page/37/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/38/index.html b/archives/2024/01/page/38/index.html
index 5d06824b9..031660002 100644
--- a/archives/2024/01/page/38/index.html
+++ b/archives/2024/01/page/38/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/39/index.html b/archives/2024/01/page/39/index.html
index 732cda6a7..ef64799ab 100644
--- a/archives/2024/01/page/39/index.html
+++ b/archives/2024/01/page/39/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/4/index.html b/archives/2024/01/page/4/index.html
index fdb5a984a..c95793840 100644
--- a/archives/2024/01/page/4/index.html
+++ b/archives/2024/01/page/4/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/40/index.html b/archives/2024/01/page/40/index.html
index 9dd927ba0..e7c76b57d 100644
--- a/archives/2024/01/page/40/index.html
+++ b/archives/2024/01/page/40/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/41/index.html b/archives/2024/01/page/41/index.html
index 8adb58f6f..8aba47b71 100644
--- a/archives/2024/01/page/41/index.html
+++ b/archives/2024/01/page/41/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/42/index.html b/archives/2024/01/page/42/index.html
index 286a07667..fec88edcb 100644
--- a/archives/2024/01/page/42/index.html
+++ b/archives/2024/01/page/42/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/43/index.html b/archives/2024/01/page/43/index.html
index 33b8912fe..82bf67efa 100644
--- a/archives/2024/01/page/43/index.html
+++ b/archives/2024/01/page/43/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/44/index.html b/archives/2024/01/page/44/index.html
index 4d66deba6..eaf19d840 100644
--- a/archives/2024/01/page/44/index.html
+++ b/archives/2024/01/page/44/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/45/index.html b/archives/2024/01/page/45/index.html
index 39e12d288..734278b57 100644
--- a/archives/2024/01/page/45/index.html
+++ b/archives/2024/01/page/45/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/46/index.html b/archives/2024/01/page/46/index.html
index 2db2a7263..8cae707cc 100644
--- a/archives/2024/01/page/46/index.html
+++ b/archives/2024/01/page/46/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/47/index.html b/archives/2024/01/page/47/index.html
index 6e7032349..c7f9e1ca4 100644
--- a/archives/2024/01/page/47/index.html
+++ b/archives/2024/01/page/47/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/48/index.html b/archives/2024/01/page/48/index.html
index 6df973711..5a0a73be8 100644
--- a/archives/2024/01/page/48/index.html
+++ b/archives/2024/01/page/48/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/49/index.html b/archives/2024/01/page/49/index.html
index 457ea971a..90f691ecb 100644
--- a/archives/2024/01/page/49/index.html
+++ b/archives/2024/01/page/49/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/5/index.html b/archives/2024/01/page/5/index.html
index ff251009f..3da03f7e6 100644
--- a/archives/2024/01/page/5/index.html
+++ b/archives/2024/01/page/5/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/6610c769.html" class="archive-article-date">
+	      	<a href="/post/eb193c1f.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/6610c769.html">1233Delete the subfolder folder One question daily</a>
+      <a class="archive-article-title" href="/post/eb193c1f.html">1139. The greatest 1 Formation of the border  One question daily</a>
     </h2>
   
 
@@ -348,7 +348,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Dictionary tree</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
         		</li>
       		
 		</ul>
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/50/index.html b/archives/2024/01/page/50/index.html
index aa202f67a..e8c6f57ce 100644
--- a/archives/2024/01/page/50/index.html
+++ b/archives/2024/01/page/50/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/51/index.html b/archives/2024/01/page/51/index.html
index fc00e6f07..0b4b19b17 100644
--- a/archives/2024/01/page/51/index.html
+++ b/archives/2024/01/page/51/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/52/index.html b/archives/2024/01/page/52/index.html
index e5c477062..7221845d3 100644
--- a/archives/2024/01/page/52/index.html
+++ b/archives/2024/01/page/52/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/53/index.html b/archives/2024/01/page/53/index.html
index 1ac6bde50..0e82abe35 100644
--- a/archives/2024/01/page/53/index.html
+++ b/archives/2024/01/page/53/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/54/index.html b/archives/2024/01/page/54/index.html
index e73160691..ec2a912d9 100644
--- a/archives/2024/01/page/54/index.html
+++ b/archives/2024/01/page/54/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/55/index.html b/archives/2024/01/page/55/index.html
index 4256fff8d..706dc3244 100644
--- a/archives/2024/01/page/55/index.html
+++ b/archives/2024/01/page/55/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/56/index.html b/archives/2024/01/page/56/index.html
index eaa0e4df7..d3b459e8e 100644
--- a/archives/2024/01/page/56/index.html
+++ b/archives/2024/01/page/56/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/57/index.html b/archives/2024/01/page/57/index.html
index 513efd1b3..4910dd243 100644
--- a/archives/2024/01/page/57/index.html
+++ b/archives/2024/01/page/57/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/58/index.html b/archives/2024/01/page/58/index.html
index 97be9349d..9ff292cf5 100644
--- a/archives/2024/01/page/58/index.html
+++ b/archives/2024/01/page/58/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/59/index.html b/archives/2024/01/page/59/index.html
index 37de7ae20..2291c54bc 100644
--- a/archives/2024/01/page/59/index.html
+++ b/archives/2024/01/page/59/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/6/index.html b/archives/2024/01/page/6/index.html
index 170f4c614..828195dc7 100644
--- a/archives/2024/01/page/6/index.html
+++ b/archives/2024/01/page/6/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/eb193c1f.html" class="archive-article-date">
+	      	<a href="/post/6610c769.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/eb193c1f.html">1139. The greatest 1 Formation of the border  One question daily</a>
+      <a class="archive-article-title" href="/post/6610c769.html">1233Delete the subfolder folder One question daily</a>
     </h2>
   
 
@@ -348,7 +348,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Dictionary tree</a>
         		</li>
       		
 		</ul>
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/60/index.html b/archives/2024/01/page/60/index.html
index a2cd3e906..7cdaae981 100644
--- a/archives/2024/01/page/60/index.html
+++ b/archives/2024/01/page/60/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/61/index.html b/archives/2024/01/page/61/index.html
index eb0a5f9a1..851b6be35 100644
--- a/archives/2024/01/page/61/index.html
+++ b/archives/2024/01/page/61/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/62/index.html b/archives/2024/01/page/62/index.html
index 5d07b9d7d..751edc8a3 100644
--- a/archives/2024/01/page/62/index.html
+++ b/archives/2024/01/page/62/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/63/index.html b/archives/2024/01/page/63/index.html
index 072a89555..8ec98bd56 100644
--- a/archives/2024/01/page/63/index.html
+++ b/archives/2024/01/page/63/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/64/index.html b/archives/2024/01/page/64/index.html
index e2ed46a5e..a91e88156 100644
--- a/archives/2024/01/page/64/index.html
+++ b/archives/2024/01/page/64/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/65/index.html b/archives/2024/01/page/65/index.html
index ef27321e7..295f8b9b4 100644
--- a/archives/2024/01/page/65/index.html
+++ b/archives/2024/01/page/65/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/66/index.html b/archives/2024/01/page/66/index.html
index 6e3b17903..b2fea6fbd 100644
--- a/archives/2024/01/page/66/index.html
+++ b/archives/2024/01/page/66/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/67/index.html b/archives/2024/01/page/67/index.html
index aa0b9d017..ce812e95b 100644
--- a/archives/2024/01/page/67/index.html
+++ b/archives/2024/01/page/67/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/68/index.html b/archives/2024/01/page/68/index.html
index 3a2699847..51ec8810e 100644
--- a/archives/2024/01/page/68/index.html
+++ b/archives/2024/01/page/68/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/69/index.html b/archives/2024/01/page/69/index.html
index 49612c6bf..cc4bd757a 100644
--- a/archives/2024/01/page/69/index.html
+++ b/archives/2024/01/page/69/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/7/index.html b/archives/2024/01/page/7/index.html
index 4928a8bf4..3501c41eb 100644
--- a/archives/2024/01/page/7/index.html
+++ b/archives/2024/01/page/7/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/70/index.html b/archives/2024/01/page/70/index.html
index 2df22380e..252a700df 100644
--- a/archives/2024/01/page/70/index.html
+++ b/archives/2024/01/page/70/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/71/index.html b/archives/2024/01/page/71/index.html
index c92cbbf69..f200eebe3 100644
--- a/archives/2024/01/page/71/index.html
+++ b/archives/2024/01/page/71/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/72/index.html b/archives/2024/01/page/72/index.html
index 2affa7bec..522174c77 100644
--- a/archives/2024/01/page/72/index.html
+++ b/archives/2024/01/page/72/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/73/index.html b/archives/2024/01/page/73/index.html
index 914707f8f..86379f855 100644
--- a/archives/2024/01/page/73/index.html
+++ b/archives/2024/01/page/73/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/74/index.html b/archives/2024/01/page/74/index.html
index b385bfcc8..0c000797f 100644
--- a/archives/2024/01/page/74/index.html
+++ b/archives/2024/01/page/74/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/75/index.html b/archives/2024/01/page/75/index.html
index 4d3b63890..b66325a00 100644
--- a/archives/2024/01/page/75/index.html
+++ b/archives/2024/01/page/75/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/76/index.html b/archives/2024/01/page/76/index.html
index 3a7552e08..bfb2bcd5a 100644
--- a/archives/2024/01/page/76/index.html
+++ b/archives/2024/01/page/76/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/77/index.html b/archives/2024/01/page/77/index.html
index 6d95cb4a7..5b6ac9e04 100644
--- a/archives/2024/01/page/77/index.html
+++ b/archives/2024/01/page/77/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/78/index.html b/archives/2024/01/page/78/index.html
index 424c1ceb4..c45d1f69d 100644
--- a/archives/2024/01/page/78/index.html
+++ b/archives/2024/01/page/78/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/79/index.html b/archives/2024/01/page/79/index.html
index dda0544fe..abfbb41a4 100644
--- a/archives/2024/01/page/79/index.html
+++ b/archives/2024/01/page/79/index.html
@@ -442,7 +442,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/8/index.html b/archives/2024/01/page/8/index.html
index 6993cc288..707dd2b46 100644
--- a/archives/2024/01/page/8/index.html
+++ b/archives/2024/01/page/8/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/80/index.html b/archives/2024/01/page/80/index.html
index 6572a9e2d..a3080f421 100644
--- a/archives/2024/01/page/80/index.html
+++ b/archives/2024/01/page/80/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/81/index.html b/archives/2024/01/page/81/index.html
index 234e618fc..3d29f6e64 100644
--- a/archives/2024/01/page/81/index.html
+++ b/archives/2024/01/page/81/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/82/index.html b/archives/2024/01/page/82/index.html
index 5a8649311..122997d2a 100644
--- a/archives/2024/01/page/82/index.html
+++ b/archives/2024/01/page/82/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/83/index.html b/archives/2024/01/page/83/index.html
index 4693beaaf..ebcd595dd 100644
--- a/archives/2024/01/page/83/index.html
+++ b/archives/2024/01/page/83/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/84/index.html b/archives/2024/01/page/84/index.html
index 728bacfc9..b6b82ce16 100644
--- a/archives/2024/01/page/84/index.html
+++ b/archives/2024/01/page/84/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/85/index.html b/archives/2024/01/page/85/index.html
index 88170f118..def464be0 100644
--- a/archives/2024/01/page/85/index.html
+++ b/archives/2024/01/page/85/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/86/index.html b/archives/2024/01/page/86/index.html
index 96c309211..883814cc7 100644
--- a/archives/2024/01/page/86/index.html
+++ b/archives/2024/01/page/86/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/87/index.html b/archives/2024/01/page/87/index.html
index edb86549c..9797c490d 100644
--- a/archives/2024/01/page/87/index.html
+++ b/archives/2024/01/page/87/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/88/index.html b/archives/2024/01/page/88/index.html
index 5c989eb5e..e170a36ca 100644
--- a/archives/2024/01/page/88/index.html
+++ b/archives/2024/01/page/88/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/89/index.html b/archives/2024/01/page/89/index.html
index 4d04f26d9..e4446c812 100644
--- a/archives/2024/01/page/89/index.html
+++ b/archives/2024/01/page/89/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/9/index.html b/archives/2024/01/page/9/index.html
index f4dbbfdd8..40f9f913e 100644
--- a/archives/2024/01/page/9/index.html
+++ b/archives/2024/01/page/9/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/90/index.html b/archives/2024/01/page/90/index.html
index e31f88a95..ddea1fa65 100644
--- a/archives/2024/01/page/90/index.html
+++ b/archives/2024/01/page/90/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/91/index.html b/archives/2024/01/page/91/index.html
index 9ad5fd820..1b18cdd8d 100644
--- a/archives/2024/01/page/91/index.html
+++ b/archives/2024/01/page/91/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/92/index.html b/archives/2024/01/page/92/index.html
index 54b586108..d97e1a0b7 100644
--- a/archives/2024/01/page/92/index.html
+++ b/archives/2024/01/page/92/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/93/index.html b/archives/2024/01/page/93/index.html
index b83760c28..4805f24d5 100644
--- a/archives/2024/01/page/93/index.html
+++ b/archives/2024/01/page/93/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/94/index.html b/archives/2024/01/page/94/index.html
index eb8fd8d7b..1e838b5c0 100644
--- a/archives/2024/01/page/94/index.html
+++ b/archives/2024/01/page/94/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/95/index.html b/archives/2024/01/page/95/index.html
index e7f192d26..71266990f 100644
--- a/archives/2024/01/page/95/index.html
+++ b/archives/2024/01/page/95/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/01/page/96/index.html b/archives/2024/01/page/96/index.html
index 8cbb3eddb..e40af3f8b 100644
--- a/archives/2024/01/page/96/index.html
+++ b/archives/2024/01/page/96/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/05/index.html b/archives/2024/05/index.html
index 39f1532ab..0be6beb6d 100644
--- a/archives/2024/05/index.html
+++ b/archives/2024/05/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/05/page/2/index.html b/archives/2024/05/page/2/index.html
index c19e80904..d91f1bbf8 100644
--- a/archives/2024/05/page/2/index.html
+++ b/archives/2024/05/page/2/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/08/index.html b/archives/2024/08/index.html
index 9e2707419..c153cfa9c 100644
--- a/archives/2024/08/index.html
+++ b/archives/2024/08/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/09/index.html b/archives/2024/09/index.html
index 095c91df5..9513201cc 100644
--- a/archives/2024/09/index.html
+++ b/archives/2024/09/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/09/page/2/index.html b/archives/2024/09/page/2/index.html
index 6649d3dc3..a8042e83e 100644
--- a/archives/2024/09/page/2/index.html
+++ b/archives/2024/09/page/2/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/09/page/3/index.html b/archives/2024/09/page/3/index.html
index 0438bf511..fb8b9556b 100644
--- a/archives/2024/09/page/3/index.html
+++ b/archives/2024/09/page/3/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/index.html b/archives/2024/index.html
index d770eb9f2..9e347b2a0 100644
--- a/archives/2024/index.html
+++ b/archives/2024/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/10/index.html b/archives/2024/page/10/index.html
index 15d6d5a88..fdd7d8659 100644
--- a/archives/2024/page/10/index.html
+++ b/archives/2024/page/10/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/100/index.html b/archives/2024/page/100/index.html
index 17760db1d..0e9f4b1b7 100644
--- a/archives/2024/page/100/index.html
+++ b/archives/2024/page/100/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/101/index.html b/archives/2024/page/101/index.html
index 48a3fb663..013e0400a 100644
--- a/archives/2024/page/101/index.html
+++ b/archives/2024/page/101/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/102/index.html b/archives/2024/page/102/index.html
index 54f0f266c..4e391a65f 100644
--- a/archives/2024/page/102/index.html
+++ b/archives/2024/page/102/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/11/index.html b/archives/2024/page/11/index.html
index c309a3f91..7ab3fdcf8 100644
--- a/archives/2024/page/11/index.html
+++ b/archives/2024/page/11/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/6610c769.html" class="archive-article-date">
+	      	<a href="/post/eb193c1f.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/6610c769.html">1233Delete the subfolder folder One question daily</a>
+      <a class="archive-article-title" href="/post/eb193c1f.html">1139. The greatest 1 Formation of the border  One question daily</a>
     </h2>
   
 
@@ -348,7 +348,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Dictionary tree</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
         		</li>
       		
 		</ul>
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/12/index.html b/archives/2024/page/12/index.html
index ce16814bb..8bca5cf0f 100644
--- a/archives/2024/page/12/index.html
+++ b/archives/2024/page/12/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/eb193c1f.html" class="archive-article-date">
+	      	<a href="/post/6610c769.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/eb193c1f.html">1139. The greatest 1 Formation of the border  One question daily</a>
+      <a class="archive-article-title" href="/post/6610c769.html">1233Delete the subfolder folder One question daily</a>
     </h2>
   
 
@@ -348,7 +348,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Dictionary tree</a>
         		</li>
       		
 		</ul>
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/13/index.html b/archives/2024/page/13/index.html
index ca18f46e3..cdc24f1fd 100644
--- a/archives/2024/page/13/index.html
+++ b/archives/2024/page/13/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/14/index.html b/archives/2024/page/14/index.html
index c5d2086b6..a10515d87 100644
--- a/archives/2024/page/14/index.html
+++ b/archives/2024/page/14/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/15/index.html b/archives/2024/page/15/index.html
index f20ed46dc..ab58d227c 100644
--- a/archives/2024/page/15/index.html
+++ b/archives/2024/page/15/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/16/index.html b/archives/2024/page/16/index.html
index eb1d4eb9f..609ed5a85 100644
--- a/archives/2024/page/16/index.html
+++ b/archives/2024/page/16/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/e2c9cca9.html" class="archive-article-date">
+	      	<a href="/post/b2a927d5.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/e2c9cca9.html">142.Ring linkedII</a>
+      <a class="archive-article-title" href="/post/b2a927d5.html">1551. Make all the minimum operations of all elements in the array</a>
     </h2>
   
 
@@ -346,6 +346,10 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
+        		</li>
       		
 		</ul>
 	</div>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/17/index.html b/archives/2024/page/17/index.html
index ebb0ef872..6ff8f5f03 100644
--- a/archives/2024/page/17/index.html
+++ b/archives/2024/page/17/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/b2a927d5.html" class="archive-article-date">
+	      	<a href="/post/e2c9cca9.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/b2a927d5.html">1551. Make all the minimum operations of all elements in the array</a>
+      <a class="archive-article-title" href="/post/e2c9cca9.html">142.Ring linkedII</a>
     </h2>
   
 
@@ -346,10 +346,6 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
-        		</li>
       		
 		</ul>
 	</div>
@@ -422,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/18/index.html b/archives/2024/page/18/index.html
index 976e0db24..21255f681 100644
--- a/archives/2024/page/18/index.html
+++ b/archives/2024/page/18/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/19/index.html b/archives/2024/page/19/index.html
index 93e7c83c5..0cf7b9cc4 100644
--- a/archives/2024/page/19/index.html
+++ b/archives/2024/page/19/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/2/index.html b/archives/2024/page/2/index.html
index efd120483..965d50bd9 100644
--- a/archives/2024/page/2/index.html
+++ b/archives/2024/page/2/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/20/index.html b/archives/2024/page/20/index.html
index abceaf0ef..e8c0ec96e 100644
--- a/archives/2024/page/20/index.html
+++ b/archives/2024/page/20/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/21/index.html b/archives/2024/page/21/index.html
index a0c1c85f1..443895ed0 100644
--- a/archives/2024/page/21/index.html
+++ b/archives/2024/page/21/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/22/index.html b/archives/2024/page/22/index.html
index cfcfae52c..8eb3b8029 100644
--- a/archives/2024/page/22/index.html
+++ b/archives/2024/page/22/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/d482ac75.html" class="archive-article-date">
+	      	<a href="/post/1978f474.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/d482ac75.html">1669. Merge two linked watches One question daily</a>
+      <a class="archive-article-title" href="/post/1978f474.html">1664. Number of schemes to generate balance numbers One question daily</a>
     </h2>
   
 
@@ -352,7 +352,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Linked</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
         		</li>
       		
 		</ul>
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/23/index.html b/archives/2024/page/23/index.html
index 4d3764df0..4729c0f97 100644
--- a/archives/2024/page/23/index.html
+++ b/archives/2024/page/23/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/3667cd44.html" class="archive-article-date">
+	      	<a href="/post/d482ac75.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/3667cd44.html">1798You can construct the maximum number of continuity One question daily</a>
+      <a class="archive-article-title" href="/post/d482ac75.html">1669. Merge two linked watches One question daily</a>
     </h2>
   
 
@@ -348,7 +348,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">One question daily</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Linked</a>
         		</li>
       		
 		</ul>
@@ -422,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/24/index.html b/archives/2024/page/24/index.html
index 48aaab042..ecd34bfc1 100644
--- a/archives/2024/page/24/index.html
+++ b/archives/2024/page/24/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/2f3e8e26.html" class="archive-article-date">
+	      	<a href="/post/3667cd44.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/2f3e8e26.html">1801-1803 Liech buckle novice！</a>
+      <a class="archive-article-title" href="/post/3667cd44.html">1798You can construct the maximum number of continuity One question daily</a>
     </h2>
   
 
@@ -344,7 +344,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/25/index.html b/archives/2024/page/25/index.html
index 2c1bf78cd..cd41cbbbc 100644
--- a/archives/2024/page/25/index.html
+++ b/archives/2024/page/25/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/1978f474.html" class="archive-article-date">
+	      	<a href="/post/2f3e8e26.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/1978f474.html">1664. Number of schemes to generate balance numbers One question daily</a>
+      <a class="archive-article-title" href="/post/2f3e8e26.html">1801-1803 Liech buckle novice！</a>
     </h2>
   
 
@@ -344,15 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">One question daily</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -426,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/26/index.html b/archives/2024/page/26/index.html
index 88ce61298..772893bb0 100644
--- a/archives/2024/page/26/index.html
+++ b/archives/2024/page/26/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/27/index.html b/archives/2024/page/27/index.html
index c6b41bf62..62244b818 100644
--- a/archives/2024/page/27/index.html
+++ b/archives/2024/page/27/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/28/index.html b/archives/2024/page/28/index.html
index 66606baad..71b981a93 100644
--- a/archives/2024/page/28/index.html
+++ b/archives/2024/page/28/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/29/index.html b/archives/2024/page/29/index.html
index 919396b3a..0e8effac3 100644
--- a/archives/2024/page/29/index.html
+++ b/archives/2024/page/29/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/3/index.html b/archives/2024/page/3/index.html
index 2e0061473..3985857d1 100644
--- a/archives/2024/page/3/index.html
+++ b/archives/2024/page/3/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/30/index.html b/archives/2024/page/30/index.html
index 9ec05ba3e..c559361bc 100644
--- a/archives/2024/page/30/index.html
+++ b/archives/2024/page/30/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/31/index.html b/archives/2024/page/31/index.html
index e1058d3d7..0e73f2f90 100644
--- a/archives/2024/page/31/index.html
+++ b/archives/2024/page/31/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/3277549c.html" class="archive-article-date">
+	      	<a href="/post/6be57ef7.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/3277549c.html">1828. Statistics the number of a circle mid -point One question daily</a>
+      <a class="archive-article-title" href="/post/6be57ef7.html">1825. Seek out MK average value</a>
     </h2>
   
 
@@ -344,11 +344,15 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">unsolved</a>
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">difficulty</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color3">Multiple set</a>
         		</li>
       		
 		</ul>
@@ -422,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/32/index.html b/archives/2024/page/32/index.html
index 48c22f16a..afbfa222b 100644
--- a/archives/2024/page/32/index.html
+++ b/archives/2024/page/32/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/6be57ef7.html" class="archive-article-date">
+	      	<a href="/post/3277549c.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/6be57ef7.html">1825. Seek out MK average value</a>
+      <a class="archive-article-title" href="/post/3277549c.html">1828. Statistics the number of a circle mid -point One question daily</a>
     </h2>
   
 
@@ -344,15 +344,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">unsolved</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">difficulty</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color3">Multiple set</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
         		</li>
       		
 		</ul>
@@ -426,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/33/index.html b/archives/2024/page/33/index.html
index 164604409..89076f5bf 100644
--- a/archives/2024/page/33/index.html
+++ b/archives/2024/page/33/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/34/index.html b/archives/2024/page/34/index.html
index 5ec14a894..5522aeaa3 100644
--- a/archives/2024/page/34/index.html
+++ b/archives/2024/page/34/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/35/index.html b/archives/2024/page/35/index.html
index 0ad5c9639..1cf3f861e 100644
--- a/archives/2024/page/35/index.html
+++ b/archives/2024/page/35/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/36/index.html b/archives/2024/page/36/index.html
index 21d99e018..74188f7eb 100644
--- a/archives/2024/page/36/index.html
+++ b/archives/2024/page/36/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/37/index.html b/archives/2024/page/37/index.html
index f8e8a5e79..a9f1423cf 100644
--- a/archives/2024/page/37/index.html
+++ b/archives/2024/page/37/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/38/index.html b/archives/2024/page/38/index.html
index 8a6f3057b..f00a69d4c 100644
--- a/archives/2024/page/38/index.html
+++ b/archives/2024/page/38/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/e03edda.html" class="archive-article-date">
+	      	<a href="/post/16b0e9f1.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/e03edda.html">221Maximum square</a>
+      <a class="archive-article-title" href="/post/16b0e9f1.html">219.Existing duplicate elements II Hash table graphics</a>
     </h2>
   
 
@@ -344,15 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">solved</a>
         		</li>
       		
 		</ul>
@@ -426,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/39/index.html b/archives/2024/page/39/index.html
index f525085be..c0eed80bd 100644
--- a/archives/2024/page/39/index.html
+++ b/archives/2024/page/39/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/c3f7f59f.html" class="archive-article-date">
+	      	<a href="/post/e03edda.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/c3f7f59f.html">One question daily 2283</a>
+      <a class="archive-article-title" href="/post/e03edda.html">221Maximum square</a>
     </h2>
   
 
@@ -344,7 +344,15 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -418,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/4/index.html b/archives/2024/page/4/index.html
index 095e554c2..d9fbbc2cb 100644
--- a/archives/2024/page/4/index.html
+++ b/archives/2024/page/4/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/40/index.html b/archives/2024/page/40/index.html
index 7ece39980..5ae68f148 100644
--- a/archives/2024/page/40/index.html
+++ b/archives/2024/page/40/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/16b0e9f1.html" class="archive-article-date">
+	      	<a href="/post/c3f7f59f.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/16b0e9f1.html">219.Existing duplicate elements II Hash table graphics</a>
+      <a class="archive-article-title" href="/post/c3f7f59f.html">One question daily 2283</a>
     </h2>
   
 
@@ -344,7 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">solved</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/41/index.html b/archives/2024/page/41/index.html
index 18fcc6ca9..16e79be24 100644
--- a/archives/2024/page/41/index.html
+++ b/archives/2024/page/41/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/7ded25bb.html" class="archive-article-date">
+	      	<a href="/post/9df6242c.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/7ded25bb.html">One question daily 2299. Code inspection device II</a>
+      <a class="archive-article-title" href="/post/9df6242c.html">One question daily 2293. Great mini game</a>
     </h2>
   
 
@@ -344,11 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">Bit operation</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -422,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/42/index.html b/archives/2024/page/42/index.html
index fe71c3540..d3716f2da 100644
--- a/archives/2024/page/42/index.html
+++ b/archives/2024/page/42/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/9df6242c.html" class="archive-article-date">
+	      	<a href="/post/7ded25bb.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/9df6242c.html">One question daily 2293. Great mini game</a>
+      <a class="archive-article-title" href="/post/7ded25bb.html">One question daily 2299. Code inspection device II</a>
     </h2>
   
 
@@ -344,7 +344,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">Bit operation</a>
         		</li>
       		
 		</ul>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/43/index.html b/archives/2024/page/43/index.html
index 35023abf4..6dfbee533 100644
--- a/archives/2024/page/43/index.html
+++ b/archives/2024/page/43/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/44/index.html b/archives/2024/page/44/index.html
index be67f3429..e1bc55853 100644
--- a/archives/2024/page/44/index.html
+++ b/archives/2024/page/44/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/45/index.html b/archives/2024/page/45/index.html
index 9921e6337..c6797c56b 100644
--- a/archives/2024/page/45/index.html
+++ b/archives/2024/page/45/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/46/index.html b/archives/2024/page/46/index.html
index 1cb765fa8..e742d86dc 100644
--- a/archives/2024/page/46/index.html
+++ b/archives/2024/page/46/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/47/index.html b/archives/2024/page/47/index.html
index 7132f8212..f47597b21 100644
--- a/archives/2024/page/47/index.html
+++ b/archives/2024/page/47/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/48/index.html b/archives/2024/page/48/index.html
index 4d1b2c4b3..5a20b7505 100644
--- a/archives/2024/page/48/index.html
+++ b/archives/2024/page/48/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/49/index.html b/archives/2024/page/49/index.html
index fe73987e7..511b277c1 100644
--- a/archives/2024/page/49/index.html
+++ b/archives/2024/page/49/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/5/index.html b/archives/2024/page/5/index.html
index b917d7eec..2b063626c 100644
--- a/archives/2024/page/5/index.html
+++ b/archives/2024/page/5/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/50/index.html b/archives/2024/page/50/index.html
index fba56d0c6..31cf8e5a7 100644
--- a/archives/2024/page/50/index.html
+++ b/archives/2024/page/50/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/51/index.html b/archives/2024/page/51/index.html
index 91f82bea2..bcd1ccbea 100644
--- a/archives/2024/page/51/index.html
+++ b/archives/2024/page/51/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/52/index.html b/archives/2024/page/52/index.html
index 127f522a6..1abd1d995 100644
--- a/archives/2024/page/52/index.html
+++ b/archives/2024/page/52/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/53/index.html b/archives/2024/page/53/index.html
index 1738e374e..6e1d21d44 100644
--- a/archives/2024/page/53/index.html
+++ b/archives/2024/page/53/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/54/index.html b/archives/2024/page/54/index.html
index 8f64dd4cf..15aee47b0 100644
--- a/archives/2024/page/54/index.html
+++ b/archives/2024/page/54/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/55/index.html b/archives/2024/page/55/index.html
index cce762bf8..2a8c4bb2d 100644
--- a/archives/2024/page/55/index.html
+++ b/archives/2024/page/55/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/56/index.html b/archives/2024/page/56/index.html
index 51a925ab6..6c2fc2f1c 100644
--- a/archives/2024/page/56/index.html
+++ b/archives/2024/page/56/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/57/index.html b/archives/2024/page/57/index.html
index 04f40da4e..e683fcec9 100644
--- a/archives/2024/page/57/index.html
+++ b/archives/2024/page/57/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/58/index.html b/archives/2024/page/58/index.html
index 14bf30706..f00b08780 100644
--- a/archives/2024/page/58/index.html
+++ b/archives/2024/page/58/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/59/index.html b/archives/2024/page/59/index.html
index 665bad037..cdd9cc815 100644
--- a/archives/2024/page/59/index.html
+++ b/archives/2024/page/59/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/6/index.html b/archives/2024/page/6/index.html
index eaf40abcf..93046e10e 100644
--- a/archives/2024/page/6/index.html
+++ b/archives/2024/page/6/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/60/index.html b/archives/2024/page/60/index.html
index a4eb46dcd..6939d8197 100644
--- a/archives/2024/page/60/index.html
+++ b/archives/2024/page/60/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/61/index.html b/archives/2024/page/61/index.html
index 39c39ad39..b4a223694 100644
--- a/archives/2024/page/61/index.html
+++ b/archives/2024/page/61/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/62/index.html b/archives/2024/page/62/index.html
index 603169d59..c12d72f0c 100644
--- a/archives/2024/page/62/index.html
+++ b/archives/2024/page/62/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/63/index.html b/archives/2024/page/63/index.html
index c61535e4c..16f40a999 100644
--- a/archives/2024/page/63/index.html
+++ b/archives/2024/page/63/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/64/index.html b/archives/2024/page/64/index.html
index 1f5c814cd..829d2530b 100644
--- a/archives/2024/page/64/index.html
+++ b/archives/2024/page/64/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/65/index.html b/archives/2024/page/65/index.html
index a9c5bd814..545866d7f 100644
--- a/archives/2024/page/65/index.html
+++ b/archives/2024/page/65/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/66/index.html b/archives/2024/page/66/index.html
index a31caadd9..f2aaca74f 100644
--- a/archives/2024/page/66/index.html
+++ b/archives/2024/page/66/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/67/index.html b/archives/2024/page/67/index.html
index 3ebb3e779..f109582a1 100644
--- a/archives/2024/page/67/index.html
+++ b/archives/2024/page/67/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/68/index.html b/archives/2024/page/68/index.html
index 03d393443..4be2bbb80 100644
--- a/archives/2024/page/68/index.html
+++ b/archives/2024/page/68/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/69/index.html b/archives/2024/page/69/index.html
index 6d713bb2d..100934956 100644
--- a/archives/2024/page/69/index.html
+++ b/archives/2024/page/69/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/7/index.html b/archives/2024/page/7/index.html
index 1224b38c7..198b96fbf 100644
--- a/archives/2024/page/7/index.html
+++ b/archives/2024/page/7/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/70/index.html b/archives/2024/page/70/index.html
index e5e145869..7a565f674 100644
--- a/archives/2024/page/70/index.html
+++ b/archives/2024/page/70/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/71/index.html b/archives/2024/page/71/index.html
index 4a948e83b..8d75ab135 100644
--- a/archives/2024/page/71/index.html
+++ b/archives/2024/page/71/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/72/index.html b/archives/2024/page/72/index.html
index b696944cd..27e09119e 100644
--- a/archives/2024/page/72/index.html
+++ b/archives/2024/page/72/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/73/index.html b/archives/2024/page/73/index.html
index 0e7c3967f..aee54b8c5 100644
--- a/archives/2024/page/73/index.html
+++ b/archives/2024/page/73/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/74/index.html b/archives/2024/page/74/index.html
index bef9bd9ba..84989d61a 100644
--- a/archives/2024/page/74/index.html
+++ b/archives/2024/page/74/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/75/index.html b/archives/2024/page/75/index.html
index 84825f9db..ff442c8bc 100644
--- a/archives/2024/page/75/index.html
+++ b/archives/2024/page/75/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/76/index.html b/archives/2024/page/76/index.html
index 40babe689..837d8c57f 100644
--- a/archives/2024/page/76/index.html
+++ b/archives/2024/page/76/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/77/index.html b/archives/2024/page/77/index.html
index a07f57cd2..abc3d2c12 100644
--- a/archives/2024/page/77/index.html
+++ b/archives/2024/page/77/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/78/index.html b/archives/2024/page/78/index.html
index f7c2e1ede..76f6e1911 100644
--- a/archives/2024/page/78/index.html
+++ b/archives/2024/page/78/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/79/index.html b/archives/2024/page/79/index.html
index 762630900..5bc3ee301 100644
--- a/archives/2024/page/79/index.html
+++ b/archives/2024/page/79/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/8/index.html b/archives/2024/page/8/index.html
index c5ad6c735..4e5b4ee20 100644
--- a/archives/2024/page/8/index.html
+++ b/archives/2024/page/8/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/a5d1dfda.html" class="archive-article-date">
+	      	<a href="/post/80cafdc8.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/a5d1dfda.html">1124. The longest period of performance One question daily</a>
+      <a class="archive-article-title" href="/post/80cafdc8.html">1017.Negative binary conversion</a>
     </h2>
   
 
@@ -346,10 +346,6 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
-        		</li>
       		
 		</ul>
 	</div>
@@ -422,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/80/index.html b/archives/2024/page/80/index.html
index f50f3b4b2..c66624e37 100644
--- a/archives/2024/page/80/index.html
+++ b/archives/2024/page/80/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/81/index.html b/archives/2024/page/81/index.html
index a1017691c..a20b38a16 100644
--- a/archives/2024/page/81/index.html
+++ b/archives/2024/page/81/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/82/index.html b/archives/2024/page/82/index.html
index e07eb27fe..dc8719fce 100644
--- a/archives/2024/page/82/index.html
+++ b/archives/2024/page/82/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/83/index.html b/archives/2024/page/83/index.html
index f3c254e65..84cb6559b 100644
--- a/archives/2024/page/83/index.html
+++ b/archives/2024/page/83/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/84/index.html b/archives/2024/page/84/index.html
index e241224fa..2a524f7d7 100644
--- a/archives/2024/page/84/index.html
+++ b/archives/2024/page/84/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/85/index.html b/archives/2024/page/85/index.html
index 2a8b28487..57aace324 100644
--- a/archives/2024/page/85/index.html
+++ b/archives/2024/page/85/index.html
@@ -442,7 +442,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/86/index.html b/archives/2024/page/86/index.html
index 6eb265b5e..405e36e95 100644
--- a/archives/2024/page/86/index.html
+++ b/archives/2024/page/86/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/87/index.html b/archives/2024/page/87/index.html
index 24c29df24..9829ca339 100644
--- a/archives/2024/page/87/index.html
+++ b/archives/2024/page/87/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/88/index.html b/archives/2024/page/88/index.html
index 704a15d28..062a4ef28 100644
--- a/archives/2024/page/88/index.html
+++ b/archives/2024/page/88/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/89/index.html b/archives/2024/page/89/index.html
index 300bb114c..286079fc6 100644
--- a/archives/2024/page/89/index.html
+++ b/archives/2024/page/89/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/9/index.html b/archives/2024/page/9/index.html
index 077413f36..9e97e6635 100644
--- a/archives/2024/page/9/index.html
+++ b/archives/2024/page/9/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/80cafdc8.html" class="archive-article-date">
+	      	<a href="/post/a5d1dfda.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/80cafdc8.html">1017.Negative binary conversion</a>
+      <a class="archive-article-title" href="/post/a5d1dfda.html">1124. The longest period of performance One question daily</a>
     </h2>
   
 
@@ -346,6 +346,10 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
+        		</li>
       		
 		</ul>
 	</div>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/90/index.html b/archives/2024/page/90/index.html
index 66a418cee..842d7f17f 100644
--- a/archives/2024/page/90/index.html
+++ b/archives/2024/page/90/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/91/index.html b/archives/2024/page/91/index.html
index 5e10f7235..cc4c22ebc 100644
--- a/archives/2024/page/91/index.html
+++ b/archives/2024/page/91/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/92/index.html b/archives/2024/page/92/index.html
index 87376d4de..12f8b15fd 100644
--- a/archives/2024/page/92/index.html
+++ b/archives/2024/page/92/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/93/index.html b/archives/2024/page/93/index.html
index 92be87f0b..75a000ad1 100644
--- a/archives/2024/page/93/index.html
+++ b/archives/2024/page/93/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/94/index.html b/archives/2024/page/94/index.html
index 9bbdb52b1..e83c2d2de 100644
--- a/archives/2024/page/94/index.html
+++ b/archives/2024/page/94/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/95/index.html b/archives/2024/page/95/index.html
index f7b964f74..51d716e8e 100644
--- a/archives/2024/page/95/index.html
+++ b/archives/2024/page/95/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/96/index.html b/archives/2024/page/96/index.html
index 98d1483f7..192cfb3bc 100644
--- a/archives/2024/page/96/index.html
+++ b/archives/2024/page/96/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/97/index.html b/archives/2024/page/97/index.html
index ee3f9e8c7..9959b3a6d 100644
--- a/archives/2024/page/97/index.html
+++ b/archives/2024/page/97/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/98/index.html b/archives/2024/page/98/index.html
index 3f6fc0cc8..8834ccce6 100644
--- a/archives/2024/page/98/index.html
+++ b/archives/2024/page/98/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/2024/page/99/index.html b/archives/2024/page/99/index.html
index 167fd9d6c..6b61fff22 100644
--- a/archives/2024/page/99/index.html
+++ b/archives/2024/page/99/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/index.html b/archives/index.html
index 6a6572551..4173357d1 100644
--- a/archives/index.html
+++ b/archives/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/10/index.html b/archives/page/10/index.html
index 2a78d0ceb..1f181418a 100644
--- a/archives/page/10/index.html
+++ b/archives/page/10/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/100/index.html b/archives/page/100/index.html
index 803925baa..3f936ee09 100644
--- a/archives/page/100/index.html
+++ b/archives/page/100/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/101/index.html b/archives/page/101/index.html
index 4a5210225..9c5b9752d 100644
--- a/archives/page/101/index.html
+++ b/archives/page/101/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/102/index.html b/archives/page/102/index.html
index 1ca620d82..6fa5340c0 100644
--- a/archives/page/102/index.html
+++ b/archives/page/102/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/103/index.html b/archives/page/103/index.html
index aeb24da6e..4d817ff6e 100644
--- a/archives/page/103/index.html
+++ b/archives/page/103/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/104/index.html b/archives/page/104/index.html
index 41ca0d7ef..828b20e1d 100644
--- a/archives/page/104/index.html
+++ b/archives/page/104/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/11/index.html b/archives/page/11/index.html
index bbfe9a0bf..37e8e8b1b 100644
--- a/archives/page/11/index.html
+++ b/archives/page/11/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/6610c769.html" class="archive-article-date">
+	      	<a href="/post/eb193c1f.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/6610c769.html">1233Delete the subfolder folder One question daily</a>
+      <a class="archive-article-title" href="/post/eb193c1f.html">1139. The greatest 1 Formation of the border  One question daily</a>
     </h2>
   
 
@@ -348,7 +348,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Dictionary tree</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
         		</li>
       		
 		</ul>
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/12/index.html b/archives/page/12/index.html
index 7b932548d..780d46f05 100644
--- a/archives/page/12/index.html
+++ b/archives/page/12/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/eb193c1f.html" class="archive-article-date">
+	      	<a href="/post/6610c769.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/eb193c1f.html">1139. The greatest 1 Formation of the border  One question daily</a>
+      <a class="archive-article-title" href="/post/6610c769.html">1233Delete the subfolder folder One question daily</a>
     </h2>
   
 
@@ -348,7 +348,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Dictionary tree</a>
         		</li>
       		
 		</ul>
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/13/index.html b/archives/page/13/index.html
index 50346b6f5..c889511c2 100644
--- a/archives/page/13/index.html
+++ b/archives/page/13/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/14/index.html b/archives/page/14/index.html
index bb990dc83..e1220f0c1 100644
--- a/archives/page/14/index.html
+++ b/archives/page/14/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/15/index.html b/archives/page/15/index.html
index 3b0b36337..b0ac11c28 100644
--- a/archives/page/15/index.html
+++ b/archives/page/15/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/16/index.html b/archives/page/16/index.html
index 44855bb68..a6ce46686 100644
--- a/archives/page/16/index.html
+++ b/archives/page/16/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/e2c9cca9.html" class="archive-article-date">
+	      	<a href="/post/b2a927d5.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/e2c9cca9.html">142.Ring linkedII</a>
+      <a class="archive-article-title" href="/post/b2a927d5.html">1551. Make all the minimum operations of all elements in the array</a>
     </h2>
   
 
@@ -346,6 +346,10 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
+        		</li>
       		
 		</ul>
 	</div>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/17/index.html b/archives/page/17/index.html
index ff1acf1f7..5a8a6a2c8 100644
--- a/archives/page/17/index.html
+++ b/archives/page/17/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/b2a927d5.html" class="archive-article-date">
+	      	<a href="/post/e2c9cca9.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/b2a927d5.html">1551. Make all the minimum operations of all elements in the array</a>
+      <a class="archive-article-title" href="/post/e2c9cca9.html">142.Ring linkedII</a>
     </h2>
   
 
@@ -346,10 +346,6 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
-        		</li>
       		
 		</ul>
 	</div>
@@ -422,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/18/index.html b/archives/page/18/index.html
index f5c87e6bb..cbc1b3040 100644
--- a/archives/page/18/index.html
+++ b/archives/page/18/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/19/index.html b/archives/page/19/index.html
index b23f8c4b6..16552b91c 100644
--- a/archives/page/19/index.html
+++ b/archives/page/19/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/2/index.html b/archives/page/2/index.html
index 449c72866..62e7190b3 100644
--- a/archives/page/2/index.html
+++ b/archives/page/2/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/20/index.html b/archives/page/20/index.html
index 2a71977ee..d46b92951 100644
--- a/archives/page/20/index.html
+++ b/archives/page/20/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/21/index.html b/archives/page/21/index.html
index 170f911a4..c69ede028 100644
--- a/archives/page/21/index.html
+++ b/archives/page/21/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/22/index.html b/archives/page/22/index.html
index 794b585c8..9a630f2d1 100644
--- a/archives/page/22/index.html
+++ b/archives/page/22/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/d482ac75.html" class="archive-article-date">
+	      	<a href="/post/1978f474.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/d482ac75.html">1669. Merge two linked watches One question daily</a>
+      <a class="archive-article-title" href="/post/1978f474.html">1664. Number of schemes to generate balance numbers One question daily</a>
     </h2>
   
 
@@ -352,7 +352,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Linked</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
         		</li>
       		
 		</ul>
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/23/index.html b/archives/page/23/index.html
index fae4af1a8..3710bc4e8 100644
--- a/archives/page/23/index.html
+++ b/archives/page/23/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/3667cd44.html" class="archive-article-date">
+	      	<a href="/post/d482ac75.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/3667cd44.html">1798You can construct the maximum number of continuity One question daily</a>
+      <a class="archive-article-title" href="/post/d482ac75.html">1669. Merge two linked watches One question daily</a>
     </h2>
   
 
@@ -348,7 +348,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">One question daily</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Linked</a>
         		</li>
       		
 		</ul>
@@ -422,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/24/index.html b/archives/page/24/index.html
index f9df9d44c..2b9cf2b37 100644
--- a/archives/page/24/index.html
+++ b/archives/page/24/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/2f3e8e26.html" class="archive-article-date">
+	      	<a href="/post/3667cd44.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/2f3e8e26.html">1801-1803 Liech buckle novice！</a>
+      <a class="archive-article-title" href="/post/3667cd44.html">1798You can construct the maximum number of continuity One question daily</a>
     </h2>
   
 
@@ -344,7 +344,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/25/index.html b/archives/page/25/index.html
index 0450e3a33..56d77b2bf 100644
--- a/archives/page/25/index.html
+++ b/archives/page/25/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/1978f474.html" class="archive-article-date">
+	      	<a href="/post/2f3e8e26.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/1978f474.html">1664. Number of schemes to generate balance numbers One question daily</a>
+      <a class="archive-article-title" href="/post/2f3e8e26.html">1801-1803 Liech buckle novice！</a>
     </h2>
   
 
@@ -344,15 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">One question daily</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -426,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/26/index.html b/archives/page/26/index.html
index fb488cde9..f50e2f379 100644
--- a/archives/page/26/index.html
+++ b/archives/page/26/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/27/index.html b/archives/page/27/index.html
index 5a7088557..56d405caa 100644
--- a/archives/page/27/index.html
+++ b/archives/page/27/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/28/index.html b/archives/page/28/index.html
index c3df49de1..783ab3afc 100644
--- a/archives/page/28/index.html
+++ b/archives/page/28/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/29/index.html b/archives/page/29/index.html
index 05a786415..051af3fd0 100644
--- a/archives/page/29/index.html
+++ b/archives/page/29/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/3/index.html b/archives/page/3/index.html
index 22438978f..f2bc84fbb 100644
--- a/archives/page/3/index.html
+++ b/archives/page/3/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/30/index.html b/archives/page/30/index.html
index 8b060075b..3e3417fd6 100644
--- a/archives/page/30/index.html
+++ b/archives/page/30/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/31/index.html b/archives/page/31/index.html
index cba5c2c2f..21c757922 100644
--- a/archives/page/31/index.html
+++ b/archives/page/31/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/3277549c.html" class="archive-article-date">
+	      	<a href="/post/6be57ef7.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/3277549c.html">1828. Statistics the number of a circle mid -point One question daily</a>
+      <a class="archive-article-title" href="/post/6be57ef7.html">1825. Seek out MK average value</a>
     </h2>
   
 
@@ -344,11 +344,15 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">unsolved</a>
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">difficulty</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color3">Multiple set</a>
         		</li>
       		
 		</ul>
@@ -422,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/32/index.html b/archives/page/32/index.html
index d4dd9da92..583e46faa 100644
--- a/archives/page/32/index.html
+++ b/archives/page/32/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/6be57ef7.html" class="archive-article-date">
+	      	<a href="/post/3277549c.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/6be57ef7.html">1825. Seek out MK average value</a>
+      <a class="archive-article-title" href="/post/3277549c.html">1828. Statistics the number of a circle mid -point One question daily</a>
     </h2>
   
 
@@ -344,15 +344,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">unsolved</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">difficulty</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color3">Multiple set</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
         		</li>
       		
 		</ul>
@@ -426,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/33/index.html b/archives/page/33/index.html
index 8389fa7bd..224b13ea5 100644
--- a/archives/page/33/index.html
+++ b/archives/page/33/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/34/index.html b/archives/page/34/index.html
index ce99bc6bc..28a87a44a 100644
--- a/archives/page/34/index.html
+++ b/archives/page/34/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/35/index.html b/archives/page/35/index.html
index 6f05c43e6..a37710295 100644
--- a/archives/page/35/index.html
+++ b/archives/page/35/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/36/index.html b/archives/page/36/index.html
index 06d9c6897..57b661f79 100644
--- a/archives/page/36/index.html
+++ b/archives/page/36/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/37/index.html b/archives/page/37/index.html
index 4fba5b07c..0b8bb8afe 100644
--- a/archives/page/37/index.html
+++ b/archives/page/37/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/38/index.html b/archives/page/38/index.html
index 43d1993ff..de3435e7b 100644
--- a/archives/page/38/index.html
+++ b/archives/page/38/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/e03edda.html" class="archive-article-date">
+	      	<a href="/post/16b0e9f1.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/e03edda.html">221Maximum square</a>
+      <a class="archive-article-title" href="/post/16b0e9f1.html">219.Existing duplicate elements II Hash table graphics</a>
     </h2>
   
 
@@ -344,15 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">solved</a>
         		</li>
       		
 		</ul>
@@ -426,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/39/index.html b/archives/page/39/index.html
index 06bcda8c6..e9f27b1a1 100644
--- a/archives/page/39/index.html
+++ b/archives/page/39/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/c3f7f59f.html" class="archive-article-date">
+	      	<a href="/post/e03edda.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/c3f7f59f.html">One question daily 2283</a>
+      <a class="archive-article-title" href="/post/e03edda.html">221Maximum square</a>
     </h2>
   
 
@@ -344,7 +344,15 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -418,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/4/index.html b/archives/page/4/index.html
index 0a26e01a8..7e6320b5a 100644
--- a/archives/page/4/index.html
+++ b/archives/page/4/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/40/index.html b/archives/page/40/index.html
index 7fbe0ab1c..7d7bbbb01 100644
--- a/archives/page/40/index.html
+++ b/archives/page/40/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/16b0e9f1.html" class="archive-article-date">
+	      	<a href="/post/c3f7f59f.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/16b0e9f1.html">219.Existing duplicate elements II Hash table graphics</a>
+      <a class="archive-article-title" href="/post/c3f7f59f.html">One question daily 2283</a>
     </h2>
   
 
@@ -344,7 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">solved</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/41/index.html b/archives/page/41/index.html
index 12d93b0ca..e5e241399 100644
--- a/archives/page/41/index.html
+++ b/archives/page/41/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/7ded25bb.html" class="archive-article-date">
+	      	<a href="/post/9df6242c.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/7ded25bb.html">One question daily 2299. Code inspection device II</a>
+      <a class="archive-article-title" href="/post/9df6242c.html">One question daily 2293. Great mini game</a>
     </h2>
   
 
@@ -344,11 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">Bit operation</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -422,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/42/index.html b/archives/page/42/index.html
index 1fbc9ea56..50b1da8fd 100644
--- a/archives/page/42/index.html
+++ b/archives/page/42/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/9df6242c.html" class="archive-article-date">
+	      	<a href="/post/7ded25bb.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/9df6242c.html">One question daily 2293. Great mini game</a>
+      <a class="archive-article-title" href="/post/7ded25bb.html">One question daily 2299. Code inspection device II</a>
     </h2>
   
 
@@ -344,7 +344,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">Bit operation</a>
         		</li>
       		
 		</ul>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/43/index.html b/archives/page/43/index.html
index 0d4c88dc0..16af53bf7 100644
--- a/archives/page/43/index.html
+++ b/archives/page/43/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/44/index.html b/archives/page/44/index.html
index f8f396f41..a9d84e85f 100644
--- a/archives/page/44/index.html
+++ b/archives/page/44/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/45/index.html b/archives/page/45/index.html
index ecd73482d..1b18bd1ea 100644
--- a/archives/page/45/index.html
+++ b/archives/page/45/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/46/index.html b/archives/page/46/index.html
index 96f3d3d26..21b72b7c2 100644
--- a/archives/page/46/index.html
+++ b/archives/page/46/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/47/index.html b/archives/page/47/index.html
index fe504d663..8d5580272 100644
--- a/archives/page/47/index.html
+++ b/archives/page/47/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/48/index.html b/archives/page/48/index.html
index d2a373edf..5eac20ec5 100644
--- a/archives/page/48/index.html
+++ b/archives/page/48/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/49/index.html b/archives/page/49/index.html
index 61e3e9594..de9b560a2 100644
--- a/archives/page/49/index.html
+++ b/archives/page/49/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/5/index.html b/archives/page/5/index.html
index 11bc6f237..63fd2b851 100644
--- a/archives/page/5/index.html
+++ b/archives/page/5/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/50/index.html b/archives/page/50/index.html
index aff550742..d8489408f 100644
--- a/archives/page/50/index.html
+++ b/archives/page/50/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/51/index.html b/archives/page/51/index.html
index 0b2690aaf..4e9fcf6cf 100644
--- a/archives/page/51/index.html
+++ b/archives/page/51/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/52/index.html b/archives/page/52/index.html
index 21fb2b4b0..100922f29 100644
--- a/archives/page/52/index.html
+++ b/archives/page/52/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/53/index.html b/archives/page/53/index.html
index aa06de0cf..dac5dd716 100644
--- a/archives/page/53/index.html
+++ b/archives/page/53/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/54/index.html b/archives/page/54/index.html
index 7edd31c0f..67c1e1b76 100644
--- a/archives/page/54/index.html
+++ b/archives/page/54/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/55/index.html b/archives/page/55/index.html
index d52752686..e9ecae950 100644
--- a/archives/page/55/index.html
+++ b/archives/page/55/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/56/index.html b/archives/page/56/index.html
index 17ca687e3..8c963716b 100644
--- a/archives/page/56/index.html
+++ b/archives/page/56/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/57/index.html b/archives/page/57/index.html
index e9d953671..5a0708edc 100644
--- a/archives/page/57/index.html
+++ b/archives/page/57/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/58/index.html b/archives/page/58/index.html
index 73a15ea92..5e69e46d4 100644
--- a/archives/page/58/index.html
+++ b/archives/page/58/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/59/index.html b/archives/page/59/index.html
index a1713c9d8..a30a1fd9d 100644
--- a/archives/page/59/index.html
+++ b/archives/page/59/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/6/index.html b/archives/page/6/index.html
index 3479d3e01..aff7c696e 100644
--- a/archives/page/6/index.html
+++ b/archives/page/6/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/60/index.html b/archives/page/60/index.html
index be0071f92..1cb9dcbdc 100644
--- a/archives/page/60/index.html
+++ b/archives/page/60/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/61/index.html b/archives/page/61/index.html
index f8ca70d5a..b33c4e65b 100644
--- a/archives/page/61/index.html
+++ b/archives/page/61/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/62/index.html b/archives/page/62/index.html
index 16ff23ff5..a18f0c1e6 100644
--- a/archives/page/62/index.html
+++ b/archives/page/62/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/63/index.html b/archives/page/63/index.html
index 72261ef98..93efad978 100644
--- a/archives/page/63/index.html
+++ b/archives/page/63/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/64/index.html b/archives/page/64/index.html
index 180b1b220..256c2dbb5 100644
--- a/archives/page/64/index.html
+++ b/archives/page/64/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/65/index.html b/archives/page/65/index.html
index 9611dab19..db6bfaddc 100644
--- a/archives/page/65/index.html
+++ b/archives/page/65/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/66/index.html b/archives/page/66/index.html
index f3e8610e3..5812fffb5 100644
--- a/archives/page/66/index.html
+++ b/archives/page/66/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/67/index.html b/archives/page/67/index.html
index 385eafa17..dbe424a83 100644
--- a/archives/page/67/index.html
+++ b/archives/page/67/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/68/index.html b/archives/page/68/index.html
index 8c35a2dd1..6ee6a31cd 100644
--- a/archives/page/68/index.html
+++ b/archives/page/68/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/69/index.html b/archives/page/69/index.html
index c94bec20b..53b9519c5 100644
--- a/archives/page/69/index.html
+++ b/archives/page/69/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/7/index.html b/archives/page/7/index.html
index b0ea015cf..5f6d74fee 100644
--- a/archives/page/7/index.html
+++ b/archives/page/7/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/70/index.html b/archives/page/70/index.html
index fb96d35af..154cedbcd 100644
--- a/archives/page/70/index.html
+++ b/archives/page/70/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/71/index.html b/archives/page/71/index.html
index e225d9551..7bbfc7673 100644
--- a/archives/page/71/index.html
+++ b/archives/page/71/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/72/index.html b/archives/page/72/index.html
index c34facc34..a1db0df5f 100644
--- a/archives/page/72/index.html
+++ b/archives/page/72/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/73/index.html b/archives/page/73/index.html
index 247c5ab8a..cc46bf5b2 100644
--- a/archives/page/73/index.html
+++ b/archives/page/73/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/74/index.html b/archives/page/74/index.html
index e150638e2..a106010cf 100644
--- a/archives/page/74/index.html
+++ b/archives/page/74/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/75/index.html b/archives/page/75/index.html
index 457eefa61..60cd3cd50 100644
--- a/archives/page/75/index.html
+++ b/archives/page/75/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/76/index.html b/archives/page/76/index.html
index c969ce956..43d8bd656 100644
--- a/archives/page/76/index.html
+++ b/archives/page/76/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/77/index.html b/archives/page/77/index.html
index ff8fc1687..57d92506c 100644
--- a/archives/page/77/index.html
+++ b/archives/page/77/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/78/index.html b/archives/page/78/index.html
index 01eb62395..e661fa978 100644
--- a/archives/page/78/index.html
+++ b/archives/page/78/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/79/index.html b/archives/page/79/index.html
index eeb1530b6..4d93249ce 100644
--- a/archives/page/79/index.html
+++ b/archives/page/79/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/8/index.html b/archives/page/8/index.html
index 6fa1d8beb..68cd66f13 100644
--- a/archives/page/8/index.html
+++ b/archives/page/8/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/a5d1dfda.html" class="archive-article-date">
+	      	<a href="/post/80cafdc8.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/a5d1dfda.html">1124. The longest period of performance One question daily</a>
+      <a class="archive-article-title" href="/post/80cafdc8.html">1017.Negative binary conversion</a>
     </h2>
   
 
@@ -346,10 +346,6 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
-        		</li>
       		
 		</ul>
 	</div>
@@ -422,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/80/index.html b/archives/page/80/index.html
index 9d7411d1f..e0951dd22 100644
--- a/archives/page/80/index.html
+++ b/archives/page/80/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/81/index.html b/archives/page/81/index.html
index 409e9e3a3..2dbc972ff 100644
--- a/archives/page/81/index.html
+++ b/archives/page/81/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/82/index.html b/archives/page/82/index.html
index 45c4dc4d6..ee93daf68 100644
--- a/archives/page/82/index.html
+++ b/archives/page/82/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/83/index.html b/archives/page/83/index.html
index 5b1129590..32d4f2aa1 100644
--- a/archives/page/83/index.html
+++ b/archives/page/83/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/84/index.html b/archives/page/84/index.html
index 5f753057b..4f8d31434 100644
--- a/archives/page/84/index.html
+++ b/archives/page/84/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/85/index.html b/archives/page/85/index.html
index ad6d64b23..9bd50065f 100644
--- a/archives/page/85/index.html
+++ b/archives/page/85/index.html
@@ -442,7 +442,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/86/index.html b/archives/page/86/index.html
index 5d03d7234..471049766 100644
--- a/archives/page/86/index.html
+++ b/archives/page/86/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/87/index.html b/archives/page/87/index.html
index e8ab757f8..82ea7bf22 100644
--- a/archives/page/87/index.html
+++ b/archives/page/87/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/88/index.html b/archives/page/88/index.html
index d31549730..6841cd7f9 100644
--- a/archives/page/88/index.html
+++ b/archives/page/88/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/89/index.html b/archives/page/89/index.html
index ba82ea174..062ef7032 100644
--- a/archives/page/89/index.html
+++ b/archives/page/89/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/9/index.html b/archives/page/9/index.html
index e369352d6..2afa06011 100644
--- a/archives/page/9/index.html
+++ b/archives/page/9/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/80cafdc8.html" class="archive-article-date">
+	      	<a href="/post/a5d1dfda.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/80cafdc8.html">1017.Negative binary conversion</a>
+      <a class="archive-article-title" href="/post/a5d1dfda.html">1124. The longest period of performance One question daily</a>
     </h2>
   
 
@@ -346,6 +346,10 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
+        		</li>
       		
 		</ul>
 	</div>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/90/index.html b/archives/page/90/index.html
index a684fe118..c1a176ca7 100644
--- a/archives/page/90/index.html
+++ b/archives/page/90/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/91/index.html b/archives/page/91/index.html
index 7be93e47a..b8c5c9d63 100644
--- a/archives/page/91/index.html
+++ b/archives/page/91/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/92/index.html b/archives/page/92/index.html
index 94d35ec3c..4daf97d32 100644
--- a/archives/page/92/index.html
+++ b/archives/page/92/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/93/index.html b/archives/page/93/index.html
index 0437d85b6..77195ea81 100644
--- a/archives/page/93/index.html
+++ b/archives/page/93/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/94/index.html b/archives/page/94/index.html
index b06f18c5c..e90adbc3b 100644
--- a/archives/page/94/index.html
+++ b/archives/page/94/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/95/index.html b/archives/page/95/index.html
index 65e37a333..832e45618 100644
--- a/archives/page/95/index.html
+++ b/archives/page/95/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/96/index.html b/archives/page/96/index.html
index 6cac55b38..8ad487b28 100644
--- a/archives/page/96/index.html
+++ b/archives/page/96/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/97/index.html b/archives/page/97/index.html
index eca7ccd5d..d724f201c 100644
--- a/archives/page/97/index.html
+++ b/archives/page/97/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/98/index.html b/archives/page/98/index.html
index 3b4ab8b09..481489dbc 100644
--- a/archives/page/98/index.html
+++ b/archives/page/98/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/archives/page/99/index.html b/archives/page/99/index.html
index d64430837..e10c0e0da 100644
--- a/archives/page/99/index.html
+++ b/archives/page/99/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/atom.xml b/atom.xml
index 3f6f0b92f..8eeec545b 100644
--- a/atom.xml
+++ b/atom.xml
@@ -6,7 +6,7 @@
   <link href="https://longsizhuo.github.io/atom.xml" rel="self"/>
   
   <link href="https://longsizhuo.github.io/"/>
-  <updated>2024-09-18T01:00:36.787Z</updated>
+  <updated>2024-09-18T05:45:56.001Z</updated>
   <id>https://longsizhuo.github.io/</id>
   
   <author>
@@ -21,9 +21,9 @@
     <link href="https://longsizhuo.github.io/post/becdc081.html"/>
     <id>https://longsizhuo.github.io/post/becdc081.html</id>
     <published>2024-09-18T01:00:36.787Z</published>
-    <updated>2024-09-18T01:00:36.787Z</updated>
+    <updated>2024-09-18T05:45:56.001Z</updated>
     
-    <content type="html"><![CDATA[<h1 id="Exercise-1"><a href="#Exercise-1" class="headerlink" title="Exercise 1:"></a>Exercise 1:</h1><p>This exercise focuses on input validation and formatting floating-point numbers. The goal is to prompt the user to enter a floating-point number between -1 and 1 (exclusive). If the input is valid, the program rounds the number to two decimal places and prints it. Otherwise, it keeps prompting the user until a valid input is provided.<br>Key Points:</p><ul><li>The program uses a try-except block to catch invalid inputs (e.g., strings that cannot be converted to floats).</li><li>The input() function is wrapped in an infinite while loop to continuously ask for input until the correct condition is met.</li></ul><p>In the updated version of Exercise 1, we use the formatting :.2f instead of round(). Here’s the key difference between the two:</p><ul><li><code>round()</code>: This is a Python built-in function that rounds a number to a specified number of decimal places. For example, round(1.236, 2) will return 1.24. However, the output of round() is still a float, but it does not guarantee a fixed number of decimal places when printed. For instance, round(1.0001, 2) would return 1.0 and only display one decimal place, not two.</li><li><code>:.2f</code>: This is part of Python’s string formatting and ensures the number is displayed with exactly two decimal places, no matter what the number is. It also rounds the number appropriately. For instance, number = 1.0 formatted as f”{number:.2f}” will print 1.00. This makes :.2f particularly useful for consistent display of decimal places, which is important for formatting output for users.</li></ul><figure class="highlight python"><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"><span class="keyword">while</span> <span class="literal">True</span>:</span><br><span class="line">    <span class="keyword">try</span>:</span><br><span class="line">        i = <span class="built_in">input</span>(<span class="string">&#x27;Enter a floating point number between -1 and 1 excluded: &#x27;</span>)</span><br><span class="line">        number = <span class="built_in">float</span>(i)</span><br><span class="line">        <span class="keyword">if</span> -<span class="number">1</span> &lt; number &lt; <span class="number">1</span>:</span><br><span class="line">            <span class="comment"># not using round() here because it rounds to the nearest even number</span></span><br><span class="line">            <span class="built_in">print</span>(<span class="string">f&#x27;\nUp to +/-0.005, you input <span class="subst">&#123;number:<span class="number">.2</span>f&#125;</span>&#x27;</span>)</span><br><span class="line">        <span class="keyword">else</span>:</span><br><span class="line">            <span class="keyword">raise</span> ValueError</span><br><span class="line">        <span class="keyword">break</span></span><br><span class="line">    <span class="keyword">except</span> ValueError:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;You got that wrong, try again!\n&quot;</span>)</span><br></pre></td></tr></table></figure><h1 id="Exercise-2"><a href="#Exercise-2" class="headerlink" title="Exercise 2:"></a>Exercise 2:</h1><p>This exercise involves processing a block of text and formatting it into sentences. Each sentence should have its first word capitalized, and the remaining words should be in lowercase. The task is to handle spaces and punctuation properly.</p><p>Key Points:</p><ul><li>A regular expression (re.sub) is used to replace multiple spaces with a single space.</li><li>Another regular expression (re.split) is used to split the text into sentences while preserving punctuation marks.</li><li>After splitting, the sentences are processed: the first word is capitalized, and all other words are made lowercase.</li><li>Finally, the processed sentences are recombined into a single formatted text.</li></ul><h3 id="Why-use-re-in-Exercise-2-and-what-is-re"><a href="#Why-use-re-in-Exercise-2-and-what-is-re" class="headerlink" title="Why use re in Exercise 2, and what is re?"></a>Why use re in Exercise 2, and what is re?</h3><p>In Exercise 2, we use re (Python’s regular expression module) to process and format the text input. Let’s break down why re is used and what it is:</p><h3 id="What-is-re"><a href="#What-is-re" class="headerlink" title="What is re?"></a>What is re?</h3><p>re stands for regular expressions, which are powerful tools for matching patterns in strings. The re module in Python allows you to work with regular expressions to search, split, and manipulate text based on specific patterns. Regular expressions are highly flexible and efficient for handling complex string operations.</p><h3 id="Why-use-re-in-Exercise-2"><a href="#Why-use-re-in-Exercise-2" class="headerlink" title="Why use re in Exercise 2?"></a>Why use re in Exercise 2?</h3><p>In this exercise, we need to handle several complex text manipulations:</p><ol><li>Replace multiple spaces with a single space: Sentences in the text may have irregular spaces between words, so we need to normalize these spaces. Instead of writing loops or conditions to handle each case, we use re.sub() with a pattern r’\s+’ to easily match all occurrences of one or more spaces and replace them with a single space.</li><li>Split sentences while preserving punctuation: We need to split the text into individual sentences, where each sentence is followed by punctuation (e.g., ‘.’, ‘!’, or ‘?’). The function re.split(r’([.!?])’, text) allows us to split the text based on punctuation while keeping the punctuation marks, which is crucial for proper sentence reconstruction.</li></ol><p>Regular expressions allow us to:</p><ul><li>Efficiently match patterns like spaces or punctuation.</li><li>Perform complex text transformations with minimal code.</li><li>Handle edge cases that would otherwise require more manual handling.</li></ul><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="comment"># Assume that the argument text is a string that denotes a text,</span></span><br><span class="line"><span class="comment"># defined as one or more sentences, two successive</span></span><br><span class="line"><span class="comment"># sentences being separated by at least one space,</span></span><br><span class="line"><span class="comment"># the first sentence being possibly preceded with spaces,</span></span><br><span class="line"><span class="comment"># the last sentence being possibly followed by spaces,</span></span><br><span class="line"><span class="comment"># a sentence being defined as at least two words,</span></span><br><span class="line"><span class="comment"># two successive words in a sentence being separated by</span></span><br><span class="line"><span class="comment"># at least one space, a word being defined as a sequence</span></span><br><span class="line"><span class="comment"># of (uppercase or lowercase) letters,</span></span><br><span class="line"><span class="comment"># - possibly followed by a comma for a word that is</span></span><br><span class="line"><span class="comment">#   not the last one in its sentence,</span></span><br><span class="line"><span class="comment"># - definitely followed by a full stop, an exclamation mark</span></span><br><span class="line"><span class="comment">#   or a question mark for a word that is the last one</span></span><br><span class="line"><span class="comment">#   in its sentence.</span></span><br><span class="line"><span class="keyword">import</span> re</span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">f2</span>(<span class="params">text</span>):</span><br><span class="line">    <span class="comment"># Use regular expression to replace multiple spaces with a single space</span></span><br><span class="line">    text = re.sub(<span class="string">r&#x27;\s+&#x27;</span>, <span class="string">&#x27; &#x27;</span>, text.strip())</span><br><span class="line"></span><br><span class="line">    <span class="comment"># Correct way to split sentences while preserving delimiters</span></span><br><span class="line">    sentences = re.split(<span class="string">r&#x27;([.!?])&#x27;</span>, text)</span><br><span class="line"></span><br><span class="line">    <span class="comment"># Process sentences and punctuation separately</span></span><br><span class="line">    new_text = []</span><br><span class="line">    i = <span class="number">0</span></span><br><span class="line">    <span class="keyword">while</span> i &lt; <span class="built_in">len</span>(sentences) - <span class="number">1</span>:</span><br><span class="line">        sentence = sentences[i].strip()</span><br><span class="line">        <span class="keyword">if</span> sentence:</span><br><span class="line">            words = sentence.split()</span><br><span class="line">            <span class="comment"># Capitalize the first word and lower the rest</span></span><br><span class="line">            words[<span class="number">0</span>] = words[<span class="number">0</span>].capitalize()</span><br><span class="line">            <span class="keyword">for</span> j <span class="keyword">in</span> <span class="built_in">range</span>(<span class="number">1</span>, <span class="built_in">len</span>(words)):</span><br><span class="line">                words[j] = words[j].lower()</span><br><span class="line">            <span class="comment"># Rebuild the sentence and add back the punctuation</span></span><br><span class="line">            new_text.append(<span class="string">&#x27; &#x27;</span>.join(words) + sentences[i + <span class="number">1</span>])</span><br><span class="line">        i += <span class="number">2</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="string">&#x27; &#x27;</span>.join(new_text)</span><br></pre></td></tr></table></figure><h1 id="Exercise-3"><a href="#Exercise-3" class="headerlink" title="Exercise 3:"></a>Exercise 3:</h1><p>This exercise works with lists of integers and aims to repeatedly remove the first and last elements of the list as long as they are equal. The list is treated as a double-ended queue (deque) for efficient removal of elements from both ends.</p><p>Key Points:</p><ul><li>The deque data structure is used because it provides O(1) operations for popping elements from both ends, which is more efficient than using lists.</li><li>The program checks if the first and last elements of the deque are equal and removes them until this condition is no longer met.</li><li>The deque is converted back to a list before being returned.</li></ul><h3 id="Why-is-deque-more-efficient-than-list-in-Exercise-3"><a href="#Why-is-deque-more-efficient-than-list-in-Exercise-3" class="headerlink" title="Why is deque more efficient than list in Exercise 3?"></a>Why is <code>deque</code> more efficient than <code>list</code> in Exercise 3?</h3><p>In Exercise 3, we are frequently removing elements from both the front (left) and the back (right) of the list. This is where using a deque (double-ended queue) from Python’s collections module becomes more efficient compared to using a standard list.</p><p>Here’s why:</p><ul><li><p>List Behavior: When you use a standard list and call list.pop(0) to remove the first (leftmost) element, it requires shifting all the remaining elements one position to the left. This shift operation takes linear time—O(n), where n is the number of elements in the list. This means that for every removal from the front, the larger the list, the slower the operation becomes.</p><ul><li>Removing from the right side of a list using list.pop() is an O(1) operation (constant time) because no elements need to be shifted, making it efficient only when working from the end of the list.</li></ul></li><li><p>Deque Behavior: A deque (double-ended queue) is specifically designed to support efficient append and pop operations from both ends. In a deque, both popleft() and pop() operations take constant time—O(1)—because the deque is implemented as a doubly linked list. This means no elements need to be shifted when popping from the left or right.</p><ul><li>In Exercise 3, where we need to frequently remove elements from both ends of the list, using a deque ensures that both the removal from the left (popleft()) and the right (pop()) are performed in constant time. This makes the entire process much more efficient, especially for large lists where repeated operations would slow down if we used a standard list.</li></ul></li></ul><h3 id="What-is-a-deque"><a href="#What-is-a-deque" class="headerlink" title="What is a deque?"></a>What is a <code>deque</code>?</h3><p>A deque (short for “double-ended queue”) is a data structure that allows for fast appending and popping of elements from both ends. It is part of the collections module in Python and is optimized for scenarios where you need to efficiently add or remove elements from both ends of the sequence.</p><h3 id="Key-Features-of-deque"><a href="#Key-Features-of-deque" class="headerlink" title="Key Features of deque:"></a>Key Features of <code>deque</code>:</h3><ul><li><code>O(1)</code> time complexity for operations on both ends (append, pop, appendleft, popleft).</li><li>It is implemented as a <strong>doubly linked list</strong>, meaning each element contains a reference to both the previous and next elements, allowing efficient traversal in both directions.</li><li><code>deque</code> is ideal for scenarios where you need frequent and efficient insertions and removals from both the front and back of a sequence, unlike a standard list where such operations are costly at the front.</li></ul><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="comment"># Assume that the argument L is a list of integers.</span></span><br><span class="line"><span class="comment">#</span></span><br><span class="line"><span class="comment"># For as long as the list has at least two elements</span></span><br><span class="line"><span class="comment"># and the first and last elements of the list are equal,</span></span><br><span class="line"><span class="comment"># pop out those elements.</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># def f3(L):</span></span><br><span class="line"><span class="comment"># # Remove the list as long as it has at least two elements and the first and last elements are equal</span></span><br><span class="line"><span class="comment">#     while len(L) &gt; 1 and L[0] == L[-1]:</span></span><br><span class="line"><span class="comment">#         L.pop(0) # Remove the first element</span></span><br><span class="line"><span class="comment">#         L.pop(-1) # Remove the last element</span></span><br><span class="line"><span class="comment">#     return L</span></span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">from</span> collections <span class="keyword">import</span> deque</span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">f3</span>(<span class="params">L</span>):</span><br><span class="line">    L = deque(L)  <span class="comment"># Convert the list to a deque for efficient popping from both ends</span></span><br><span class="line">    <span class="comment"># Continue removing elements while there are at least two elements and the first and last are equal</span></span><br><span class="line">    <span class="keyword">while</span> <span class="built_in">len</span>(L) &gt; <span class="number">1</span> <span class="keyword">and</span> L[<span class="number">0</span>] == L[-<span class="number">1</span>]:</span><br><span class="line">        L.popleft()  <span class="comment"># Efficiently remove the first element (O(1) operation)</span></span><br><span class="line">        L.pop()      <span class="comment"># Efficiently remove the last element (O(1) operation)</span></span><br><span class="line">    <span class="keyword">return</span> <span class="built_in">list</span>(L)   <span class="comment"># Convert the deque back to a list and return it</span></span><br></pre></td></tr></table></figure><h1 id="Exercise-4"><a href="#Exercise-4" class="headerlink" title="Exercise 4:"></a>Exercise 4:</h1><p>This exercise deals with lists of integers that are in increasing order. The goal is to remove any element whose value is equal to its index in the list. The program iterates over the list and removes such elements, ensuring the index is correctly adjusted after each removal.</p><p>Key Points:</p><ul><li>The program uses a while loop and checks if the element at index i is equal to i. If true, it removes the element and does not increment i, so that the next element at the same position is checked.</li><li>The remove() function is used to delete the element, which is appropriate for this task.</li><li>Care is taken to ensure that index adjustments are handled correctly.</li></ul><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="comment"># Assume that the argument L is a list of integers</span></span><br><span class="line"><span class="comment"># that forms an increasing sequence.</span></span><br><span class="line"><span class="comment">#</span></span><br><span class="line"><span class="comment"># For as long as some member of the list is equal to its index</span></span><br><span class="line"><span class="comment"># in the list, pop out the leftmost such member of the list.</span></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">f4</span>(<span class="params">L</span>):</span><br><span class="line">    i = <span class="number">0</span></span><br><span class="line">    <span class="keyword">while</span> i &lt; <span class="built_in">len</span>(L):</span><br><span class="line">        <span class="keyword">if</span> L[i] == i:</span><br><span class="line">            L.remove(L[i])  <span class="comment"># Using remove() here since popleft() removes from the left only</span></span><br><span class="line">        <span class="keyword">else</span>:</span><br><span class="line">            i += <span class="number">1</span>  <span class="comment"># Only increment i if no element was removed</span></span><br><span class="line">    <span class="keyword">return</span> L  <span class="comment"># Convert deque back to list</span></span><br></pre></td></tr></table></figure><h1 id="Exercise-5"><a href="#Exercise-5" class="headerlink" title="Exercise 5:"></a>Exercise 5:</h1><p>This exercise works with a circular list of integers. The task is to identify elements that are both larger than one of their adjacent elements and smaller than the other. The result is returned as a dictionary where each key is such an element, and its value is a pair of the adjacent elements (one smaller and one larger).</p><p>Key Points:</p><ul><li>The list is treated as circular, meaning the first element is considered adjacent to the last element.</li><li>The program iterates through the list, compares each element with its neighbors, and stores those that meet the criteria.</li><li>For each valid element, the adjacent smaller and larger elements are stored in a dictionary.</li></ul><p>To solve this problem, we need to create a dictionary D where each key is an element in the list L that satisfies a certain condition, and the value is a tuple of two elements. The first element of this tuple is the adjacent element that is smaller than the current key, and the second element is the adjacent element that is larger than the current key.</p><p>Steps:</p><ol><li>Loop structure: Check each element.</li><li>Processing of adjacent elements: Since the list is cyclic, the previous element of the first element is the last element, and the next element of the last element is the first element.</li><li>Condition check: Find the adjacent elements that are smaller and larger than the current element, and add them to the result dictionary.</li></ol><figure class="highlight python"><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"><span class="comment"># Assume that the argument L is a list of at least 3 distinct integers.</span></span><br><span class="line"><span class="comment">#</span></span><br><span class="line"><span class="comment"># Returns a dictionary D whose keys are those of the members e of L,</span></span><br><span class="line"><span class="comment"># if any, that are</span></span><br><span class="line"><span class="comment"># - smaller than the element right before or right after, and</span></span><br><span class="line"><span class="comment"># - larger than the element right before or right after.</span></span><br><span class="line"><span class="comment"># It is considered that</span></span><br><span class="line"><span class="comment"># - the first member of L is right after the last member of L, and</span></span><br><span class="line"><span class="comment"># - the last member of L is right before the first member of L</span></span><br><span class="line"><span class="comment"># (as if making a ring out of the list).</span></span><br><span class="line"><span class="comment"># For a key e in D, the associated value is the pair whose</span></span><br><span class="line"><span class="comment"># first element is the member of L that is right before or right after</span></span><br><span class="line"><span class="comment"># e and smaller than e, and whose second element is the member of L</span></span><br><span class="line"><span class="comment"># that is right before or right after e and greater than e.</span></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">f5</span>(<span class="params">L</span>):</span><br><span class="line">    D = &#123;&#125;</span><br><span class="line">    <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(L)):</span><br><span class="line">        m = L[i - <span class="number">1</span>]</span><br><span class="line">        n = L[(i + <span class="number">1</span>) % <span class="built_in">len</span>(L)]</span><br><span class="line">        <span class="keyword">if</span> n &lt; m:</span><br><span class="line">            m, n = n, m</span><br><span class="line">        <span class="keyword">if</span> m &lt; L[i] &lt; n:</span><br><span class="line">            D[L[i]] = m, n</span><br><span class="line">    <span class="keyword">return</span> D</span><br></pre></td></tr></table></figure><h1 id="Exercise-6"><a href="#Exercise-6" class="headerlink" title="Exercise 6:"></a>Exercise 6:</h1><p>This exercise deals with factorizing an integer n into the form 2^k * m, where m is an odd number. If n is negative, the program adds a negative sign to the output. If n is zero, it prints a special message.</p><p>Key Points:</p><ul><li>The program uses a loop to divide n by 2 until n is no longer divisible by 2, counting the number of divisions (k).</li><li>The absolute value of n is used to ensure correct handling of negative numbers, and a sign is added to the final result if the original number was negative.</li><li>The program handles the special case where n = 0 by printing a unique message.</li></ul><p>More Details:</p><ol><li>You need to express the given integer n as n = 2^k * m.<ul><li>k represents the number of times n can be divided by 2. In other words, it is the power of 2 in the factorization of n.</li><li>m is the remaining odd part after dividing out all factors of 2.</li></ul></li><li>If n is negative, the output should include a negative sign.</li><li>Special case: If n = 0, a specific message should be printed.</li><li>The result is printed directly, not returned.</li></ol><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="comment"># Assume that the argument n is an integer.</span></span><br><span class="line"><span class="comment">#</span></span><br><span class="line"><span class="comment"># The output is printed out, not returned.</span></span><br><span class="line"><span class="comment">#</span></span><br><span class="line"><span class="comment"># You might find the abs() function useful.</span></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">f6</span>(<span class="params">n</span>):</span><br><span class="line">    <span class="keyword">if</span> n == <span class="number">0</span>:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;0 = 2^k * 0 for all integers k!&quot;</span>)</span><br><span class="line">    <span class="keyword">else</span>:</span><br><span class="line">        k = <span class="number">0</span></span><br><span class="line">        ori = n</span><br><span class="line">        <span class="keyword">if</span> n &lt; <span class="number">0</span>:</span><br><span class="line">            sign = <span class="string">&#x27;-&#x27;</span></span><br><span class="line">            n = -n</span><br><span class="line">        <span class="keyword">else</span>:</span><br><span class="line">            sign = <span class="string">&#x27;&#x27;</span></span><br><span class="line">        <span class="keyword">while</span> n % <span class="number">2</span> == <span class="number">0</span>:</span><br><span class="line">            n //= <span class="number">2</span></span><br><span class="line">            k += <span class="number">1</span></span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;<span class="subst">&#123;ori&#125;</span> = <span class="subst">&#123;sign&#125;</span>2^<span class="subst">&#123;k&#125;</span> * <span class="subst">&#123;n&#125;</span>&quot;</span>)</span><br><span class="line">    <span class="keyword">return</span></span><br></pre></td></tr></table></figure>]]></content>
+    <content type="html"><![CDATA[<h1 id="Exercise-1"><a href="#Exercise-1" class="headerlink" title="Exercise 1:"></a>Exercise 1:</h1><p>This exercise focuses on input validation and formatting floating-point numbers. The goal is to prompt the user to enter a floating-point number between -1 and 1 (exclusive). If the input is valid, the program rounds the number to two decimal places and prints it. Otherwise, it keeps prompting the user until a valid input is provided.<br>Key Points:</p><ul><li>The program uses a try-except block to catch invalid inputs (e.g., strings that cannot be converted to floats).</li><li>The input() function is wrapped in an infinite while loop to continuously ask for input until the correct condition is met.</li></ul><p>In the updated version of Exercise 1, we use the formatting :.2f instead of round(). Here’s the key difference between the two:</p><ul><li><code>round()</code>: This is a Python built-in function that rounds a number to a specified number of decimal places. For example, round(1.236, 2) will return 1.24. However, the output of round() is still a float, but it does not guarantee a fixed number of decimal places when printed. For instance, round(1.0001, 2) would return 1.0 and only display one decimal place, not two.</li><li><code>:.2f</code>: This is part of Python’s string formatting and ensures the number is displayed with exactly two decimal places, no matter what the number is. It also rounds the number appropriately. For instance, number = 1.0 formatted as f”{number:.2f}” will print 1.00. This makes :.2f particularly useful for consistent display of decimal places, which is important for formatting output for users.</li></ul><figure class="highlight python"><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"><span class="keyword">while</span> <span class="literal">True</span>:</span><br><span class="line">    <span class="keyword">try</span>:</span><br><span class="line">        i = <span class="built_in">input</span>(<span class="string">&#x27;Enter a floating point number between -1 and 1 excluded: &#x27;</span>)</span><br><span class="line">        number = <span class="built_in">float</span>(i)</span><br><span class="line">        <span class="keyword">if</span> -<span class="number">1</span> &lt; number &lt; <span class="number">1</span>:</span><br><span class="line">            <span class="comment"># not using round() here because it rounds to the nearest even number</span></span><br><span class="line">            <span class="built_in">print</span>(<span class="string">f&#x27;\nUp to +/-0.005, you input <span class="subst">&#123;number:<span class="number">.2</span>f&#125;</span>&#x27;</span>)</span><br><span class="line">        <span class="keyword">else</span>:</span><br><span class="line">            <span class="keyword">raise</span> ValueError</span><br><span class="line">        <span class="keyword">break</span></span><br><span class="line">    <span class="keyword">except</span> ValueError:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;You got that wrong, try again!\n&quot;</span>)</span><br></pre></td></tr></table></figure><h1 id="Exercise-2"><a href="#Exercise-2" class="headerlink" title="Exercise 2:"></a>Exercise 2:</h1><p>This exercise involves processing a block of text and formatting it into sentences. Each sentence should have its first word capitalized, and the remaining words should be in lowercase. The task is to handle spaces and punctuation properly.</p><p>Key Points:</p><ul><li>A regular expression (re.sub) is used to replace multiple spaces with a single space.</li><li>Another regular expression (re.split) is used to split the text into sentences while preserving punctuation marks.</li><li>After splitting, the sentences are processed: the first word is capitalized, and all other words are made lowercase.</li><li>Finally, the processed sentences are recombined into a single formatted text.</li></ul><h3 id="Why-use-re-in-Exercise-2-and-what-is-re"><a href="#Why-use-re-in-Exercise-2-and-what-is-re" class="headerlink" title="Why use re in Exercise 2, and what is re?"></a>Why use re in Exercise 2, and what is re?</h3><p>In Exercise 2, we use re (Python’s regular expression module) to process and format the text input. Let’s break down why re is used and what it is:</p><h3 id="What-is-re"><a href="#What-is-re" class="headerlink" title="What is re?"></a>What is re?</h3><p>re stands for regular expressions, which are powerful tools for matching patterns in strings. The re module in Python allows you to work with regular expressions to search, split, and manipulate text based on specific patterns. Regular expressions are highly flexible and efficient for handling complex string operations.</p><h3 id="Why-use-re-in-Exercise-2"><a href="#Why-use-re-in-Exercise-2" class="headerlink" title="Why use re in Exercise 2?"></a>Why use re in Exercise 2?</h3><p>In this exercise, we need to handle several complex text manipulations:</p><ol><li>Replace multiple spaces with a single space: Sentences in the text may have irregular spaces between words, so we need to normalize these spaces. Instead of writing loops or conditions to handle each case, we use re.sub() with a pattern r’\s+’ to easily match all occurrences of one or more spaces and replace them with a single space.</li><li>Split sentences while preserving punctuation: We need to split the text into individual sentences, where each sentence is followed by punctuation (e.g., ‘.’, ‘!’, or ‘?’). The function re.split(r’([.!?])’, text) allows us to split the text based on punctuation while keeping the punctuation marks, which is crucial for proper sentence reconstruction.</li></ol><p>Regular expressions allow us to:</p><ul><li>Efficiently match patterns like spaces or punctuation.</li><li>Perform complex text transformations with minimal code.</li><li>Handle edge cases that would otherwise require more manual handling.</li></ul><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="comment"># Assume that the argument text is a string that denotes a text,</span></span><br><span class="line"><span class="comment"># defined as one or more sentences, two successive</span></span><br><span class="line"><span class="comment"># sentences being separated by at least one space,</span></span><br><span class="line"><span class="comment"># the first sentence being possibly preceded with spaces,</span></span><br><span class="line"><span class="comment"># the last sentence being possibly followed by spaces,</span></span><br><span class="line"><span class="comment"># a sentence being defined as at least two words,</span></span><br><span class="line"><span class="comment"># two successive words in a sentence being separated by</span></span><br><span class="line"><span class="comment"># at least one space, a word being defined as a sequence</span></span><br><span class="line"><span class="comment"># of (uppercase or lowercase) letters,</span></span><br><span class="line"><span class="comment"># - possibly followed by a comma for a word that is</span></span><br><span class="line"><span class="comment">#   not the last one in its sentence,</span></span><br><span class="line"><span class="comment"># - definitely followed by a full stop, an exclamation mark</span></span><br><span class="line"><span class="comment">#   or a question mark for a word that is the last one</span></span><br><span class="line"><span class="comment">#   in its sentence.</span></span><br><span class="line"><span class="keyword">import</span> re</span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">f2</span>(<span class="params">text</span>):</span><br><span class="line">    <span class="comment"># Use regular expression to replace multiple spaces with a single space</span></span><br><span class="line">    text = re.sub(<span class="string">r&#x27;\s+&#x27;</span>, <span class="string">&#x27; &#x27;</span>, text.strip())</span><br><span class="line"></span><br><span class="line">    <span class="comment"># Correct way to split sentences while preserving delimiters</span></span><br><span class="line">    sentences = re.split(<span class="string">r&#x27;([.!?])&#x27;</span>, text)</span><br><span class="line"></span><br><span class="line">    <span class="comment"># Process sentences and punctuation separately</span></span><br><span class="line">    new_text = []</span><br><span class="line">    i = <span class="number">0</span></span><br><span class="line">    <span class="keyword">while</span> i &lt; <span class="built_in">len</span>(sentences) - <span class="number">1</span>:</span><br><span class="line">        sentence = sentences[i].strip()</span><br><span class="line">        <span class="keyword">if</span> sentence:</span><br><span class="line">            words = sentence.split()</span><br><span class="line">            <span class="comment"># Capitalize the first word and lower the rest</span></span><br><span class="line">            words[<span class="number">0</span>] = words[<span class="number">0</span>].capitalize()</span><br><span class="line">            <span class="keyword">for</span> j <span class="keyword">in</span> <span class="built_in">range</span>(<span class="number">1</span>, <span class="built_in">len</span>(words)):</span><br><span class="line">                words[j] = words[j].lower()</span><br><span class="line">            <span class="comment"># Rebuild the sentence and add back the punctuation</span></span><br><span class="line">            new_text.append(<span class="string">&#x27; &#x27;</span>.join(words) + sentences[i + <span class="number">1</span>])</span><br><span class="line">        i += <span class="number">2</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="string">&#x27; &#x27;</span>.join(new_text)</span><br></pre></td></tr></table></figure><h1 id="Exercise-3"><a href="#Exercise-3" class="headerlink" title="Exercise 3:"></a>Exercise 3:</h1><p>This exercise works with lists of integers and aims to repeatedly remove the first and last elements of the list as long as they are equal. The list is treated as a double-ended queue (deque) for efficient removal of elements from both ends.</p><p>Key Points:</p><ul><li>The deque data structure is used because it provides O(1) operations for popping elements from both ends, which is more efficient than using lists.</li><li>The program checks if the first and last elements of the deque are equal and removes them until this condition is no longer met.</li><li>The deque is converted back to a list before being returned.</li></ul><h3 id="Why-is-deque-more-efficient-than-list-in-Exercise-3"><a href="#Why-is-deque-more-efficient-than-list-in-Exercise-3" class="headerlink" title="Why is deque more efficient than list in Exercise 3?"></a>Why is <code>deque</code> more efficient than <code>list</code> in Exercise 3?</h3><p>In Exercise 3, we are frequently removing elements from both the front (left) and the back (right) of the list. This is where using a deque (double-ended queue) from Python’s collections module becomes more efficient compared to using a standard list.</p><p>Here’s why:</p><ul><li><p>List Behavior: When you use a standard list and call list.pop(0) to remove the first (leftmost) element, it requires shifting all the remaining elements one position to the left. This shift operation takes linear time—O(n), where n is the number of elements in the list. This means that for every removal from the front, the larger the list, the slower the operation becomes.</p><ul><li>Removing from the right side of a list using list.pop() is an O(1) operation (constant time) because no elements need to be shifted, making it efficient only when working from the end of the list.</li></ul></li><li><p>Deque Behavior: A deque (double-ended queue) is specifically designed to support efficient append and pop operations from both ends. In a deque, both popleft() and pop() operations take constant time—O(1)—because the deque is implemented as a doubly linked list. This means no elements need to be shifted when popping from the left or right.</p><ul><li>In Exercise 3, where we need to frequently remove elements from both ends of the list, using a deque ensures that both the removal from the left (popleft()) and the right (pop()) are performed in constant time. This makes the entire process much more efficient, especially for large lists where repeated operations would slow down if we used a standard list.</li></ul></li></ul><h3 id="What-is-a-deque"><a href="#What-is-a-deque" class="headerlink" title="What is a deque?"></a>What is a <code>deque</code>?</h3><p>A deque (short for “double-ended queue”) is a data structure that allows for fast appending and popping of elements from both ends. It is part of the collections module in Python and is optimized for scenarios where you need to efficiently add or remove elements from both ends of the sequence.</p><h3 id="Key-Features-of-deque"><a href="#Key-Features-of-deque" class="headerlink" title="Key Features of deque:"></a>Key Features of <code>deque</code>:</h3><ul><li><code>O(1)</code> time complexity for operations on both ends (append, pop, appendleft, popleft).</li><li>It is implemented as a <strong>doubly linked list</strong>, meaning each element contains a reference to both the previous and next elements, allowing efficient traversal in both directions.</li><li><code>deque</code> is ideal for scenarios where you need frequent and efficient insertions and removals from both the front and back of a sequence, unlike a standard list where such operations are costly at the front.</li></ul><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="comment"># Assume that the argument L is a list of integers.</span></span><br><span class="line"><span class="comment">#</span></span><br><span class="line"><span class="comment"># For as long as the list has at least two elements</span></span><br><span class="line"><span class="comment"># and the first and last elements of the list are equal,</span></span><br><span class="line"><span class="comment"># pop out those elements.</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># def f3(L):</span></span><br><span class="line"><span class="comment"># # Remove the list as long as it has at least two elements and the first and last elements are equal</span></span><br><span class="line"><span class="comment">#     while len(L) &gt; 1 and L[0] == L[-1]:</span></span><br><span class="line"><span class="comment">#         L.pop(0) # Remove the first element</span></span><br><span class="line"><span class="comment">#         L.pop(-1) # Remove the last element</span></span><br><span class="line"><span class="comment">#     return L</span></span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">from</span> collections <span class="keyword">import</span> deque</span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">f3</span>(<span class="params">L</span>):</span><br><span class="line">    L = deque(L)  <span class="comment"># Convert the list to a deque for efficient popping from both ends</span></span><br><span class="line">    <span class="comment"># Continue removing elements while there are at least two elements and the first and last are equal</span></span><br><span class="line">    <span class="keyword">while</span> <span class="built_in">len</span>(L) &gt; <span class="number">1</span> <span class="keyword">and</span> L[<span class="number">0</span>] == L[-<span class="number">1</span>]:</span><br><span class="line">        L.popleft()  <span class="comment"># Efficiently remove the first element (O(1) operation)</span></span><br><span class="line">        L.pop()      <span class="comment"># Efficiently remove the last element (O(1) operation)</span></span><br><span class="line">    <span class="keyword">return</span> <span class="built_in">list</span>(L)   <span class="comment"># Convert the deque back to a list and return it</span></span><br></pre></td></tr></table></figure><h1 id="Exercise-4"><a href="#Exercise-4" class="headerlink" title="Exercise 4:"></a>Exercise 4:</h1><p>This exercise deals with lists of integers that are in increasing order. The goal is to remove any element whose value is equal to its index in the list. The program iterates over the list and removes such elements, ensuring the index is correctly adjusted after each removal.</p><p>Key Points:</p><ul><li>The program uses a while loop and checks if the element at index i is equal to i. If true, it removes the element and does not increment i, so that the next element at the same position is checked.</li><li>The remove() function is used to delete the element, which is appropriate for this task.</li><li>Care is taken to ensure that index adjustments are handled correctly.</li></ul><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="comment"># Assume that the argument L is a list of integers</span></span><br><span class="line"><span class="comment"># that forms an increasing sequence.</span></span><br><span class="line"><span class="comment">#</span></span><br><span class="line"><span class="comment"># For as long as some member of the list is equal to its index</span></span><br><span class="line"><span class="comment"># in the list, pop out the leftmost such member of the list.</span></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">f4</span>(<span class="params">L</span>):</span><br><span class="line">    i = <span class="number">0</span></span><br><span class="line">    <span class="keyword">while</span> i &lt; <span class="built_in">len</span>(L):</span><br><span class="line">        <span class="keyword">if</span> L[i] == i:</span><br><span class="line">            L.remove(L[i])  <span class="comment"># Using remove() here since popleft() removes from the left only</span></span><br><span class="line">        <span class="keyword">else</span>:</span><br><span class="line">            i += <span class="number">1</span>  <span class="comment"># Only increment i if no element was removed</span></span><br><span class="line">    <span class="keyword">return</span> L  <span class="comment"># Convert deque back to list</span></span><br></pre></td></tr></table></figure><h1 id="Exercise-5"><a href="#Exercise-5" class="headerlink" title="Exercise 5:"></a>Exercise 5:</h1><p>This exercise works with a circular list of integers. The task is to identify elements that are both larger than one of their adjacent elements and smaller than the other. The result is returned as a dictionary where each key is such an element, and its value is a pair of the adjacent elements (one smaller and one larger).</p><p>Key Points:</p><ul><li>The list is treated as circular, meaning the first element is considered adjacent to the last element.</li><li>The program iterates through the list, compares each element with its neighbors, and stores those that meet the criteria.</li><li>For each valid element, the adjacent smaller and larger elements are stored in a dictionary.</li></ul><p>To solve this problem, we need to create a dictionary D where each key is an element in the list L that satisfies a certain condition, and the value is a tuple of two elements. The first element of this tuple is the adjacent element that is smaller than the current key, and the second element is the adjacent element that is larger than the current key.</p><p>Steps:</p><ol><li>Loop structure: Check each element.</li><li>Processing of adjacent elements: Since the list is cyclic, the previous element of the first element is the last element, and the next element of the last element is the first element.</li><li>Condition check: Find the adjacent elements that are smaller and larger than the current element, and add them to the result dictionary.</li></ol><figure class="highlight python"><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"><span class="comment"># Assume that the argument L is a list of at least 3 distinct integers.</span></span><br><span class="line"><span class="comment">#</span></span><br><span class="line"><span class="comment"># Returns a dictionary D whose keys are those of the members e of L,</span></span><br><span class="line"><span class="comment"># if any, that are</span></span><br><span class="line"><span class="comment"># - smaller than the element right before or right after, and</span></span><br><span class="line"><span class="comment"># - larger than the element right before or right after.</span></span><br><span class="line"><span class="comment"># It is considered that</span></span><br><span class="line"><span class="comment"># - the first member of L is right after the last member of L, and</span></span><br><span class="line"><span class="comment"># - the last member of L is right before the first member of L</span></span><br><span class="line"><span class="comment"># (as if making a ring out of the list).</span></span><br><span class="line"><span class="comment"># For a key e in D, the associated value is the pair whose</span></span><br><span class="line"><span class="comment"># first element is the member of L that is right before or right after</span></span><br><span class="line"><span class="comment"># e and smaller than e, and whose second element is the member of L</span></span><br><span class="line"><span class="comment"># that is right before or right after e and greater than e.</span></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">f5</span>(<span class="params">L</span>):</span><br><span class="line">    D = &#123;&#125;</span><br><span class="line">    <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(L)):</span><br><span class="line">        m = L[i - <span class="number">1</span>]</span><br><span class="line">        n = L[(i + <span class="number">1</span>) % <span class="built_in">len</span>(L)]</span><br><span class="line">        <span class="keyword">if</span> n &lt; m:</span><br><span class="line">            m, n = n, m</span><br><span class="line">        <span class="keyword">if</span> m &lt; L[i] &lt; n:</span><br><span class="line">            D[L[i]] = m, n</span><br><span class="line">    <span class="keyword">return</span> D</span><br></pre></td></tr></table></figure><h1 id="Exercise-6"><a href="#Exercise-6" class="headerlink" title="Exercise 6:"></a>Exercise 6:</h1><p>This exercise deals with factorizing an integer n into the form 2^k * m, where m is an odd number. If n is negative, the program adds a negative sign to the output. If n is zero, it prints a special message.</p><p>Key Points:</p><ul><li>The program uses a loop to divide n by 2 until n is no longer divisible by 2, counting the number of divisions (k).</li><li>The absolute value of n is used to ensure correct handling of negative numbers, and a sign is added to the final result if the original number was negative.</li><li>The program handles the special case where n = 0 by printing a unique message.</li></ul><p>More Details:</p><ol><li>You need to express the given integer n as n = 2^k * m.<ul><li>k represents the number of times n can be divided by 2. In other words, it is the power of 2 in the factorization of n.</li><li>m is the remaining odd part after dividing out all factors of 2.</li></ul></li><li>If n is negative, the output should include a negative sign.</li><li>Special case: If n = 0, a specific message should be printed.</li><li>The result is printed directly, not returned.</li></ol><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="comment"># Assume that the argument n is an integer.</span></span><br><span class="line"><span class="comment">#</span></span><br><span class="line"><span class="comment"># The output is printed out, not returned.</span></span><br><span class="line"><span class="comment">#</span></span><br><span class="line"><span class="comment"># You might find the abs() function useful.</span></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">f6</span>(<span class="params">n</span>):</span><br><span class="line">    <span class="keyword">if</span> n == <span class="number">0</span>:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;0 = 2^k * 0 for all integers k!&quot;</span>)</span><br><span class="line">    <span class="keyword">else</span>:</span><br><span class="line">        k = <span class="number">0</span></span><br><span class="line">        ori = n</span><br><span class="line">        <span class="keyword">if</span> n &lt; <span class="number">0</span>:</span><br><span class="line">            sign = <span class="string">&#x27;-&#x27;</span></span><br><span class="line">            n = -n</span><br><span class="line">        <span class="keyword">else</span>:</span><br><span class="line">            sign = <span class="string">&#x27;&#x27;</span></span><br><span class="line">        <span class="keyword">while</span> n % <span class="number">2</span> == <span class="number">0</span>:</span><br><span class="line">            n //= <span class="number">2</span></span><br><span class="line">            k += <span class="number">1</span></span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;<span class="subst">&#123;ori&#125;</span> = <span class="subst">&#123;sign&#125;</span>2^<span class="subst">&#123;k&#125;</span> * <span class="subst">&#123;n&#125;</span>&quot;</span>)</span><br><span class="line">    <span class="keyword">return</span></span><br></pre></td></tr></table></figure><p><strong>FOR VERY VERY VERY VERY VERY BIG NUMBER:</strong></p><p>When dealing with very large integers, the method of continuously dividing the number by 2 to factor out powers of 2 (2^k) can become inefficient. This is because each division can be costly in terms of computational time, especially for very large numbers with millions or billions of digits. Each division involves recalculating the entire integer, which is slow for large integers.<br>Using Bit Manipulation:</p><p>A much more efficient approach is to use <strong>bit manipulation</strong> to determine how many times a number can be divided by 2 (i.e., how many factors of 2 it has). This method avoids division altogether and instead directly analyzes the binary representation of the number to count the number of trailing zeros, which correspond to the powers of 2 in the factorization.</p><h3 id="Why"><a href="#Why" class="headerlink" title="Why?"></a>Why?</h3><ol><li><p>Bitwise operations are much faster than arithmetic operations like division, especially for large integers. Counting the trailing zeros in a number’s binary representation can be done in constant time.</p></li><li><p>Extracting the lowest set bit of a number allows us to quickly find how many times a number can be divided by 2 without having to repeatedly divide the number. This provides the power of 2 (k) directly.</p></li></ol><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">def</span> <span class="title function_">f6</span>(<span class="params">n</span>):</span><br><span class="line">    <span class="keyword">if</span> n == <span class="number">0</span>:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;0 = 2^k * 0 for all integers k!&quot;</span>)</span><br><span class="line">        <span class="keyword">return</span></span><br><span class="line">    </span><br><span class="line">    <span class="comment"># Handle negative sign</span></span><br><span class="line">    sign = <span class="string">&#x27;-&#x27;</span> <span class="keyword">if</span> n &lt; <span class="number">0</span> <span class="keyword">else</span> <span class="string">&#x27;&#x27;</span></span><br><span class="line">    n = <span class="built_in">abs</span>(n)</span><br><span class="line">    </span><br><span class="line">    <span class="comment"># Using bit manipulation to count how many trailing zeros (powers of 2)</span></span><br><span class="line">    k = (n &amp; -n).bit_length() - <span class="number">1</span>  <span class="comment"># Count trailing zeros by isolating the lowest set bit</span></span><br><span class="line">    </span><br><span class="line">    <span class="comment"># Remove 2^k factor from n</span></span><br><span class="line">    m = n &gt;&gt; k  <span class="comment"># Equivalent to n // 2^k, shifting right by k bits</span></span><br><span class="line">    </span><br><span class="line">    <span class="comment"># Print the result</span></span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;<span class="subst">&#123;sign&#125;</span><span class="subst">&#123;n&#125;</span> = <span class="subst">&#123;sign&#125;</span>2^<span class="subst">&#123;k&#125;</span> * <span class="subst">&#123;m&#125;</span>&quot;</span>)</span><br></pre></td></tr></table></figure>]]></content>
     
     
       
@@ -47,7 +47,7 @@
     <published>2024-09-10T15:11:32.940Z</published>
     <updated>2024-09-10T15:11:32.940Z</updated>
     
-    <content type="html"><![CDATA[<h1 id="longsizhuo123-github-io"><a href="#longsizhuo123-github-io" class="headerlink" title="longsizhuo123.github.io"></a>longsizhuo123.github.io</h1><p><img src="https://user-images.githubusercontent.com/114939201/214082770-35d1fb45-9891-4b73-ba89-18e33030640f.png" alt="pattern_stripes-1_1_2_0-0_125_1__cc2a35_4f372d_00a1b0_edc951_eb6941"></p><p><em>“Maybe it could be a nice memory”</em></p><p>Welcome to my personal blog repository on Github! My name is Sizhuo Long, and I am currently a student in Australia. This repository is home to my personal blog, which is built using the HEXO static site generator. </p><p>On my blog, you’ll find a variety of content including my thoughts on technology, programming, and the latest developments in my field of study. I also share my experiences and lessons learned from the projects I’ve worked on. </p><p>I hope that by sharing my knowledge and insights, I can help others who are interested in the same topics. I welcome any comments and feedback, and I am always open to collaboration. </p><p><strong>Thank you for visiting my blog</strong>, I hope you will find something interesting here. And I would really appreciate it if you could pay more attention to my blog and <strong>follow me</strong>.</p><h3 id="Why-you-should-follow-me"><a href="#Why-you-should-follow-me" class="headerlink" title="Why you should follow me"></a>Why you should follow me</h3><ul><li>I’ll share my personal experiences and thoughts on technology and programming </li><li>I’ll keep you updated on the latest developments in my field of study</li><li>I’m open to collaboration and feedback.</li></ul><h3 id="How-to-contact-me"><a href="#How-to-contact-me" class="headerlink" title="How to contact me"></a>How to contact me</h3><ul><li>Email: <a href="mailto:&#x6c;&#111;&#110;&#103;&#115;&#105;&#x7a;&#104;&#x75;&#111;&#64;&#x67;&#x6d;&#x61;&#105;&#108;&#x2e;&#99;&#111;&#109;">&#x6c;&#111;&#110;&#103;&#115;&#105;&#x7a;&#104;&#x75;&#111;&#64;&#x67;&#x6d;&#x61;&#105;&#108;&#x2e;&#99;&#111;&#109;</a></li><li>LinkedIn: <a href="https://www.linkedin.com/in/longsizhuo/">Sizhuo Long</a></li><li>XiaoHongShu(Small RedBook): <a href="https://www.xiaohongshu.com/user/profile/5c0b8cc2000000000601e809">@sizhuo_long</a></li></ul><p>Thank you for reading, and I hope you enjoy my blog!</p><p><img src="https://user-images.githubusercontent.com/114939201/214082782-ae84027e-0a15-4ed4-843b-00a29ea19480.png" alt="pattern_stripes-1_1_2_0-0_125_1__cc2a35_4f372d_00a1b0_edc951_eb6941"></p><p><strong><a href="https://longsizhuo.shinyapps.io/long/">Single -cellRNAData analysis tool</a></strong><br>The project I did before，There are many errors，Don’t spray。<br><strong><a href="../html/home.html">Shu Di Travel Bacteria</a></strong><br>This is a small assignment when I was a second junior year，It’s a group operation。At first I couldn’t get the link<code>html</code>document，I read a lot of official documents orCSDNdocument<br>    。Finally read an article，Said to beHEXODang the<code>generate</code>when，I willsource中的documentappendarrivepublicMiddle，I tried many times later，Discover directly<br>public为源document夹，Just call the directory。Although this will cause it to be unable to bemddocument中超链接arrivedocument。    </p><p>at the same time，也exist新的bugunsolved：login.htmlUnable toindex.htmlJump<br>Linkin:</p><div class="badge-base LI-profile-badge" data-locale="zh_CN" data-size="medium" data-theme="dark" data-type="HORIZONTAL" data-vanity="longsizhuo" data-version="v1"><a class="badge-base__link LI-simple-link" href="https://au.linkedin.com/in/longsizhuo?trk=profile-badge">Sizhuo Long</a></div>]]></content>
+    <content type="html"><![CDATA[<h1 id="longsizhuo123-github-io"><a href="#longsizhuo123-github-io" class="headerlink" title="longsizhuo123.github.io"></a>longsizhuo123.github.io</h1><p><img src="https://user-images.githubusercontent.com/114939201/214082770-35d1fb45-9891-4b73-ba89-18e33030640f.png" alt="pattern_stripes-1_1_2_0-0_125_1__cc2a35_4f372d_00a1b0_edc951_eb6941"></p><p><em>“Maybe it could be a nice memory”</em></p><p>Welcome to my personal blog repository on Github! My name is Sizhuo Long, and I am currently a student in Australia. This repository is home to my personal blog, which is built using the HEXO static site generator. </p><p>On my blog, you’ll find a variety of content including my thoughts on technology, programming, and the latest developments in my field of study. I also share my experiences and lessons learned from the projects I’ve worked on. </p><p>I hope that by sharing my knowledge and insights, I can help others who are interested in the same topics. I welcome any comments and feedback, and I am always open to collaboration. </p><p><strong>Thank you for visiting my blog</strong>, I hope you will find something interesting here. And I would really appreciate it if you could pay more attention to my blog and <strong>follow me</strong>.</p><h3 id="Why-you-should-follow-me"><a href="#Why-you-should-follow-me" class="headerlink" title="Why you should follow me"></a>Why you should follow me</h3><ul><li>I’ll share my personal experiences and thoughts on technology and programming </li><li>I’ll keep you updated on the latest developments in my field of study</li><li>I’m open to collaboration and feedback.</li></ul><h3 id="How-to-contact-me"><a href="#How-to-contact-me" class="headerlink" title="How to contact me"></a>How to contact me</h3><ul><li>Email: <a href="mailto:&#x6c;&#111;&#x6e;&#103;&#x73;&#x69;&#x7a;&#104;&#117;&#x6f;&#64;&#103;&#x6d;&#97;&#x69;&#x6c;&#46;&#99;&#x6f;&#x6d;">&#x6c;&#111;&#x6e;&#103;&#x73;&#x69;&#x7a;&#104;&#117;&#x6f;&#64;&#103;&#x6d;&#97;&#x69;&#x6c;&#46;&#99;&#x6f;&#x6d;</a></li><li>LinkedIn: <a href="https://www.linkedin.com/in/longsizhuo/">Sizhuo Long</a></li><li>XiaoHongShu(Small RedBook): <a href="https://www.xiaohongshu.com/user/profile/5c0b8cc2000000000601e809">@sizhuo_long</a></li></ul><p>Thank you for reading, and I hope you enjoy my blog!</p><p><img src="https://user-images.githubusercontent.com/114939201/214082782-ae84027e-0a15-4ed4-843b-00a29ea19480.png" alt="pattern_stripes-1_1_2_0-0_125_1__cc2a35_4f372d_00a1b0_edc951_eb6941"></p><p><strong><a href="https://longsizhuo.shinyapps.io/long/">Single -cellRNAData analysis tool</a></strong><br>The project I did before，There are many errors，Don’t spray。<br><strong><a href="../html/home.html">Shu Di Travel Bacteria</a></strong><br>This is a small assignment when I was a second junior year，It’s a group operation。At first I couldn’t get the link<code>html</code>document，I read a lot of official documents orCSDNdocument<br>    。Finally read an article，Said to beHEXODang the<code>generate</code>when，I willsource中的documentappendarrivepublicMiddle，I tried many times later，Discover directly<br>public为源document夹，Just call the directory。Although this will cause it to be unable to bemddocument中超链接arrivedocument。    </p><p>at the same time，也exist新的bugunsolved：login.htmlUnable toindex.htmlJump<br>Linkin:</p><div class="badge-base LI-profile-badge" data-locale="zh_CN" data-size="medium" data-theme="dark" data-type="HORIZONTAL" data-vanity="longsizhuo" data-version="v1"><a class="badge-base__link LI-simple-link" href="https://au.linkedin.com/in/longsizhuo?trk=profile-badge">Sizhuo Long</a></div>]]></content>
     
     
       
@@ -199,18 +199,18 @@
   </entry>
   
   <entry>
-    <title>1124. The longest period of performance One question daily</title>
-    <link href="https://longsizhuo.github.io/post/a5d1dfda.html"/>
-    <id>https://longsizhuo.github.io/post/a5d1dfda.html</id>
+    <title>1017.Negative binary conversion</title>
+    <link href="https://longsizhuo.github.io/post/80cafdc8.html"/>
+    <id>https://longsizhuo.github.io/post/80cafdc8.html</id>
     <published>2023-12-31T13:00:00.000Z</published>
     <updated>2024-09-10T15:11:32.922Z</updated>
     
-    <content type="html"><![CDATA[<h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-15.png" alt="2023-02-15.png"><br><a href="https://leetcode.cn/problems/longest-well-performing-interval/description/">1124. The longest period of performance.md</a></p><h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>This question is not，I thought it was a double pointer but timeout over time，结果是Prefix and算法。The following is<a href="https://leetcode.cn/problems/longest-well-performing-interval/solutions/2110211/liang-chong-zuo-fa-liang-zhang-tu-miao-d-hysl/">Spiritual god</a>Solution<br>通过Prefix and，我们可以把Elements and elements of sub -array转换成两个Prefix and的差，Right now<br>$$<br>\sum_{j=left}^{right} nums[j] = \sum_{j=0}^{right} nums[j]− \sum_{j=0}^{left-1} nums[j]=s[right+1]−s[left]<br>$$<br>Now that I said it「Elements and elements of sub -array」，那么利用Prefix and s，Turn the problem to：<br>Find two bidding i and j，satisfy j&lt;ij&lt;ij&lt;i and s[j]&lt;s[i]，maximize i−jValue。</p><p><img src="https://pic.leetcode.cn/1676294271-XVWmuP-1124-3.png"></p><h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><figcaption><span>Double pointer</span></figcaption><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">longestWPI</span>(<span class="params">self, hours: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        ans = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> index, i <span class="keyword">in</span> <span class="built_in">enumerate</span>(hours):</span><br><span class="line">            count = <span class="number">0</span></span><br><span class="line">            j = index</span><br><span class="line">            <span class="keyword">while</span> j &lt; <span class="built_in">len</span>(hours):</span><br><span class="line">                <span class="keyword">if</span> hours[j] &lt;= <span class="number">8</span>:</span><br><span class="line">                    count -= <span class="number">1</span></span><br><span class="line">                <span class="keyword">elif</span> hours[j] &gt; <span class="number">8</span>:</span><br><span class="line">                    count += <span class="number">1</span></span><br><span class="line">                <span class="keyword">if</span> count &gt; <span class="number">0</span>:</span><br><span class="line">                    ans = <span class="built_in">max</span>(ans, j - index + <span class="number">1</span>)</span><br><span class="line">                j += <span class="number">1</span></span><br><span class="line">        <span class="keyword">return</span> ans</span><br></pre></td></tr></table></figure><figure class="highlight python"><figcaption><span>Prefix and</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">longestWPI</span>(<span class="params">self, hours: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        n = <span class="built_in">len</span>(hours)</span><br><span class="line">        s = [<span class="number">0</span>] * (n + <span class="number">1</span>)</span><br><span class="line">        st = [<span class="number">0</span>]</span><br><span class="line">        <span class="keyword">for</span> j, h <span class="keyword">in</span> <span class="built_in">enumerate</span>(hours, <span class="number">1</span>):</span><br><span class="line">            s[j] = s[j - <span class="number">1</span>] + (<span class="number">1</span> <span class="keyword">if</span> h &gt; <span class="number">8</span> <span class="keyword">else</span> -<span class="number">1</span>)</span><br><span class="line">            <span class="keyword">if</span> s[j] &lt; s[st[-<span class="number">1</span>]]:</span><br><span class="line">                st.append(j)</span><br><span class="line">        ans = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(n, <span class="number">0</span> , -<span class="number">1</span>):</span><br><span class="line">            <span class="keyword">while</span> st <span class="keyword">and</span> s[i] &gt; s[st[-<span class="number">1</span>]]:</span><br><span class="line">                ans = <span class="built_in">max</span>(ans, i-st.pop())</span><br><span class="line">        <span class="keyword">return</span> ans</span><br></pre></td></tr></table></figure>]]></content>
+    <content type="html"><![CDATA[<h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p>Give you an integer <code>n</code> ，Return to the integer in the form of a binary string <strong>Negative binary（<code>base -2</code>）</strong>express。</p><p><strong>Notice，</strong>Unless the string is&nbsp;<code>"0"</code>，Otherwise, the returned string cannot contain the front guide zero。</p><p>&nbsp;</p><p><strong>Exemplary example 1：</strong></p><pre><strong>enter：</strong>n = 2<strong>Output：</strong>"110"<strong>explain：</strong>(-2)<sup>2</sup> + (-2)<sup>1</sup> = 2</pre><p><strong>Exemplary example 2：</strong></p><pre><strong>enter：</strong>n = 3<strong>Output：</strong>"111"<strong>explain：</strong>(-2)<sup>2</sup> + (-2)<sup>1</sup> + (-2)<sup>0</sup> = 3</pre><p><strong>Exemplary example 3：</strong></p><pre><strong>enter：</strong>n = 4<strong>Output：</strong>"100"<strong>explain：</strong>(-2)<sup>2</sup> = 4</pre><p>&nbsp;</p><p><strong>hint：</strong></p><ul>  <li><code>0 &lt;= n &lt;= 10<sup>9</sup></code></li> </ul><div><div>Related Topics</div><div><li>math</li></div></div><br><div><li>👍 111</li><li>👎 0</li></div>[1017.Negative binary conversion.md]()<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>We can judge n Every bit from low to high，If the bit is 1，Then the answer is 1，Otherwise 0。If the bit is 1，So we need to n minus k。Next we update n=⌊n/2⌋, k=−k。Continue to judge the next。<br>at last，We will return to the answer。<br>time complexity O(logn)，in n For the given integer。Ignore the space consumption of the answer，Spatial complexity O(1)。</p><h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">baseNeg2</span>(<span class="params">self, n: <span class="built_in">int</span></span>) -&gt; <span class="built_in">str</span>:</span><br><span class="line">        k = <span class="number">1</span></span><br><span class="line">        ans = []</span><br><span class="line">        <span class="keyword">while</span> n:</span><br><span class="line">            <span class="keyword">if</span> n % <span class="number">2</span>:</span><br><span class="line">                ans.append(<span class="string">&#x27;1&#x27;</span>)</span><br><span class="line">                n -= k</span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                ans.append(<span class="string">&#x27;0&#x27;</span>)</span><br><span class="line">            n //= <span class="number">2</span></span><br><span class="line">            k *= -<span class="number">1</span></span><br><span class="line">        <span class="keyword">return</span> <span class="string">&#x27;&#x27;</span>.join(ans[::-<span class="number">1</span>]) <span class="keyword">or</span> <span class="string">&#x27;0&#x27;</span></span><br></pre></td></tr></table></figure>]]></content>
     
     
       
       
-    <summary type="html">&lt;h1 id=&quot;topic：&quot;&gt;&lt;a href=&quot;#topic：&quot; class=&quot;headerlink&quot; title=&quot;topic：&quot;&gt;&lt;/a&gt;topic：&lt;/h1&gt;&lt;p&gt;&lt;img src=&quot;../assets/img/2023-02-15.png&quot; alt=&quot;2023-02-1</summary>
+    <summary type="html">&lt;h1 id=&quot;topic：&quot;&gt;&lt;a href=&quot;#topic：&quot; class=&quot;headerlink&quot; title=&quot;topic：&quot;&gt;&lt;/a&gt;topic：&lt;/h1&gt;&lt;p&gt;Give you an integer &lt;code&gt;n&lt;/code&gt; ，Return to the inte</summary>
       
     
     
@@ -220,23 +220,21 @@
     
     <category term="answer" scheme="https://longsizhuo.github.io/tags/answer/"/>
     
-    <category term="Prefix and" scheme="https://longsizhuo.github.io/tags/Prefix-and/"/>
-    
   </entry>
   
   <entry>
-    <title>1017.Negative binary conversion</title>
-    <link href="https://longsizhuo.github.io/post/80cafdc8.html"/>
-    <id>https://longsizhuo.github.io/post/80cafdc8.html</id>
+    <title>1124. The longest period of performance One question daily</title>
+    <link href="https://longsizhuo.github.io/post/a5d1dfda.html"/>
+    <id>https://longsizhuo.github.io/post/a5d1dfda.html</id>
     <published>2023-12-31T13:00:00.000Z</published>
     <updated>2024-09-10T15:11:32.922Z</updated>
     
-    <content type="html"><![CDATA[<h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p>Give you an integer <code>n</code> ，Return to the integer in the form of a binary string <strong>Negative binary（<code>base -2</code>）</strong>express。</p><p><strong>Notice，</strong>Unless the string is&nbsp;<code>"0"</code>，Otherwise, the returned string cannot contain the front guide zero。</p><p>&nbsp;</p><p><strong>Exemplary example 1：</strong></p><pre><strong>enter：</strong>n = 2<strong>Output：</strong>"110"<strong>explain：</strong>(-2)<sup>2</sup> + (-2)<sup>1</sup> = 2</pre><p><strong>Exemplary example 2：</strong></p><pre><strong>enter：</strong>n = 3<strong>Output：</strong>"111"<strong>explain：</strong>(-2)<sup>2</sup> + (-2)<sup>1</sup> + (-2)<sup>0</sup> = 3</pre><p><strong>Exemplary example 3：</strong></p><pre><strong>enter：</strong>n = 4<strong>Output：</strong>"100"<strong>explain：</strong>(-2)<sup>2</sup> = 4</pre><p>&nbsp;</p><p><strong>hint：</strong></p><ul>  <li><code>0 &lt;= n &lt;= 10<sup>9</sup></code></li> </ul><div><div>Related Topics</div><div><li>math</li></div></div><br><div><li>👍 111</li><li>👎 0</li></div>[1017.Negative binary conversion.md]()<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>We can judge n Every bit from low to high，If the bit is 1，Then the answer is 1，Otherwise 0。If the bit is 1，So we need to n minus k。Next we update n=⌊n/2⌋, k=−k。Continue to judge the next。<br>at last，We will return to the answer。<br>time complexity O(logn)，in n For the given integer。Ignore the space consumption of the answer，Spatial complexity O(1)。</p><h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">baseNeg2</span>(<span class="params">self, n: <span class="built_in">int</span></span>) -&gt; <span class="built_in">str</span>:</span><br><span class="line">        k = <span class="number">1</span></span><br><span class="line">        ans = []</span><br><span class="line">        <span class="keyword">while</span> n:</span><br><span class="line">            <span class="keyword">if</span> n % <span class="number">2</span>:</span><br><span class="line">                ans.append(<span class="string">&#x27;1&#x27;</span>)</span><br><span class="line">                n -= k</span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                ans.append(<span class="string">&#x27;0&#x27;</span>)</span><br><span class="line">            n //= <span class="number">2</span></span><br><span class="line">            k *= -<span class="number">1</span></span><br><span class="line">        <span class="keyword">return</span> <span class="string">&#x27;&#x27;</span>.join(ans[::-<span class="number">1</span>]) <span class="keyword">or</span> <span class="string">&#x27;0&#x27;</span></span><br></pre></td></tr></table></figure>]]></content>
+    <content type="html"><![CDATA[<h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-15.png" alt="2023-02-15.png"><br><a href="https://leetcode.cn/problems/longest-well-performing-interval/description/">1124. The longest period of performance.md</a></p><h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>This question is not，I thought it was a double pointer but timeout over time，结果是Prefix and算法。The following is<a href="https://leetcode.cn/problems/longest-well-performing-interval/solutions/2110211/liang-chong-zuo-fa-liang-zhang-tu-miao-d-hysl/">Spiritual god</a>Solution<br>通过Prefix and，我们可以把Elements and elements of sub -array转换成两个Prefix and的差，Right now<br>$$<br>\sum_{j=left}^{right} nums[j] = \sum_{j=0}^{right} nums[j]− \sum_{j=0}^{left-1} nums[j]=s[right+1]−s[left]<br>$$<br>Now that I said it「Elements and elements of sub -array」，那么利用Prefix and s，Turn the problem to：<br>Find two bidding i and j，satisfy j&lt;ij&lt;ij&lt;i and s[j]&lt;s[i]，maximize i−jValue。</p><p><img src="https://pic.leetcode.cn/1676294271-XVWmuP-1124-3.png"></p><h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><figcaption><span>Double pointer</span></figcaption><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">longestWPI</span>(<span class="params">self, hours: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        ans = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> index, i <span class="keyword">in</span> <span class="built_in">enumerate</span>(hours):</span><br><span class="line">            count = <span class="number">0</span></span><br><span class="line">            j = index</span><br><span class="line">            <span class="keyword">while</span> j &lt; <span class="built_in">len</span>(hours):</span><br><span class="line">                <span class="keyword">if</span> hours[j] &lt;= <span class="number">8</span>:</span><br><span class="line">                    count -= <span class="number">1</span></span><br><span class="line">                <span class="keyword">elif</span> hours[j] &gt; <span class="number">8</span>:</span><br><span class="line">                    count += <span class="number">1</span></span><br><span class="line">                <span class="keyword">if</span> count &gt; <span class="number">0</span>:</span><br><span class="line">                    ans = <span class="built_in">max</span>(ans, j - index + <span class="number">1</span>)</span><br><span class="line">                j += <span class="number">1</span></span><br><span class="line">        <span class="keyword">return</span> ans</span><br></pre></td></tr></table></figure><figure class="highlight python"><figcaption><span>Prefix and</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">longestWPI</span>(<span class="params">self, hours: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        n = <span class="built_in">len</span>(hours)</span><br><span class="line">        s = [<span class="number">0</span>] * (n + <span class="number">1</span>)</span><br><span class="line">        st = [<span class="number">0</span>]</span><br><span class="line">        <span class="keyword">for</span> j, h <span class="keyword">in</span> <span class="built_in">enumerate</span>(hours, <span class="number">1</span>):</span><br><span class="line">            s[j] = s[j - <span class="number">1</span>] + (<span class="number">1</span> <span class="keyword">if</span> h &gt; <span class="number">8</span> <span class="keyword">else</span> -<span class="number">1</span>)</span><br><span class="line">            <span class="keyword">if</span> s[j] &lt; s[st[-<span class="number">1</span>]]:</span><br><span class="line">                st.append(j)</span><br><span class="line">        ans = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(n, <span class="number">0</span> , -<span class="number">1</span>):</span><br><span class="line">            <span class="keyword">while</span> st <span class="keyword">and</span> s[i] &gt; s[st[-<span class="number">1</span>]]:</span><br><span class="line">                ans = <span class="built_in">max</span>(ans, i-st.pop())</span><br><span class="line">        <span class="keyword">return</span> ans</span><br></pre></td></tr></table></figure>]]></content>
     
     
       
       
-    <summary type="html">&lt;h1 id=&quot;topic：&quot;&gt;&lt;a href=&quot;#topic：&quot; class=&quot;headerlink&quot; title=&quot;topic：&quot;&gt;&lt;/a&gt;topic：&lt;/h1&gt;&lt;p&gt;Give you an integer &lt;code&gt;n&lt;/code&gt; ，Return to the inte</summary>
+    <summary type="html">&lt;h1 id=&quot;topic：&quot;&gt;&lt;a href=&quot;#topic：&quot; class=&quot;headerlink&quot; title=&quot;topic：&quot;&gt;&lt;/a&gt;topic：&lt;/h1&gt;&lt;p&gt;&lt;img src=&quot;../assets/img/2023-02-15.png&quot; alt=&quot;2023-02-1</summary>
       
     
     
@@ -246,6 +244,8 @@
     
     <category term="answer" scheme="https://longsizhuo.github.io/tags/answer/"/>
     
+    <category term="Prefix and" scheme="https://longsizhuo.github.io/tags/Prefix-and/"/>
+    
   </entry>
   
   <entry>
@@ -273,18 +273,18 @@
   </entry>
   
   <entry>
-    <title>1233Delete the subfolder folder One question daily</title>
-    <link href="https://longsizhuo.github.io/post/6610c769.html"/>
-    <id>https://longsizhuo.github.io/post/6610c769.html</id>
+    <title>1139. The greatest 1 Formation of the border  One question daily</title>
+    <link href="https://longsizhuo.github.io/post/eb193c1f.html"/>
+    <id>https://longsizhuo.github.io/post/eb193c1f.html</id>
     <published>2023-12-31T13:00:00.000Z</published>
     <updated>2024-09-10T15:11:32.922Z</updated>
     
-    <content type="html"><![CDATA[<h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-09.png" alt="2023-02-09.png"><br><a href="https://leetcode.cn/problems/remove-sub-folders-from-the-filesystem/description/">1233. Delete the subfolder folder</a></p><h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>脑子里的构思yesDictionary tree，But<code>Clanguage</code>的Dictionary tree，Whether it is<code>Python</code><br>still <code>golang</code>I won’t write。 So helpless can only look at the answer。<br>ylbThe big guy is right firstlistSort，Then traverse the list。</p><p>1.ifiBefore<code>[len(ans[-1])]</code>Just happens<code>ans[-1]</code>The element is consistent，Explainiyes<br>ans[-1]Subfolder folder，Then skip。</p><p>2.ifyes<code>[&quot;/a/b/c&quot;,&quot;/a/b/ca&quot;,&quot;/a/b/d&quot;]</code>This situation，Be alone1.的判断yes不够的，at this time<br><code>&quot;/a/b/ca&quot;</code>Before缀and<code>&quot;/a/b/c&quot;</code>yes一样的，但yescaandc实际上yes两个不同的文件夹，So add a judgment front end<br>yes否yes<code>/</code>，<code>&quot;/a/b/ca&quot;</code>and<code>&quot;/a/b/c/a&quot;</code>中后者才会被判定yes前面一个元素的子集。</p><p>Dictionary tree没太看懂:<br>我们可以使用Dictionary tree存储数组 folder All folders in。<br>Dictionary tree的每个节点包含 children Field，Sub -nodes for storing the current nodes，as well as fid Field，<br>Used to store the folder corresponding to the current node in the array folder Bidding。</p><p>For array folder Each folder in it f，We will first f according to / Divide into several skewers，<br>Then start from the root node，依次将子串加入Dictionary tree中。Next，我们从根节点开始搜索Dictionary tree，<br>if当前节点的 fid Field不为 -1，则说明当前节点对应的文件夹yes答案数组中的一个文件夹，<br>We add it to the array and return。otherwise，We search for all sub -nodes of the current node，Finally return to the array of answers。</p><h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><figcaption><span>python3</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">removeSubfolders</span>(<span class="params">self, folder: <span class="type">List</span>[<span class="built_in">str</span>]</span>) -&gt; <span class="type">List</span>[<span class="built_in">str</span>]:</span><br><span class="line">        folder.sort()</span><br><span class="line">        ans = [folder[<span class="number">0</span>]]</span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> folder[<span class="number">1</span>:]:</span><br><span class="line">            m, n = <span class="built_in">len</span>(ans[-<span class="number">1</span>]), <span class="built_in">len</span>(i)</span><br><span class="line">            <span class="comment"># if它的长度大于等于答案数组中最后一个文件夹的长度，并且它Before缀包含答案数组的最后一个文件夹再加上一个 /</span></span><br><span class="line">            <span class="keyword">if</span> m &gt;= n <span class="keyword">or</span> <span class="keyword">not</span> (ans[-<span class="number">1</span>] == i[:m] <span class="keyword">and</span> i[m] == <span class="string">&#x27;/&#x27;</span>):</span><br><span class="line">                ans.append(i)</span><br><span class="line">        <span class="keyword">return</span> ans</span><br><span class="line"><span class="comment"># Dictionary tree</span></span><br><span class="line"><span class="keyword">class</span> <span class="title class_">Trie</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">__init__</span>(<span class="params">self</span>):</span><br><span class="line">        self.children = &#123;&#125;</span><br><span class="line">        self.fid = -<span class="number">1</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">insert</span>(<span class="params">self, i, f</span>):</span><br><span class="line">        node = self</span><br><span class="line">        ps = f.split(<span class="string">&#x27;/&#x27;</span>)</span><br><span class="line">        <span class="keyword">for</span> p <span class="keyword">in</span> ps[<span class="number">1</span>:]:</span><br><span class="line">            <span class="keyword">if</span> p <span class="keyword">not</span> <span class="keyword">in</span> node.children:</span><br><span class="line">                node.children[p] = Trie()</span><br><span class="line">            node = node.children[p]</span><br><span class="line">        node.fid = <span class="number">1</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">search</span>(<span class="params">self</span>):</span><br><span class="line">        <span class="keyword">def</span> <span class="title function_">dfs</span>(<span class="params">root</span>):</span><br><span class="line">            <span class="keyword">if</span> root.fid != -<span class="number">1</span>:</span><br><span class="line">                ans.append(root.fid)</span><br><span class="line">                <span class="keyword">return</span></span><br><span class="line">            <span class="keyword">for</span> child <span class="keyword">in</span> root.children.values():</span><br><span class="line">                dfs(child)</span><br><span class="line">        ans = []</span><br><span class="line">        dfs(self)</span><br><span class="line">        <span class="keyword">return</span> ans</span><br><span class="line">    </span><br><span class="line">    </span><br><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">removeSubfolders</span>(<span class="params">self, folder: <span class="type">List</span>[<span class="built_in">str</span>]</span>) -&gt; <span class="type">List</span>[<span class="built_in">str</span>]:</span><br><span class="line">        trie = Trie()</span><br><span class="line">        <span class="keyword">for</span> i, f <span class="keyword">in</span> <span class="built_in">enumerate</span>(folder):</span><br><span class="line">            trie.insert(i, f)</span><br><span class="line">        <span class="keyword">return</span> [folder[i] <span class="keyword">for</span> i <span class="keyword">in</span> trie.search()]</span><br></pre></td></tr></table></figure><figure class="highlight golang"><figcaption><span>golang</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="keyword">func</span> <span class="title">removeSubfolders</span><span class="params">(folder []<span class="type">string</span>)</span></span> (ans []<span class="type">string</span>) &#123;</span><br><span class="line">sort.Strings(folder)</span><br><span class="line">ans = []<span class="type">string</span>&#123;folder[<span class="number">0</span>]&#125;</span><br><span class="line"><span class="keyword">for</span> _, i := <span class="keyword">range</span> folder[<span class="number">1</span>:] &#123;</span><br><span class="line">m, n := <span class="built_in">len</span>(ans[<span class="built_in">len</span>(ans)<span class="number">-1</span>]), <span class="built_in">len</span>(i)</span><br><span class="line"><span class="keyword">if</span> m &gt;= n || !(ans[<span class="built_in">len</span>(ans)<span class="number">-1</span>] == i[:m] &amp;&amp; i[m] == <span class="string">&#x27;/&#x27;</span>)&#123;</span><br><span class="line">ans = <span class="built_in">append</span>(ans, i)</span><br><span class="line">&#125;</span><br><span class="line">&#125;</span><br><span class="line"><span class="keyword">return</span> </span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>]]></content>
+    <content type="html"><![CDATA[<h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-17.png" alt="2023-02-17.png"><br><a href="https://leetcode.cn/problems/largest-1-bordered-square/description/">1139. The greatest 1 Formation of the border.md</a></p><h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>quiz6 Simple version，Prefix and求解。It should be noted that the upper left corner is0 Special circumstances are not considered，<br>Need to verify # superior Left Down right Four -edge 1 The number of individuals d<br><img src="https://pic.leetcode.cn/1676448329-qJcoyK-1139.png"></p><h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><figcaption><span>错误Code</span></figcaption><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">largest1BorderedSquare</span>(<span class="params">self, grid: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        matrix_heng = copy.deepcopy(grid)</span><br><span class="line">        matrix_su = copy.deepcopy(grid)</span><br><span class="line">        ans = <span class="number">0</span></span><br><span class="line">        <span class="keyword">if</span> <span class="built_in">len</span>(grid) == <span class="number">1</span>:</span><br><span class="line">            <span class="keyword">if</span> <span class="number">1</span> <span class="keyword">in</span> grid[<span class="number">0</span>]:</span><br><span class="line">                <span class="keyword">return</span> <span class="number">1</span></span><br><span class="line">            <span class="keyword">else</span>:<span class="keyword">return</span> <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> ind, i <span class="keyword">in</span> <span class="built_in">enumerate</span>(grid):</span><br><span class="line">            <span class="keyword">for</span> index <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(i)):</span><br><span class="line">                <span class="comment"># Each line adds</span></span><br><span class="line">                <span class="keyword">if</span> index &gt;= <span class="number">1</span>:</span><br><span class="line">                    matrix_heng[ind][index] += matrix_heng[ind][index-<span class="number">1</span>]</span><br><span class="line">                <span class="comment"># Add each column</span></span><br><span class="line">                <span class="keyword">if</span> ind &gt;= <span class="number">1</span>:</span><br><span class="line">                    matrix_su[ind][index] += matrix_su[ind-<span class="number">1</span>][index]</span><br><span class="line">        <span class="built_in">print</span>(matrix_heng, matrix_su)</span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(grid)):</span><br><span class="line">            <span class="keyword">for</span> j <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(grid[i])):</span><br><span class="line">                minus = <span class="built_in">min</span>(matrix_heng[i][j], matrix_su[i][j])</span><br><span class="line">                <span class="keyword">try</span>:</span><br><span class="line">                    <span class="keyword">if</span> grid[i-minus+<span class="number">1</span>][j-minus+<span class="number">1</span>] == <span class="number">1</span> <span class="keyword">and</span> i &gt;= minus-<span class="number">1</span> <span class="keyword">and</span> j &gt;= minus-<span class="number">1</span>:</span><br><span class="line">                        ans = <span class="built_in">max</span>(ans, minus ** <span class="number">2</span>)</span><br><span class="line">                <span class="keyword">except</span>:</span><br><span class="line">                    <span class="keyword">pass</span></span><br><span class="line">        <span class="keyword">return</span> ans</span><br></pre></td></tr></table></figure><figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">largest1BorderedSquare</span>(<span class="params">self, grid: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        m, n = <span class="built_in">len</span>(grid), <span class="built_in">len</span>(grid[<span class="number">0</span>])</span><br><span class="line">        rs = [<span class="built_in">list</span>(accumulate(row, initial=<span class="number">0</span>)) <span class="keyword">for</span> row <span class="keyword">in</span> grid]  <span class="comment"># 每行的Prefix and</span></span><br><span class="line">        cs = [<span class="built_in">list</span>(accumulate(col, initial=<span class="number">0</span>)) <span class="keyword">for</span> col <span class="keyword">in</span> <span class="built_in">zip</span>(*grid)]  <span class="comment"># 每列的Prefix and</span></span><br><span class="line">        <span class="keyword">for</span> d <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">min</span>(m, n), <span class="number">0</span>, -<span class="number">1</span>):  <span class="comment"># From large to small enumeration square edges d</span></span><br><span class="line">            <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(m - d + <span class="number">1</span>):</span><br><span class="line">                <span class="keyword">for</span> j <span class="keyword">in</span> <span class="built_in">range</span>(n - d + <span class="number">1</span>):  <span class="comment"># 枚举正方形Leftsuperior角坐标 (i,j)</span></span><br><span class="line">                    <span class="comment"># superior Left Down right Four -edge 1 The number of individuals d</span></span><br><span class="line">                    <span class="keyword">if</span> rs[i][j + d] - rs[i][j] == d <span class="keyword">and</span> \</span><br><span class="line">                       cs[j][i + d] - cs[j][i] == d <span class="keyword">and</span> \</span><br><span class="line">                       rs[i + d - <span class="number">1</span>][j + d] - rs[i + d - <span class="number">1</span>][j] == d <span class="keyword">and</span> \</span><br><span class="line">                       cs[j + d - <span class="number">1</span>][i + d] - cs[j + d - <span class="number">1</span>][i] == d:</span><br><span class="line">                        <span class="keyword">return</span> d * d</span><br><span class="line">        <span class="keyword">return</span> <span class="number">0</span></span><br></pre></td></tr></table></figure>]]></content>
     
     
       
       
-    <summary type="html">&lt;h1 id=&quot;topic：&quot;&gt;&lt;a href=&quot;#topic：&quot; class=&quot;headerlink&quot; title=&quot;topic：&quot;&gt;&lt;/a&gt;topic：&lt;/h1&gt;&lt;p&gt;&lt;img src=&quot;../assets/img/2023-02-09.png&quot; alt=&quot;2023-02-0</summary>
+    <summary type="html">&lt;h1 id=&quot;topic：&quot;&gt;&lt;a href=&quot;#topic：&quot; class=&quot;headerlink&quot; title=&quot;topic：&quot;&gt;&lt;/a&gt;topic：&lt;/h1&gt;&lt;p&gt;&lt;img src=&quot;../assets/img/2023-02-17.png&quot; alt=&quot;2023-02-1</summary>
       
     
     
@@ -294,23 +294,23 @@
     
     <category term="answer" scheme="https://longsizhuo.github.io/tags/answer/"/>
     
-    <category term="Dictionary tree" scheme="https://longsizhuo.github.io/tags/Dictionary-tree/"/>
+    <category term="Prefix and" scheme="https://longsizhuo.github.io/tags/Prefix-and/"/>
     
   </entry>
   
   <entry>
-    <title>1139. The greatest 1 Formation of the border  One question daily</title>
-    <link href="https://longsizhuo.github.io/post/eb193c1f.html"/>
-    <id>https://longsizhuo.github.io/post/eb193c1f.html</id>
+    <title>1233Delete the subfolder folder One question daily</title>
+    <link href="https://longsizhuo.github.io/post/6610c769.html"/>
+    <id>https://longsizhuo.github.io/post/6610c769.html</id>
     <published>2023-12-31T13:00:00.000Z</published>
     <updated>2024-09-10T15:11:32.922Z</updated>
     
-    <content type="html"><![CDATA[<h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-17.png" alt="2023-02-17.png"><br><a href="https://leetcode.cn/problems/largest-1-bordered-square/description/">1139. The greatest 1 Formation of the border.md</a></p><h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>quiz6 Simple version，Prefix and求解。It should be noted that the upper left corner is0 Special circumstances are not considered，<br>Need to verify # superior Left Down right Four -edge 1 The number of individuals d<br><img src="https://pic.leetcode.cn/1676448329-qJcoyK-1139.png"></p><h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><figcaption><span>错误Code</span></figcaption><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">largest1BorderedSquare</span>(<span class="params">self, grid: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        matrix_heng = copy.deepcopy(grid)</span><br><span class="line">        matrix_su = copy.deepcopy(grid)</span><br><span class="line">        ans = <span class="number">0</span></span><br><span class="line">        <span class="keyword">if</span> <span class="built_in">len</span>(grid) == <span class="number">1</span>:</span><br><span class="line">            <span class="keyword">if</span> <span class="number">1</span> <span class="keyword">in</span> grid[<span class="number">0</span>]:</span><br><span class="line">                <span class="keyword">return</span> <span class="number">1</span></span><br><span class="line">            <span class="keyword">else</span>:<span class="keyword">return</span> <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> ind, i <span class="keyword">in</span> <span class="built_in">enumerate</span>(grid):</span><br><span class="line">            <span class="keyword">for</span> index <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(i)):</span><br><span class="line">                <span class="comment"># Each line adds</span></span><br><span class="line">                <span class="keyword">if</span> index &gt;= <span class="number">1</span>:</span><br><span class="line">                    matrix_heng[ind][index] += matrix_heng[ind][index-<span class="number">1</span>]</span><br><span class="line">                <span class="comment"># Add each column</span></span><br><span class="line">                <span class="keyword">if</span> ind &gt;= <span class="number">1</span>:</span><br><span class="line">                    matrix_su[ind][index] += matrix_su[ind-<span class="number">1</span>][index]</span><br><span class="line">        <span class="built_in">print</span>(matrix_heng, matrix_su)</span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(grid)):</span><br><span class="line">            <span class="keyword">for</span> j <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(grid[i])):</span><br><span class="line">                minus = <span class="built_in">min</span>(matrix_heng[i][j], matrix_su[i][j])</span><br><span class="line">                <span class="keyword">try</span>:</span><br><span class="line">                    <span class="keyword">if</span> grid[i-minus+<span class="number">1</span>][j-minus+<span class="number">1</span>] == <span class="number">1</span> <span class="keyword">and</span> i &gt;= minus-<span class="number">1</span> <span class="keyword">and</span> j &gt;= minus-<span class="number">1</span>:</span><br><span class="line">                        ans = <span class="built_in">max</span>(ans, minus ** <span class="number">2</span>)</span><br><span class="line">                <span class="keyword">except</span>:</span><br><span class="line">                    <span class="keyword">pass</span></span><br><span class="line">        <span class="keyword">return</span> ans</span><br></pre></td></tr></table></figure><figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">largest1BorderedSquare</span>(<span class="params">self, grid: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        m, n = <span class="built_in">len</span>(grid), <span class="built_in">len</span>(grid[<span class="number">0</span>])</span><br><span class="line">        rs = [<span class="built_in">list</span>(accumulate(row, initial=<span class="number">0</span>)) <span class="keyword">for</span> row <span class="keyword">in</span> grid]  <span class="comment"># 每行的Prefix and</span></span><br><span class="line">        cs = [<span class="built_in">list</span>(accumulate(col, initial=<span class="number">0</span>)) <span class="keyword">for</span> col <span class="keyword">in</span> <span class="built_in">zip</span>(*grid)]  <span class="comment"># 每列的Prefix and</span></span><br><span class="line">        <span class="keyword">for</span> d <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">min</span>(m, n), <span class="number">0</span>, -<span class="number">1</span>):  <span class="comment"># From large to small enumeration square edges d</span></span><br><span class="line">            <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(m - d + <span class="number">1</span>):</span><br><span class="line">                <span class="keyword">for</span> j <span class="keyword">in</span> <span class="built_in">range</span>(n - d + <span class="number">1</span>):  <span class="comment"># 枚举正方形Leftsuperior角坐标 (i,j)</span></span><br><span class="line">                    <span class="comment"># superior Left Down right Four -edge 1 The number of individuals d</span></span><br><span class="line">                    <span class="keyword">if</span> rs[i][j + d] - rs[i][j] == d <span class="keyword">and</span> \</span><br><span class="line">                       cs[j][i + d] - cs[j][i] == d <span class="keyword">and</span> \</span><br><span class="line">                       rs[i + d - <span class="number">1</span>][j + d] - rs[i + d - <span class="number">1</span>][j] == d <span class="keyword">and</span> \</span><br><span class="line">                       cs[j + d - <span class="number">1</span>][i + d] - cs[j + d - <span class="number">1</span>][i] == d:</span><br><span class="line">                        <span class="keyword">return</span> d * d</span><br><span class="line">        <span class="keyword">return</span> <span class="number">0</span></span><br></pre></td></tr></table></figure>]]></content>
+    <content type="html"><![CDATA[<h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-09.png" alt="2023-02-09.png"><br><a href="https://leetcode.cn/problems/remove-sub-folders-from-the-filesystem/description/">1233. Delete the subfolder folder</a></p><h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>脑子里的构思yesDictionary tree，But<code>Clanguage</code>的Dictionary tree，Whether it is<code>Python</code><br>still <code>golang</code>I won’t write。 So helpless can only look at the answer。<br>ylbThe big guy is right firstlistSort，Then traverse the list。</p><p>1.ifiBefore<code>[len(ans[-1])]</code>Just happens<code>ans[-1]</code>The element is consistent，Explainiyes<br>ans[-1]Subfolder folder，Then skip。</p><p>2.ifyes<code>[&quot;/a/b/c&quot;,&quot;/a/b/ca&quot;,&quot;/a/b/d&quot;]</code>This situation，Be alone1.的判断yes不够的，at this time<br><code>&quot;/a/b/ca&quot;</code>Before缀and<code>&quot;/a/b/c&quot;</code>yes一样的，但yescaandc实际上yes两个不同的文件夹，So add a judgment front end<br>yes否yes<code>/</code>，<code>&quot;/a/b/ca&quot;</code>and<code>&quot;/a/b/c/a&quot;</code>中后者才会被判定yes前面一个元素的子集。</p><p>Dictionary tree没太看懂:<br>我们可以使用Dictionary tree存储数组 folder All folders in。<br>Dictionary tree的每个节点包含 children Field，Sub -nodes for storing the current nodes，as well as fid Field，<br>Used to store the folder corresponding to the current node in the array folder Bidding。</p><p>For array folder Each folder in it f，We will first f according to / Divide into several skewers，<br>Then start from the root node，依次将子串加入Dictionary tree中。Next，我们从根节点开始搜索Dictionary tree，<br>if当前节点的 fid Field不为 -1，则说明当前节点对应的文件夹yes答案数组中的一个文件夹，<br>We add it to the array and return。otherwise，We search for all sub -nodes of the current node，Finally return to the array of answers。</p><h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><figcaption><span>python3</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">removeSubfolders</span>(<span class="params">self, folder: <span class="type">List</span>[<span class="built_in">str</span>]</span>) -&gt; <span class="type">List</span>[<span class="built_in">str</span>]:</span><br><span class="line">        folder.sort()</span><br><span class="line">        ans = [folder[<span class="number">0</span>]]</span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> folder[<span class="number">1</span>:]:</span><br><span class="line">            m, n = <span class="built_in">len</span>(ans[-<span class="number">1</span>]), <span class="built_in">len</span>(i)</span><br><span class="line">            <span class="comment"># if它的长度大于等于答案数组中最后一个文件夹的长度，并且它Before缀包含答案数组的最后一个文件夹再加上一个 /</span></span><br><span class="line">            <span class="keyword">if</span> m &gt;= n <span class="keyword">or</span> <span class="keyword">not</span> (ans[-<span class="number">1</span>] == i[:m] <span class="keyword">and</span> i[m] == <span class="string">&#x27;/&#x27;</span>):</span><br><span class="line">                ans.append(i)</span><br><span class="line">        <span class="keyword">return</span> ans</span><br><span class="line"><span class="comment"># Dictionary tree</span></span><br><span class="line"><span class="keyword">class</span> <span class="title class_">Trie</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">__init__</span>(<span class="params">self</span>):</span><br><span class="line">        self.children = &#123;&#125;</span><br><span class="line">        self.fid = -<span class="number">1</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">insert</span>(<span class="params">self, i, f</span>):</span><br><span class="line">        node = self</span><br><span class="line">        ps = f.split(<span class="string">&#x27;/&#x27;</span>)</span><br><span class="line">        <span class="keyword">for</span> p <span class="keyword">in</span> ps[<span class="number">1</span>:]:</span><br><span class="line">            <span class="keyword">if</span> p <span class="keyword">not</span> <span class="keyword">in</span> node.children:</span><br><span class="line">                node.children[p] = Trie()</span><br><span class="line">            node = node.children[p]</span><br><span class="line">        node.fid = <span class="number">1</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">search</span>(<span class="params">self</span>):</span><br><span class="line">        <span class="keyword">def</span> <span class="title function_">dfs</span>(<span class="params">root</span>):</span><br><span class="line">            <span class="keyword">if</span> root.fid != -<span class="number">1</span>:</span><br><span class="line">                ans.append(root.fid)</span><br><span class="line">                <span class="keyword">return</span></span><br><span class="line">            <span class="keyword">for</span> child <span class="keyword">in</span> root.children.values():</span><br><span class="line">                dfs(child)</span><br><span class="line">        ans = []</span><br><span class="line">        dfs(self)</span><br><span class="line">        <span class="keyword">return</span> ans</span><br><span class="line">    </span><br><span class="line">    </span><br><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">removeSubfolders</span>(<span class="params">self, folder: <span class="type">List</span>[<span class="built_in">str</span>]</span>) -&gt; <span class="type">List</span>[<span class="built_in">str</span>]:</span><br><span class="line">        trie = Trie()</span><br><span class="line">        <span class="keyword">for</span> i, f <span class="keyword">in</span> <span class="built_in">enumerate</span>(folder):</span><br><span class="line">            trie.insert(i, f)</span><br><span class="line">        <span class="keyword">return</span> [folder[i] <span class="keyword">for</span> i <span class="keyword">in</span> trie.search()]</span><br></pre></td></tr></table></figure><figure class="highlight golang"><figcaption><span>golang</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="keyword">func</span> <span class="title">removeSubfolders</span><span class="params">(folder []<span class="type">string</span>)</span></span> (ans []<span class="type">string</span>) &#123;</span><br><span class="line">sort.Strings(folder)</span><br><span class="line">ans = []<span class="type">string</span>&#123;folder[<span class="number">0</span>]&#125;</span><br><span class="line"><span class="keyword">for</span> _, i := <span class="keyword">range</span> folder[<span class="number">1</span>:] &#123;</span><br><span class="line">m, n := <span class="built_in">len</span>(ans[<span class="built_in">len</span>(ans)<span class="number">-1</span>]), <span class="built_in">len</span>(i)</span><br><span class="line"><span class="keyword">if</span> m &gt;= n || !(ans[<span class="built_in">len</span>(ans)<span class="number">-1</span>] == i[:m] &amp;&amp; i[m] == <span class="string">&#x27;/&#x27;</span>)&#123;</span><br><span class="line">ans = <span class="built_in">append</span>(ans, i)</span><br><span class="line">&#125;</span><br><span class="line">&#125;</span><br><span class="line"><span class="keyword">return</span> </span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>]]></content>
     
     
       
       
-    <summary type="html">&lt;h1 id=&quot;topic：&quot;&gt;&lt;a href=&quot;#topic：&quot; class=&quot;headerlink&quot; title=&quot;topic：&quot;&gt;&lt;/a&gt;topic：&lt;/h1&gt;&lt;p&gt;&lt;img src=&quot;../assets/img/2023-02-17.png&quot; alt=&quot;2023-02-1</summary>
+    <summary type="html">&lt;h1 id=&quot;topic：&quot;&gt;&lt;a href=&quot;#topic：&quot; class=&quot;headerlink&quot; title=&quot;topic：&quot;&gt;&lt;/a&gt;topic：&lt;/h1&gt;&lt;p&gt;&lt;img src=&quot;../assets/img/2023-02-09.png&quot; alt=&quot;2023-02-0</summary>
       
     
     
@@ -320,7 +320,7 @@
     
     <category term="answer" scheme="https://longsizhuo.github.io/tags/answer/"/>
     
-    <category term="Prefix and" scheme="https://longsizhuo.github.io/tags/Prefix-and/"/>
+    <category term="Dictionary tree" scheme="https://longsizhuo.github.io/tags/Dictionary-tree/"/>
     
   </entry>
   
@@ -399,24 +399,20 @@
   </entry>
   
   <entry>
-    <title>142.Ring linkedII</title>
-    <link href="https://longsizhuo.github.io/post/e2c9cca9.html"/>
-    <id>https://longsizhuo.github.io/post/e2c9cca9.html</id>
+    <title>1551. Make all the minimum operations of all elements in the array</title>
+    <link href="https://longsizhuo.github.io/post/b2a927d5.html"/>
+    <id>https://longsizhuo.github.io/post/b2a927d5.html</id>
     <published>2023-12-31T13:00:00.000Z</published>
     <updated>2024-09-10T15:11:32.923Z</updated>
     
-    <content type="html"><![CDATA[<p><img src="../assets/img/2023-07-01%20(1).png" alt="2023-07-01 (1).png"><br><a href="https://leetcode.cn/problems/linked-list-cycle-ii/">142.Ring listII.md</a></p><h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><h3 id="Problem-solving："><a href="#Problem-solving：" class="headerlink" title="Problem -solving："></a>Problem -solving：</h3><p>这类Linkedtopic一般都yes使用双pointer法解决的，For example, looking for distance tail K Node、Find a ring entrance、Find the entrance of the public tail, etc.。</p><h3 id="Algorithm："><a href="#Algorithm：" class="headerlink" title="Algorithm："></a>Algorithm：</h3><ol><li><p>Double pointer met for the first time： Set two pointers fast，slow 指向Linked头部 head，fast Walk per round 2 step，slow Walk per round 1 step；</p><p> a. First result： fast pointer走过Linked末端，说明Linked无环，直接return null；</p><p> .TIPS: If there is a ring，Two pointers will definitely meet。Because every time I go 1 wheel，fast and slow Pitch +1，fast The event will catch up slow；<br> b. Second result： whenfast == slowhour， Two pointers in the ring First encounter 。下面分析此hourfast and slowPassing step数关系 ：</p><p> .设Linked共have a+b Node，in Linked头部到Linked入口 have a Node（不计Linked入口节点）， Linked环 have b Node（这里需要Notice，a and b yes未知数，例如图解上Linked a=4 , b=5）；Set two pointers分别走了 f，s step，则have：<br> a. fast 走的step数yesslowstep数的 2 Double，Right now f=2s；（Analyze： fast Walk per round 2 step）<br> b.fast Compare slowGo more n Length of a ring，Right now f=s+nb；（ Analyze： Double pointers have gone through a step，然后在环Inside绕圈直到重合，重合hour fast Compare slow Go 环的长度整数Double ）；<br> .The above two types are reduced：f=2nb，s=nb，Right nowfastandslow The pointer left separately 2n，n indivual Circumference of the ring （Notice： n yes未知数，不同Linked的情况不同）。</p></li></ol><span id="more"></span><ol start="2"><li><p>Current situation analysis：</p><p> .if让pointer从Linked头部一直向前走并统计step数k，那么所have 走到Linked入口节点hour的step数 yes：k=a+nb（Leave first a step到入口节点，Over time 1 Ring（ b step）I will go to the entrance node again）。</p><p> ..Current，slow pointerPassingstep数为 nb step。therefore，We just find a way slow Go again a step停下来，You can get to the entrance to the ring。</p><p>…但yes我们不知道 a Value，what to do？依然yes使用双pointer法。我们构建一indivualpointer，此pointer需要have以下性质：此pointerandslow Go forward together a step后，The two nodes at the entrance re -coincide。So where does it need to get to the entrance node? a step？答案yesLinked头部head。</p></li><li><p>Double pointer met for the second time：<br> .slowpointer Unchanged position ，Willfastpointer重新 指向Linked头部节点 ；slowandfast同hour每wheel向前走 1 step；</p><p> ..TIPS：此hour f=0，s=nb ；<br> …when fast pointer走到f=a stephour，slow pointer走到steps=a+nb，此hour 两pointer重合，并同hour指向Linked环入口 。</p></li><li><p>returnslowpointer指向的节点。</p></li></ol><h3 id="Complexity-analysis："><a href="#Complexity-analysis：" class="headerlink" title="Complexity analysis："></a>Complexity analysis：</h3><p>hour间复杂度 O(N) ：In the second encounter，慢pointer须走step数 a&lt;a+b；First encounter中，慢pointer须走step数 a+b−x&lt;a+b，in x 为双pointer重合点and环入口距离；therefore总体为线性复杂度；<br>Spatial complexity O(1) ：双pointer使用常数大小的额外空间。<br><img src="../photos/circle link array 2/Picture1.png" alt="Picture1.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture2.png" alt="Picture2.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture3.png" alt="Picture3.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture4.png" alt="Picture4.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture5.png" alt="Picture5.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture6.png" alt="Picture6.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture7.png" alt="Picture7.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture8.png" alt="Picture8.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture9.png" alt="Picture9.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture10.png" alt="Picture10.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture11.png" alt="Picture11.png" width="50%" height="50%"></p><h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">detectCycle</span>(<span class="params">self, head: <span class="type">Optional</span>[ListNode]</span>) -&gt; <span class="type">Optional</span>[ListNode]:</span><br><span class="line">        a = head</span><br><span class="line">        b = head</span><br><span class="line">        <span class="keyword">while</span> <span class="literal">True</span>:</span><br><span class="line">            <span class="keyword">if</span> <span class="keyword">not</span> b <span class="keyword">or</span> <span class="keyword">not</span> b.<span class="built_in">next</span>:</span><br><span class="line">                <span class="keyword">return</span> <span class="literal">None</span></span><br><span class="line">            a = a.<span class="built_in">next</span></span><br><span class="line">            b = b.<span class="built_in">next</span>.<span class="built_in">next</span></span><br><span class="line">            <span class="keyword">if</span> b == a:</span><br><span class="line">                <span class="keyword">break</span></span><br><span class="line">        b = head</span><br><span class="line">        <span class="keyword">while</span> a != b:</span><br><span class="line">            a, b = a.<span class="built_in">next</span>, b.<span class="built_in">next</span></span><br><span class="line">        <span class="keyword">return</span> b</span><br></pre></td></tr></table></figure><figure class="highlight c++"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span> &#123;</span><br><span class="line"><span class="keyword">public</span>:</span><br><span class="line">    <span class="function">ListNode *<span class="title">detectCycle</span><span class="params">(ListNode *head)</span> </span>&#123;</span><br><span class="line">        ListNode *a = head;</span><br><span class="line">        ListNode *b = head;</span><br><span class="line">        <span class="keyword">while</span> (<span class="literal">true</span>) &#123;</span><br><span class="line">            <span class="keyword">if</span> (!b <span class="keyword">or</span> !b-&gt;next) &#123;</span><br><span class="line">                <span class="keyword">return</span> <span class="literal">nullptr</span>;</span><br><span class="line">            &#125;</span><br><span class="line">            a = a-&gt;next;</span><br><span class="line">            b = b-&gt;next-&gt;next;</span><br><span class="line">            <span class="comment">//becauseb每次走两step，soabMust meet</span></span><br><span class="line">            <span class="keyword">if</span> (a == b) &#123;</span><br><span class="line">                <span class="keyword">break</span>;</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line">        <span class="comment">// After meetingaWait in placeb, b去Linked头部</span></span><br><span class="line">        b = head;</span><br><span class="line">        <span class="keyword">while</span>(a!=b)&#123;</span><br><span class="line">            a = a-&gt;next;</span><br><span class="line">            b = b-&gt;next;</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        <span class="keyword">return</span> a;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>]]></content>
+    <content type="html"><![CDATA[<p><img src="../assets/img/2023-01-22%20(3).png" alt="2023-01-22 (3).png"></p><h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>It is the second question of the weekly match：<a href="6275%CA%B9%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%D4%AA%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%C8%B5%EF%BF%BD%EF%BF%BD%EF%BF%BD%D0%A1%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD.md">6275Make all the minimum operations of all elements in the arrayII.md</a><br>The first edition of the heart of the heart。It’s completely different from the second edition，Originally wanted to practice the greedy algorithm。但是做着做着就发现了存在math规律。<br>Quote[yong]Big guy’s words：<br>Because it is the difference between the difference,很可能找到一个math公式,use<code>O(1)</code>Time complexity solution. Get a few simple examples first to find the rules</p><ol><li>n=3 The minimum operation is 2</li><li>n=4 The minimum operation is 1 + 3</li><li>n=5 The minimum operation is 2 + 4</li><li>n=6 The minimum operation is 1 + 3 + 5</li><li>n=7 The minimum operation is 2 + 4 + 6<br>whennWhen the number is,The minimum operation is<code>1 + 3 + 5 + ... + n-1 = n*n/4 </code><br>whennWhen it is a strange number,The minimum operation is<code>2 + 4 + ... + n-1 = (n*n - 1) / 4</code></li></ol><p>Get this question,Feel a bit around,Careful analysis discovery <code>arr[i] = (2 * i) + 1 (0 &lt;= i &lt; n)</code>Is a typical equal number list<code>(1,3,5,7,9...)</code>.<br>According to the formula of the equal number column,It’s easy to find a grouparrThe total element is<code>n^2</code>. In the question design, two bids are selected for each operationx ymake<code>arr[x]</code>minus one<code>arr[y]</code>plus one.<br>in other words,No matter how you choosex y,No matter how many times the operation,The sum of the array will not change. The design and guarantee that all elements in the array can ultimately be equal equal.<br>Then we assume that the final element is equal toaSo<code>n*a == n^2</code>,soa == n,That is to say, the final array elements are alln.actuallynIs the average value of the array.<br>Know the end element is allnback,Start traversing in the middle by starting from the start and end of the array,You can reach the smallest number of operations.<br>Suppose the bidding on the left is<code>i ((2 * i) + 1 &lt; n)</code>So相应右边的下标是<code>n - i.</code><br>The corresponding two elemental values ​​andnThe difference is<code>n - 1 + 2 * i</code>.so我们只要计算数组中值小于nElements andnSummary of difference,Get the minimum operation number.</p><h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight java"><figcaption><span>java</span></figcaption><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></pre></td><td class="code"><pre><span class="line"> <span class="type">int</span> <span class="title function_">minOperations</span><span class="params">(<span class="type">int</span> n)</span> &#123;</span><br><span class="line">     <span class="keyword">return</span> n * n / <span class="number">4</span>;</span><br><span class="line">&#125;</span><br><span class="line"><span class="comment">// Time and space complexity is all O(1)</span></span><br></pre></td></tr></table></figure><figure class="highlight java"><figcaption><span>java</span></figcaption><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"> <span class="type">int</span> <span class="title function_">minOperations</span><span class="params">(<span class="type">int</span> n)</span> &#123;</span><br><span class="line">    <span class="type">int</span> <span class="variable">operation</span> <span class="operator">=</span> <span class="number">0</span>;</span><br><span class="line">    <span class="keyword">for</span>(<span class="type">int</span> <span class="variable">i</span> <span class="operator">=</span> <span class="number">1</span>; i &lt; n ; i += <span class="number">2</span>) &#123;</span><br><span class="line">        operation += (n - i);</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">return</span> operation;</span><br><span class="line">&#125;</span><br><span class="line"><span class="comment">// Time complexity isO(n) Space complexity isO(1)</span></span><br></pre></td></tr></table></figure><figure class="highlight python"><figcaption><span>python</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">minOperations</span>(<span class="params">self, n: <span class="built_in">int</span></span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        operate = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="number">1</span>, n, <span class="number">2</span>):</span><br><span class="line">            operate += (n - i)</span><br><span class="line">        <span class="keyword">return</span> operate</span><br></pre></td></tr></table></figure><figure class="highlight erlang"><figcaption><span>erlang</span></figcaption><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">-spec</span> min_operations<span class="params">(N :: integer())</span> -&gt; integer<span class="params">()</span>.</span><br><span class="line"><span class="function"><span class="title">min_operations</span><span class="params">(N)</span> -&gt;</span></span><br><span class="line">N * N <span class="keyword">div</span> <span class="number">4</span>.</span><br></pre></td></tr></table></figure><figure class="highlight dart"><figcaption><span>dart</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="class"><span class="keyword">class</span> <span class="title">Solution</span> </span>&#123;</span><br><span class="line">  <span class="built_in">int</span> minOperations(<span class="built_in">int</span> n) &#123;</span><br><span class="line">    <span class="keyword">return</span> n * n ~/ <span class="number">4</span>;</span><br><span class="line">  &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><figure class="highlight elixir"><figcaption><span>elixir</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="class"><span class="keyword">defmodule</span> <span class="title">Solution</span></span> <span class="keyword">do</span></span><br><span class="line">  <span class="variable">@spec</span> min_operations(n :: integer) :: integer</span><br><span class="line">  <span class="function"><span class="keyword">def</span> <span class="title">min_operations</span></span>(n) <span class="keyword">do</span></span><br><span class="line">        div(n * n , <span class="number">4</span>)</span><br><span class="line">  <span class="keyword">end</span></span><br><span class="line"><span class="keyword">end</span></span><br></pre></td></tr></table></figure>]]></content>
     
     
-    <summary type="html">&lt;p&gt;&lt;img src=&quot;../assets/img/2023-07-01%20(1).png&quot; alt=&quot;2023-07-01 (1).png&quot;&gt;&lt;br&gt;&lt;a href=&quot;https://leetcode.cn/problems/linked-list-cycle-ii/&quot;&gt;142.Ring listII.md&lt;/a&gt;&lt;/p&gt;
-&lt;h1 id=&quot;Thought：&quot;&gt;&lt;a href=&quot;#Thought：&quot; class=&quot;headerlink&quot; title=&quot;Thought：&quot;&gt;&lt;/a&gt;Thought：&lt;/h1&gt;&lt;h3 id=&quot;Problem-solving：&quot;&gt;&lt;a href=&quot;#Problem-solving：&quot; class=&quot;headerlink&quot; title=&quot;Problem -solving：&quot;&gt;&lt;/a&gt;Problem -solving：&lt;/h3&gt;&lt;p&gt;这类Linkedtopic一般都yes使用双pointer法解决的，For example, looking for distance tail K Node、Find a ring entrance、Find the entrance of the public tail, etc.。&lt;/p&gt;
-&lt;h3 id=&quot;Algorithm：&quot;&gt;&lt;a href=&quot;#Algorithm：&quot; class=&quot;headerlink&quot; title=&quot;Algorithm：&quot;&gt;&lt;/a&gt;Algorithm：&lt;/h3&gt;&lt;ol&gt;
-&lt;li&gt;&lt;p&gt;Double pointer met for the first time： Set two pointers fast，slow 指向Linked头部 head，fast Walk per round 2 step，slow Walk per round 1 step；&lt;/p&gt;
-&lt;p&gt; a. First result： fast pointer走过Linked末端，说明Linked无环，直接return null；&lt;/p&gt;
-&lt;p&gt; .TIPS: If there is a ring，Two pointers will definitely meet。Because every time I go 1 wheel，fast and slow Pitch +1，fast The event will catch up slow；&lt;br&gt; b. Second result： whenfast == slowhour， Two pointers in the ring First encounter 。下面分析此hourfast and slowPassing step数关系 ：&lt;/p&gt;
-&lt;p&gt; .设Linked共have a+b Node，in Linked头部到Linked入口 have a Node（不计Linked入口节点）， Linked环 have b Node（这里需要Notice，a and b yes未知数，例如图解上Linked a=4 , b=5）；Set two pointers分别走了 f，s step，则have：&lt;br&gt; a. fast 走的step数yesslowstep数的 2 Double，Right now f=2s；（Analyze： fast Walk per round 2 step）&lt;br&gt; b.fast Compare slowGo more n Length of a ring，Right now f=s+nb；（ Analyze： Double pointers have gone through a step，然后在环Inside绕圈直到重合，重合hour fast Compare slow Go 环的长度整数Double ）；&lt;br&gt; .The above two types are reduced：f=2nb，s=nb，Right nowfastandslow The pointer left separately 2n，n indivual Circumference of the ring （Notice： n yes未知数，不同Linked的情况不同）。&lt;/p&gt;
-&lt;/li&gt;
-&lt;/ol&gt;</summary>
+      
+      
+    <summary type="html">&lt;p&gt;&lt;img src=&quot;../assets/img/2023-01-22%20(3).png&quot; alt=&quot;2023-01-22 (3).png&quot;&gt;&lt;/p&gt;
+&lt;h1 id=&quot;Thought：&quot;&gt;&lt;a href=&quot;#Thought：&quot; class=&quot;headerlink&quot; titl</summary>
+      
     
     
     
@@ -425,23 +421,29 @@
     
     <category term="answer" scheme="https://longsizhuo.github.io/tags/answer/"/>
     
+    <category term="math" scheme="https://longsizhuo.github.io/tags/math/"/>
+    
   </entry>
   
   <entry>
-    <title>1551. Make all the minimum operations of all elements in the array</title>
-    <link href="https://longsizhuo.github.io/post/b2a927d5.html"/>
-    <id>https://longsizhuo.github.io/post/b2a927d5.html</id>
+    <title>142.Ring linkedII</title>
+    <link href="https://longsizhuo.github.io/post/e2c9cca9.html"/>
+    <id>https://longsizhuo.github.io/post/e2c9cca9.html</id>
     <published>2023-12-31T13:00:00.000Z</published>
     <updated>2024-09-10T15:11:32.923Z</updated>
     
-    <content type="html"><![CDATA[<p><img src="../assets/img/2023-01-22%20(3).png" alt="2023-01-22 (3).png"></p><h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>It is the second question of the weekly match：<a href="6275%CA%B9%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%D4%AA%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%C8%B5%EF%BF%BD%EF%BF%BD%EF%BF%BD%D0%A1%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD.md">6275Make all the minimum operations of all elements in the arrayII.md</a><br>The first edition of the heart of the heart。It’s completely different from the second edition，Originally wanted to practice the greedy algorithm。但是做着做着就发现了存在math规律。<br>Quote[yong]Big guy’s words：<br>Because it is the difference between the difference,很可能找到一个math公式,use<code>O(1)</code>Time complexity solution. Get a few simple examples first to find the rules</p><ol><li>n=3 The minimum operation is 2</li><li>n=4 The minimum operation is 1 + 3</li><li>n=5 The minimum operation is 2 + 4</li><li>n=6 The minimum operation is 1 + 3 + 5</li><li>n=7 The minimum operation is 2 + 4 + 6<br>whennWhen the number is,The minimum operation is<code>1 + 3 + 5 + ... + n-1 = n*n/4 </code><br>whennWhen it is a strange number,The minimum operation is<code>2 + 4 + ... + n-1 = (n*n - 1) / 4</code></li></ol><p>Get this question,Feel a bit around,Careful analysis discovery <code>arr[i] = (2 * i) + 1 (0 &lt;= i &lt; n)</code>Is a typical equal number list<code>(1,3,5,7,9...)</code>.<br>According to the formula of the equal number column,It’s easy to find a grouparrThe total element is<code>n^2</code>. In the question design, two bids are selected for each operationx ymake<code>arr[x]</code>minus one<code>arr[y]</code>plus one.<br>in other words,No matter how you choosex y,No matter how many times the operation,The sum of the array will not change. The design and guarantee that all elements in the array can ultimately be equal equal.<br>Then we assume that the final element is equal toaSo<code>n*a == n^2</code>,soa == n,That is to say, the final array elements are alln.actuallynIs the average value of the array.<br>Know the end element is allnback,Start traversing in the middle by starting from the start and end of the array,You can reach the smallest number of operations.<br>Suppose the bidding on the left is<code>i ((2 * i) + 1 &lt; n)</code>So相应右边的下标是<code>n - i.</code><br>The corresponding two elemental values ​​andnThe difference is<code>n - 1 + 2 * i</code>.so我们只要计算数组中值小于nElements andnSummary of difference,Get the minimum operation number.</p><h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight java"><figcaption><span>java</span></figcaption><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></pre></td><td class="code"><pre><span class="line"> <span class="type">int</span> <span class="title function_">minOperations</span><span class="params">(<span class="type">int</span> n)</span> &#123;</span><br><span class="line">     <span class="keyword">return</span> n * n / <span class="number">4</span>;</span><br><span class="line">&#125;</span><br><span class="line"><span class="comment">// Time and space complexity is all O(1)</span></span><br></pre></td></tr></table></figure><figure class="highlight java"><figcaption><span>java</span></figcaption><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"> <span class="type">int</span> <span class="title function_">minOperations</span><span class="params">(<span class="type">int</span> n)</span> &#123;</span><br><span class="line">    <span class="type">int</span> <span class="variable">operation</span> <span class="operator">=</span> <span class="number">0</span>;</span><br><span class="line">    <span class="keyword">for</span>(<span class="type">int</span> <span class="variable">i</span> <span class="operator">=</span> <span class="number">1</span>; i &lt; n ; i += <span class="number">2</span>) &#123;</span><br><span class="line">        operation += (n - i);</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">return</span> operation;</span><br><span class="line">&#125;</span><br><span class="line"><span class="comment">// Time complexity isO(n) Space complexity isO(1)</span></span><br></pre></td></tr></table></figure><figure class="highlight python"><figcaption><span>python</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">minOperations</span>(<span class="params">self, n: <span class="built_in">int</span></span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        operate = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="number">1</span>, n, <span class="number">2</span>):</span><br><span class="line">            operate += (n - i)</span><br><span class="line">        <span class="keyword">return</span> operate</span><br></pre></td></tr></table></figure><figure class="highlight erlang"><figcaption><span>erlang</span></figcaption><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">-spec</span> min_operations<span class="params">(N :: integer())</span> -&gt; integer<span class="params">()</span>.</span><br><span class="line"><span class="function"><span class="title">min_operations</span><span class="params">(N)</span> -&gt;</span></span><br><span class="line">N * N <span class="keyword">div</span> <span class="number">4</span>.</span><br></pre></td></tr></table></figure><figure class="highlight dart"><figcaption><span>dart</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="class"><span class="keyword">class</span> <span class="title">Solution</span> </span>&#123;</span><br><span class="line">  <span class="built_in">int</span> minOperations(<span class="built_in">int</span> n) &#123;</span><br><span class="line">    <span class="keyword">return</span> n * n ~/ <span class="number">4</span>;</span><br><span class="line">  &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><figure class="highlight elixir"><figcaption><span>elixir</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="class"><span class="keyword">defmodule</span> <span class="title">Solution</span></span> <span class="keyword">do</span></span><br><span class="line">  <span class="variable">@spec</span> min_operations(n :: integer) :: integer</span><br><span class="line">  <span class="function"><span class="keyword">def</span> <span class="title">min_operations</span></span>(n) <span class="keyword">do</span></span><br><span class="line">        div(n * n , <span class="number">4</span>)</span><br><span class="line">  <span class="keyword">end</span></span><br><span class="line"><span class="keyword">end</span></span><br></pre></td></tr></table></figure>]]></content>
+    <content type="html"><![CDATA[<p><img src="../assets/img/2023-07-01%20(1).png" alt="2023-07-01 (1).png"><br><a href="https://leetcode.cn/problems/linked-list-cycle-ii/">142.Ring listII.md</a></p><h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><h3 id="Problem-solving："><a href="#Problem-solving：" class="headerlink" title="Problem -solving："></a>Problem -solving：</h3><p>这类Linkedtopic一般都yes使用双pointer法解决的，For example, looking for distance tail K Node、Find a ring entrance、Find the entrance of the public tail, etc.。</p><h3 id="Algorithm："><a href="#Algorithm：" class="headerlink" title="Algorithm："></a>Algorithm：</h3><ol><li><p>Double pointer met for the first time： Set two pointers fast，slow 指向Linked头部 head，fast Walk per round 2 step，slow Walk per round 1 step；</p><p> a. First result： fast pointer走过Linked末端，说明Linked无环，直接return null；</p><p> .TIPS: If there is a ring，Two pointers will definitely meet。Because every time I go 1 wheel，fast and slow Pitch +1，fast The event will catch up slow；<br> b. Second result： whenfast == slowhour， Two pointers in the ring First encounter 。下面分析此hourfast and slowPassing step数关系 ：</p><p> .设Linked共have a+b Node，in Linked头部到Linked入口 have a Node（不计Linked入口节点）， Linked环 have b Node（这里需要Notice，a and b yes未知数，例如图解上Linked a=4 , b=5）；Set two pointers分别走了 f，s step，则have：<br> a. fast 走的step数yesslowstep数的 2 Double，Right now f=2s；（Analyze： fast Walk per round 2 step）<br> b.fast Compare slowGo more n Length of a ring，Right now f=s+nb；（ Analyze： Double pointers have gone through a step，然后在环Inside绕圈直到重合，重合hour fast Compare slow Go 环的长度整数Double ）；<br> .The above two types are reduced：f=2nb，s=nb，Right nowfastandslow The pointer left separately 2n，n indivual Circumference of the ring （Notice： n yes未知数，不同Linked的情况不同）。</p></li></ol><span id="more"></span><ol start="2"><li><p>Current situation analysis：</p><p> .if让pointer从Linked头部一直向前走并统计step数k，那么所have 走到Linked入口节点hour的step数 yes：k=a+nb（Leave first a step到入口节点，Over time 1 Ring（ b step）I will go to the entrance node again）。</p><p> ..Current，slow pointerPassingstep数为 nb step。therefore，We just find a way slow Go again a step停下来，You can get to the entrance to the ring。</p><p>…但yes我们不知道 a Value，what to do？依然yes使用双pointer法。我们构建一indivualpointer，此pointer需要have以下性质：此pointerandslow Go forward together a step后，The two nodes at the entrance re -coincide。So where does it need to get to the entrance node? a step？答案yesLinked头部head。</p></li><li><p>Double pointer met for the second time：<br> .slowpointer Unchanged position ，Willfastpointer重新 指向Linked头部节点 ；slowandfast同hour每wheel向前走 1 step；</p><p> ..TIPS：此hour f=0，s=nb ；<br> …when fast pointer走到f=a stephour，slow pointer走到steps=a+nb，此hour 两pointer重合，并同hour指向Linked环入口 。</p></li><li><p>returnslowpointer指向的节点。</p></li></ol><h3 id="Complexity-analysis："><a href="#Complexity-analysis：" class="headerlink" title="Complexity analysis："></a>Complexity analysis：</h3><p>hour间复杂度 O(N) ：In the second encounter，慢pointer须走step数 a&lt;a+b；First encounter中，慢pointer须走step数 a+b−x&lt;a+b，in x 为双pointer重合点and环入口距离；therefore总体为线性复杂度；<br>Spatial complexity O(1) ：双pointer使用常数大小的额外空间。<br><img src="../photos/circle link array 2/Picture1.png" alt="Picture1.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture2.png" alt="Picture2.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture3.png" alt="Picture3.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture4.png" alt="Picture4.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture5.png" alt="Picture5.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture6.png" alt="Picture6.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture7.png" alt="Picture7.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture8.png" alt="Picture8.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture9.png" alt="Picture9.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture10.png" alt="Picture10.png" width="50%" height="50%"><br><img src="../photos/circle link array 2/Picture11.png" alt="Picture11.png" width="50%" height="50%"></p><h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">detectCycle</span>(<span class="params">self, head: <span class="type">Optional</span>[ListNode]</span>) -&gt; <span class="type">Optional</span>[ListNode]:</span><br><span class="line">        a = head</span><br><span class="line">        b = head</span><br><span class="line">        <span class="keyword">while</span> <span class="literal">True</span>:</span><br><span class="line">            <span class="keyword">if</span> <span class="keyword">not</span> b <span class="keyword">or</span> <span class="keyword">not</span> b.<span class="built_in">next</span>:</span><br><span class="line">                <span class="keyword">return</span> <span class="literal">None</span></span><br><span class="line">            a = a.<span class="built_in">next</span></span><br><span class="line">            b = b.<span class="built_in">next</span>.<span class="built_in">next</span></span><br><span class="line">            <span class="keyword">if</span> b == a:</span><br><span class="line">                <span class="keyword">break</span></span><br><span class="line">        b = head</span><br><span class="line">        <span class="keyword">while</span> a != b:</span><br><span class="line">            a, b = a.<span class="built_in">next</span>, b.<span class="built_in">next</span></span><br><span class="line">        <span class="keyword">return</span> b</span><br></pre></td></tr></table></figure><figure class="highlight c++"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span> &#123;</span><br><span class="line"><span class="keyword">public</span>:</span><br><span class="line">    <span class="function">ListNode *<span class="title">detectCycle</span><span class="params">(ListNode *head)</span> </span>&#123;</span><br><span class="line">        ListNode *a = head;</span><br><span class="line">        ListNode *b = head;</span><br><span class="line">        <span class="keyword">while</span> (<span class="literal">true</span>) &#123;</span><br><span class="line">            <span class="keyword">if</span> (!b <span class="keyword">or</span> !b-&gt;next) &#123;</span><br><span class="line">                <span class="keyword">return</span> <span class="literal">nullptr</span>;</span><br><span class="line">            &#125;</span><br><span class="line">            a = a-&gt;next;</span><br><span class="line">            b = b-&gt;next-&gt;next;</span><br><span class="line">            <span class="comment">//becauseb每次走两step，soabMust meet</span></span><br><span class="line">            <span class="keyword">if</span> (a == b) &#123;</span><br><span class="line">                <span class="keyword">break</span>;</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line">        <span class="comment">// After meetingaWait in placeb, b去Linked头部</span></span><br><span class="line">        b = head;</span><br><span class="line">        <span class="keyword">while</span>(a!=b)&#123;</span><br><span class="line">            a = a-&gt;next;</span><br><span class="line">            b = b-&gt;next;</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        <span class="keyword">return</span> a;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>]]></content>
     
     
-      
-      
-    <summary type="html">&lt;p&gt;&lt;img src=&quot;../assets/img/2023-01-22%20(3).png&quot; alt=&quot;2023-01-22 (3).png&quot;&gt;&lt;/p&gt;
-&lt;h1 id=&quot;Thought：&quot;&gt;&lt;a href=&quot;#Thought：&quot; class=&quot;headerlink&quot; titl</summary>
-      
+    <summary type="html">&lt;p&gt;&lt;img src=&quot;../assets/img/2023-07-01%20(1).png&quot; alt=&quot;2023-07-01 (1).png&quot;&gt;&lt;br&gt;&lt;a href=&quot;https://leetcode.cn/problems/linked-list-cycle-ii/&quot;&gt;142.Ring listII.md&lt;/a&gt;&lt;/p&gt;
+&lt;h1 id=&quot;Thought：&quot;&gt;&lt;a href=&quot;#Thought：&quot; class=&quot;headerlink&quot; title=&quot;Thought：&quot;&gt;&lt;/a&gt;Thought：&lt;/h1&gt;&lt;h3 id=&quot;Problem-solving：&quot;&gt;&lt;a href=&quot;#Problem-solving：&quot; class=&quot;headerlink&quot; title=&quot;Problem -solving：&quot;&gt;&lt;/a&gt;Problem -solving：&lt;/h3&gt;&lt;p&gt;这类Linkedtopic一般都yes使用双pointer法解决的，For example, looking for distance tail K Node、Find a ring entrance、Find the entrance of the public tail, etc.。&lt;/p&gt;
+&lt;h3 id=&quot;Algorithm：&quot;&gt;&lt;a href=&quot;#Algorithm：&quot; class=&quot;headerlink&quot; title=&quot;Algorithm：&quot;&gt;&lt;/a&gt;Algorithm：&lt;/h3&gt;&lt;ol&gt;
+&lt;li&gt;&lt;p&gt;Double pointer met for the first time： Set two pointers fast，slow 指向Linked头部 head，fast Walk per round 2 step，slow Walk per round 1 step；&lt;/p&gt;
+&lt;p&gt; a. First result： fast pointer走过Linked末端，说明Linked无环，直接return null；&lt;/p&gt;
+&lt;p&gt; .TIPS: If there is a ring，Two pointers will definitely meet。Because every time I go 1 wheel，fast and slow Pitch +1，fast The event will catch up slow；&lt;br&gt; b. Second result： whenfast == slowhour， Two pointers in the ring First encounter 。下面分析此hourfast and slowPassing step数关系 ：&lt;/p&gt;
+&lt;p&gt; .设Linked共have a+b Node，in Linked头部到Linked入口 have a Node（不计Linked入口节点）， Linked环 have b Node（这里需要Notice，a and b yes未知数，例如图解上Linked a=4 , b=5）；Set two pointers分别走了 f，s step，则have：&lt;br&gt; a. fast 走的step数yesslowstep数的 2 Double，Right now f=2s；（Analyze： fast Walk per round 2 step）&lt;br&gt; b.fast Compare slowGo more n Length of a ring，Right now f=s+nb；（ Analyze： Double pointers have gone through a step，然后在环Inside绕圈直到重合，重合hour fast Compare slow Go 环的长度整数Double ）；&lt;br&gt; .The above two types are reduced：f=2nb，s=nb，Right nowfastandslow The pointer left separately 2n，n indivual Circumference of the ring （Notice： n yes未知数，不同Linked的情况不同）。&lt;/p&gt;
+&lt;/li&gt;
+&lt;/ol&gt;</summary>
     
     
     
@@ -450,8 +452,6 @@
     
     <category term="answer" scheme="https://longsizhuo.github.io/tags/answer/"/>
     
-    <category term="math" scheme="https://longsizhuo.github.io/tags/math/"/>
-    
   </entry>
   
   <entry>
diff --git a/baidusitemap.xml b/baidusitemap.xml
index 9ecb386f0..ce89f2b3f 100644
--- a/baidusitemap.xml
+++ b/baidusitemap.xml
@@ -1,11 +1,11 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
   <url>
-    <loc>https://longsizhuo.github.io/post/ac786f6f.html</loc>
+    <loc>https://longsizhuo.github.io/post/becdc081.html</loc>
     <lastmod>2024-09-18</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/becdc081.html</loc>
+    <loc>https://longsizhuo.github.io/post/ac786f6f.html</loc>
     <lastmod>2024-09-18</lastmod>
   </url>
   <url>
@@ -117,11 +117,11 @@
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/a386fcdc.html</loc>
+    <loc>https://longsizhuo.github.io/post/2280b647.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/2280b647.html</loc>
+    <loc>https://longsizhuo.github.io/post/a386fcdc.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
@@ -277,15 +277,15 @@
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/e03edda.html</loc>
+    <loc>https://longsizhuo.github.io/post/16b0e9f1.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/c3f7f59f.html</loc>
+    <loc>https://longsizhuo.github.io/post/e03edda.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/16b0e9f1.html</loc>
+    <loc>https://longsizhuo.github.io/post/c3f7f59f.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
@@ -297,11 +297,11 @@
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/3277549c.html</loc>
+    <loc>https://longsizhuo.github.io/post/6be57ef7.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/6be57ef7.html</loc>
+    <loc>https://longsizhuo.github.io/post/3277549c.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
@@ -321,19 +321,19 @@
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/d482ac75.html</loc>
+    <loc>https://longsizhuo.github.io/post/1978f474.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/3667cd44.html</loc>
+    <loc>https://longsizhuo.github.io/post/d482ac75.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/2f3e8e26.html</loc>
+    <loc>https://longsizhuo.github.io/post/3667cd44.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/1978f474.html</loc>
+    <loc>https://longsizhuo.github.io/post/2f3e8e26.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
@@ -353,11 +353,11 @@
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/e2c9cca9.html</loc>
+    <loc>https://longsizhuo.github.io/post/b2a927d5.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/b2a927d5.html</loc>
+    <loc>https://longsizhuo.github.io/post/e2c9cca9.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
@@ -381,11 +381,11 @@
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/a5d1dfda.html</loc>
+    <loc>https://longsizhuo.github.io/post/80cafdc8.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/80cafdc8.html</loc>
+    <loc>https://longsizhuo.github.io/post/a5d1dfda.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
@@ -393,11 +393,11 @@
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/6610c769.html</loc>
+    <loc>https://longsizhuo.github.io/post/eb193c1f.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
-    <loc>https://longsizhuo.github.io/post/eb193c1f.html</loc>
+    <loc>https://longsizhuo.github.io/post/6610c769.html</loc>
     <lastmod>2024-09-10</lastmod>
   </url>
   <url>
diff --git a/categories/Python/Hash-table/index.html b/categories/Python/Hash-table/index.html
index b9b2d3258..85099586d 100644
--- a/categories/Python/Hash-table/index.html
+++ b/categories/Python/Hash-table/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/categories/Python/index.html b/categories/Python/index.html
index 20cf1c988..e67543e0b 100644
--- a/categories/Python/index.html
+++ b/categories/Python/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/categories/front-end/HEXO/index.html b/categories/front-end/HEXO/index.html
index 7abdc16ef..230d1a490 100644
--- a/categories/front-end/HEXO/index.html
+++ b/categories/front-end/HEXO/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/categories/front-end/index.html b/categories/front-end/index.html
index 8f7adb815..785ebd6e4 100644
--- a/categories/front-end/index.html
+++ b/categories/front-end/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/categories/index.html b/categories/index.html
index 1ff41e95d..60fd85ac2 100644
--- a/categories/index.html
+++ b/categories/index.html
@@ -523,7 +523,7 @@ <h3>共&nbsp;9&nbsp;个分类</h3>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/categories/math/index.html b/categories/math/index.html
index 6a2201da7..2c72c0c98 100644
--- a/categories/math/index.html
+++ b/categories/math/index.html
@@ -410,7 +410,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/categories/solved/answer/index.html b/categories/solved/answer/index.html
index f025c20b3..ff3b5cf53 100644
--- a/categories/solved/answer/index.html
+++ b/categories/solved/answer/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/categories/solved/index.html b/categories/solved/index.html
index 09e21a7df..b258e65dc 100644
--- a/categories/solved/index.html
+++ b/categories/solved/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/categories/unsolved/existbug/index.html b/categories/unsolved/existbug/index.html
index c4bd96cb5..fa470d0eb 100644
--- a/categories/unsolved/existbug/index.html
+++ b/categories/unsolved/existbug/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/categories/unsolved/index.html b/categories/unsolved/index.html
index 3c2f522c0..2f254e3d7 100644
--- a/categories/unsolved/index.html
+++ b/categories/unsolved/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/content.json b/content.json
index 6bf7dcf16..0a15249c6 100644
--- a/content.json
+++ b/content.json
@@ -1 +1 @@
-[{"title":"9021_TUT_2","date":"2024-09-18T01:00:36.787Z","path":"post/becdc081.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Tutorial","slug":"Tutorial","permalink":"https://longsizhuo.github.io/tags/Tutorial/"}]},{"title":"Top of an article","date":"2024-09-10T15:11:32.940Z","path":"post/edc2b94.html","excerpt":"","tags":[{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"front end","slug":"front-end","permalink":"https://longsizhuo.github.io/tags/front-end/"}]},{"title":"9021_TUT_1","date":"2024-09-10T14:00:00.000Z","path":"post/ac786f6f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Tutorial","slug":"Tutorial","permalink":"https://longsizhuo.github.io/tags/Tutorial/"}]},{"title":"964E","date":"2024-08-06T17:34:00.000Z","path":"post/2280b647.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Answer","slug":"Answer","permalink":"https://longsizhuo.github.io/tags/Answer/"}]},{"title":"56. Merge Intervals","date":"2024-05-27T13:48:54.582Z","path":"post/50818339.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"数组","slug":"数组","permalink":"https://longsizhuo.github.io/tags/%E6%95%B0%E7%BB%84/"},{"name":"排序","slug":"排序","permalink":"https://longsizhuo.github.io/tags/%E6%8E%92%E5%BA%8F/"}]},{"title":"994.Rotten orange","date":"2024-05-13T14:00:00.000Z","path":"post/56e64fdd.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"BFS","slug":"BFS","permalink":"https://longsizhuo.github.io/tags/BFS/"},{"name":"Bilateral queue","slug":"Bilateral-queue","permalink":"https://longsizhuo.github.io/tags/Bilateral-queue/"}]},{"title":"1017. Negative binary conversion","date":"2023-12-31T13:00:00.000Z","path":"post/dce95dce.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1124. The longest period of performance One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/a5d1dfda.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Prefix and","slug":"Prefix-and","permalink":"https://longsizhuo.github.io/tags/Prefix-and/"}]},{"title":"1017.Negative binary conversion","date":"2023-12-31T13:00:00.000Z","path":"post/80cafdc8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1138. The path on the letter board One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/fd471847.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1233Delete the subfolder folder One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/6610c769.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Dictionary tree","slug":"Dictionary-tree","permalink":"https://longsizhuo.github.io/tags/Dictionary-tree/"}]},{"title":"1139. The greatest 1 Formation of the border  One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/eb193c1f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Prefix and","slug":"Prefix-and","permalink":"https://longsizhuo.github.io/tags/Prefix-and/"}]},{"title":"1234. Replace the sub -string to get a balanced string One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/56d97dcf.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1237. Find out the positive combination of the given square  One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/14b94db7.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1250. examine「Good array」 One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/435a9a0d.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"}]},{"title":"142.Ring linkedII","date":"2023-12-31T13:00:00.000Z","path":"post/e2c9cca9.html","excerpt":"142.Ring listII.md Thought：Problem -solving：这类Linkedtopic一般都yes使用双pointer法解决的，For example, looking for distance tail K Node、Find a ring entrance、Find the entrance of the public tail, etc.。 Algorithm： Double pointer met for the first time： Set two pointers fast，slow 指向Linked头部 head，fast Walk per round 2 step，slow Walk per round 1 step； a. First result： fast pointer走过Linked末端，说明Linked无环，直接return null； .TIPS: If there is a ring，Two pointers will definitely meet。Because every time I go 1 wheel，fast and slow Pitch +1，fast The event will catch up slow； b. Second result： whenfast == slowhour， Two pointers in the ring First encounter 。下面分析此hourfast and slowPassing step数关系 ： .设Linked共have a+b Node，in Linked头部到Linked入口 have a Node（不计Linked入口节点）， Linked环 have b Node（这里需要Notice，a and b yes未知数，例如图解上Linked a=4 , b=5）；Set two pointers分别走了 f，s step，则have： a. fast 走的step数yesslowstep数的 2 Double，Right now f=2s；（Analyze： fast Walk per round 2 step） b.fast Compare slowGo more n Length of a ring，Right now f=s+nb；（ Analyze： Double pointers have gone through a step，然后在环Inside绕圈直到重合，重合hour fast Compare slow Go 环的长度整数Double ）； .The above two types are reduced：f=2nb，s=nb，Right nowfastandslow The pointer left separately 2n，n indivual Circumference of the ring （Notice： n yes未知数，不同Linked的情况不同）。","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1551. Make all the minimum operations of all elements in the array","date":"2023-12-31T13:00:00.000Z","path":"post/b2a927d5.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"}]},{"title":"1590.Make the array and energyPDivide","date":"2023-12-31T13:00:00.000Z","path":"post/59825e1f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1604Warn alert person who uses the same employee card within one hour One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/bb7bcf54.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"}]},{"title":"1653. The minimum number of times to balance the string balance","date":"2023-12-31T13:00:00.000Z","path":"post/cac21f27.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1663. The smallest string with a given value One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/4d7252f8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"}]},{"title":"1669. Merge two linked watches One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/d482ac75.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"Linked","slug":"Linked","permalink":"https://longsizhuo.github.io/tags/Linked/"}]},{"title":"1798You can construct the maximum number of continuity One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/3667cd44.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"}]},{"title":"1801-1803 Liech buckle novice！","date":"2023-12-31T13:00:00.000Z","path":"post/2f3e8e26.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"1664. Number of schemes to generate balance numbers One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/1978f474.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"}]},{"title":"1813. Sentence similarity III","date":"2023-12-31T13:00:00.000Z","path":"post/69c2a1dd.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"Double pointer","slug":"Double-pointer","permalink":"https://longsizhuo.github.io/tags/Double-pointer/"}]},{"title":"1814. Statistics the number of good pairs in an array One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/ceb1e67f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"Double pointer","slug":"Double-pointer","permalink":"https://longsizhuo.github.io/tags/Double-pointer/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"}]},{"title":"1817. Find the number of users of users active One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/d0a9337b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"}]},{"title":"1819.Different numbers in the sequence","date":"2023-12-31T13:00:00.000Z","path":"post/de522cea.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"}]},{"title":"1825. Seek out MK average value","date":"2023-12-31T13:00:00.000Z","path":"post/6be57ef7.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"},{"name":"Graph Theory","slug":"Graph-Theory","permalink":"https://longsizhuo.github.io/tags/Graph-Theory/"}]},{"title":"1828. Statistics the number of a circle mid -point One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/3277549c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"}]},{"title":"1825. Seek out MK average value","date":"2023-12-31T13:00:00.000Z","path":"post/6be57ef7.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"},{"name":"Multiple set","slug":"Multiple-set","permalink":"https://longsizhuo.github.io/tags/Multiple-set/"}]},{"title":"19.Delete the countdown of the linked listNNode","date":"2023-12-31T13:00:00.000Z","path":"post/c916b663.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"PythonCoincidence，Random algorithmO(nlogn)Push","date":"2023-12-31T13:00:00.000Z","path":"post/a1d26db4.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"209.Small length array","date":"2023-12-31T13:00:00.000Z","path":"post/e6227611.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"217. Existing duplicate elements C++/Python3","date":"2023-12-31T13:00:00.000Z","path":"post/717042a6.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"C++","slug":"C","permalink":"https://longsizhuo.github.io/tags/C/"}]},{"title":"217. Existing duplicate elements C++/Python3","date":"2023-12-31T13:00:00.000Z","path":"post/717042a6.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"C++","slug":"C","permalink":"https://longsizhuo.github.io/tags/C/"}]},{"title":"221Maximum square","date":"2023-12-31T13:00:00.000Z","path":"post/e03edda.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"}]},{"title":"One question daily 2283","date":"2023-12-31T13:00:00.000Z","path":"post/c3f7f59f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"219.Existing duplicate elements II Hash table graphics","date":"2023-12-31T13:00:00.000Z","path":"post/16b0e9f1.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"}]},{"title":"One question daily 2299. Code inspection device II","date":"2023-12-31T13:00:00.000Z","path":"post/7ded25bb.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Bit operation","slug":"Bit-operation","permalink":"https://longsizhuo.github.io/tags/Bit-operation/"}]},{"title":"One question daily 2293. Great mini game","date":"2023-12-31T13:00:00.000Z","path":"post/9df6242c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"2303. Calculate the total taxable amount","date":"2023-12-31T13:00:00.000Z","path":"post/11597f8b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"}]},{"title":"2309. The best English letters with both appropriates and lowercases One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/b4953d62.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"C++","slug":"C","permalink":"https://longsizhuo.github.io/tags/C/"},{"name":"Bit operation","slug":"Bit-operation","permalink":"https://longsizhuo.github.io/tags/Bit-operation/"}]},{"title":"2315. Statistical star number One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/dc8d7590.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"}]},{"title":"2319Determine whether the matrix is ​​one X matrix One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/f7c5db77.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"2325Decrypt One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/f4b99a74.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"}]},{"title":"2331Calculate the value of the Boolean binary tree One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/a564ea0e.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Binary tree","slug":"Binary-tree","permalink":"https://longsizhuo.github.io/tags/Binary-tree/"}]},{"title":"2335. The shortest total time to be filled with a cup One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/4400daa1.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"},{"name":"dp","slug":"dp","permalink":"https://longsizhuo.github.io/tags/dp/"}]},{"title":"2341. How much can the array be formed  One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/f953c753.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"24.Two or two exchanges linked watches","date":"2023-12-31T13:00:00.000Z","path":"post/d030a5a0.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"2527.Query arrayXorBeautiful value Zhou Sai Third Question","date":"2023-12-31T13:00:00.000Z","path":"post/20ffa67a.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"2639. Query the width of each column in the grid diagram","date":"2023-12-31T13:00:00.000Z","path":"post/5a764983.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"2679.In the matrix and the harmony","date":"2023-12-31T13:00:00.000Z","path":"post/5277100.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"matrix","slug":"matrix","permalink":"https://longsizhuo.github.io/tags/matrix/"},{"name":"Sort","slug":"Sort","permalink":"https://longsizhuo.github.io/tags/Sort/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"},{"name":"heap（Priority queue）","slug":"heap（Priority-queue）","permalink":"https://longsizhuo.github.io/tags/heap%EF%BC%88Priority-queue%EF%BC%89/"}]},{"title":"271. Code and decoding of string - Python Add the transposition symbol solution method Dual complexityO(n)","date":"2023-12-31T13:00:00.000Z","path":"post/5992f238.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"2997. Make an array or harmony K The minimum number of operations","date":"2023-12-31T13:00:00.000Z","path":"post/3109a910.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"},{"name":"Bit operation","slug":"Bit-operation","permalink":"https://longsizhuo.github.io/tags/Bit-operation/"}]},{"title":"2998. make X and Y Equal number of operations","date":"2023-12-31T13:00:00.000Z","path":"post/5ee4164.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"Priority search","slug":"Priority-search","permalink":"https://longsizhuo.github.io/tags/Priority-search/"},{"name":"Memory search","slug":"Memory-search","permalink":"https://longsizhuo.github.io/tags/Memory-search/"}]},{"title":"3072. Allocate elements into two arrays II","date":"2023-12-31T13:00:00.000Z","path":"post/48a38683.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"},{"name":"Tree array","slug":"Tree-array","permalink":"https://longsizhuo.github.io/tags/Tree-array/"},{"name":"Thread tree","slug":"Thread-tree","permalink":"https://longsizhuo.github.io/tags/Thread-tree/"}]},{"title":"345. Voice letter in the reverse string","date":"2023-12-31T13:00:00.000Z","path":"post/1c57c22c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"350.The intersection of two array","date":"2023-12-31T13:00:00.000Z","path":"post/616577aa.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"Double pointer","slug":"Double-pointer","permalink":"https://longsizhuo.github.io/tags/Double-pointer/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"}]},{"title":"445.Two numbersII","date":"2023-12-31T13:00:00.000Z","path":"post/2c4cc46c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"Linked","slug":"Linked","permalink":"https://longsizhuo.github.io/tags/Linked/"},{"name":"recursion","slug":"recursion","permalink":"https://longsizhuo.github.io/tags/recursion/"},{"name":"Stack","slug":"Stack","permalink":"https://longsizhuo.github.io/tags/Stack/"}]},{"title":"538.Convert the binary search tree to cumulative tree","date":"2023-12-31T13:00:00.000Z","path":"post/32401b69.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Binary tree","slug":"Binary-tree","permalink":"https://longsizhuo.github.io/tags/Binary-tree/"}]},{"title":"6275. Make all the minimum operations of all elements in the array II","date":"2023-12-31T13:00:00.000Z","path":"post/4e14482b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"}]},{"title":"6293. Count the number of good array","date":"2023-12-31T13:00:00.000Z","path":"post/81004405.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"}]},{"title":"6300. Minimum public value","date":"2023-12-31T13:00:00.000Z","path":"post/fefe18d8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"6323. Child that divides money the most","date":"2023-12-31T13:00:00.000Z","path":"post/b9130c0e.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"6324. Maximize the great value of the array","date":"2023-12-31T13:00:00.000Z","path":"post/1e6b72b8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"6331The most prizes won in the two lines make()usage","date":"2023-12-31T13:00:00.000Z","path":"post/14d9382b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"}]},{"title":"6338. Number of methods of monkey collision Weekly","date":"2023-12-31T13:00:00.000Z","path":"post/2aa720ec.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"Fast power","slug":"Fast-power","permalink":"https://longsizhuo.github.io/tags/Fast-power/"},{"name":"Weekly","slug":"Weekly","permalink":"https://longsizhuo.github.io/tags/Weekly/"}]},{"title":"6347Number of vowel string within the scope of statistics","date":"2023-12-31T13:00:00.000Z","path":"post/52923acb.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"6351. The scores of the array after the marking all elements","date":"2023-12-31T13:00:00.000Z","path":"post/20116270.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"704. Two -point search","date":"2023-12-31T13:00:00.000Z","path":"post/41f30363.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"76Minimum cover string","date":"2023-12-31T13:00:00.000Z","path":"post/ae10d3c1.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"}]},{"title":"Python beat98.40% collectionsofCounter method！","date":"2023-12-31T13:00:00.000Z","path":"post/73b5ce9c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"977.Orderly array square","date":"2023-12-31T13:00:00.000Z","path":"post/a386fcdc.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"Sword finger Offer 43. 1～n Integer 1 Number of times","date":"2023-12-31T13:00:00.000Z","path":"post/f0d96a1f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"}]},{"title":"121.The best time for buying and selling stocks","date":"2023-12-31T13:00:00.000Z","path":"post/3a21fe32.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"}]},{"title":"1222.Can attack the queen of the king","date":"2023-12-31T13:00:00.000Z","path":"post/a6577367.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"matrix","slug":"matrix","permalink":"https://longsizhuo.github.io/tags/matrix/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"}]},{"title":"122.The best time for buying and selling stocksII","date":"2023-12-31T13:00:00.000Z","path":"post/a75da5a.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"}]},{"title":"1253.Reconstruct 2 Line binary matrix","date":"2023-12-31T13:00:00.000Z","path":"post/5c98e66b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"matrix","slug":"matrix","permalink":"https://longsizhuo.github.io/tags/matrix/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"},{"name":"medium","slug":"medium","permalink":"https://longsizhuo.github.io/tags/medium/"}]},{"title":"1333.Restaurant filter","date":"2023-12-31T13:00:00.000Z","path":"post/7f1331bc.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"Sort","slug":"Sort","permalink":"https://longsizhuo.github.io/tags/Sort/"}]},{"title":"1460.Class ScheduleIV","date":"2023-12-31T13:00:00.000Z","path":"post/d8b8a149.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Priority search","slug":"Priority-search","permalink":"https://longsizhuo.github.io/tags/Priority-search/"},{"name":"In -depth priority search","slug":"In-depth-priority-search","permalink":"https://longsizhuo.github.io/tags/In-depth-priority-search/"},{"name":"picture","slug":"picture","permalink":"https://longsizhuo.github.io/tags/picture/"},{"name":"Topology","slug":"Topology","permalink":"https://longsizhuo.github.io/tags/Topology/"}]},{"title":"146.LRU cache","date":"2023-12-31T13:00:00.000Z","path":"post/b9130c0e.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"Linked","slug":"Linked","permalink":"https://longsizhuo.github.io/tags/Linked/"},{"name":"design","slug":"design","permalink":"https://longsizhuo.github.io/tags/design/"},{"name":"双向Linked","slug":"双向Linked","permalink":"https://longsizhuo.github.io/tags/%E5%8F%8C%E5%90%91Linked/"}]},{"title":"213.Hiccup II","date":"2023-12-31T13:00:00.000Z","path":"post/85beb0bf.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"}]},{"title":"2251.The number of flowers during the flowering period","date":"2023-12-31T13:00:00.000Z","path":"post/3a21fe32.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Prefix and","slug":"Prefix-and","permalink":"https://longsizhuo.github.io/tags/Prefix-and/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"Sort","slug":"Sort","permalink":"https://longsizhuo.github.io/tags/Sort/"},{"name":"Two -point search","slug":"Two-point-search","permalink":"https://longsizhuo.github.io/tags/Two-point-search/"},{"name":"Orderly collection","slug":"Orderly-collection","permalink":"https://longsizhuo.github.io/tags/Orderly-collection/"}]},{"title":"2490Return ring sentence","date":"2023-12-31T13:00:00.000Z","path":"post/5c07686c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"String","slug":"String","permalink":"https://longsizhuo.github.io/tags/String/"}]},{"title":"2562.Find the series of the array","date":"2023-12-31T13:00:00.000Z","path":"post/b625a0e1.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Double pointer","slug":"Double-pointer","permalink":"https://longsizhuo.github.io/tags/Double-pointer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"}]},{"title":"2582.Pillow","date":"2023-12-31T13:00:00.000Z","path":"post/82e09f92.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"}]},{"title":"2591.Child that divides money the most","date":"2023-12-31T13:00:00.000Z","path":"post/6a9ab144.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"}]},{"title":"2596.Check the Cavaliers patrol plan","date":"2023-12-31T13:00:00.000Z","path":"post/29546b92.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"matrix","slug":"matrix","permalink":"https://longsizhuo.github.io/tags/matrix/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"},{"name":"Priority search","slug":"Priority-search","permalink":"https://longsizhuo.github.io/tags/Priority-search/"},{"name":"In -depth priority search","slug":"In-depth-priority-search","permalink":"https://longsizhuo.github.io/tags/In-depth-priority-search/"}]},{"title":"2 .Two numbers","date":"2023-12-31T13:00:00.000Z","path":"post/fa9db6b8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"Linked","slug":"Linked","permalink":"https://longsizhuo.github.io/tags/Linked/"},{"name":"recursion","slug":"recursion","permalink":"https://longsizhuo.github.io/tags/recursion/"}]},{"title":"213.Hiccup III","date":"2023-12-31T13:00:00.000Z","path":"post/86590614.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"Binary tree","slug":"Binary-tree","permalink":"https://longsizhuo.github.io/tags/Binary-tree/"},{"name":"In -depth priority search","slug":"In-depth-priority-search","permalink":"https://longsizhuo.github.io/tags/In-depth-priority-search/"},{"name":"Tree","slug":"Tree","permalink":"https://longsizhuo.github.io/tags/Tree/"}]},{"title":"630.Class ScheduleIII","date":"2023-12-31T13:00:00.000Z","path":"post/e14241e.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"},{"name":"Priority queue","slug":"Priority-queue","permalink":"https://longsizhuo.github.io/tags/Priority-queue/"}]},{"title":"LCP 06.Coin","date":"2023-12-31T13:00:00.000Z","path":"post/66079b7b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"}]},{"title":"LCP 50.Gem supply","date":"2023-12-31T13:00:00.000Z","path":"post/762ca698.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"}]},{"title":"brief_alternate Assignment","date":"2023-12-31T13:00:00.000Z","path":"post/dbbd7d58.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"pandas","slug":"pandas","permalink":"https://longsizhuo.github.io/tags/pandas/"}]},{"title":"GOlanguage# GOlanguage可爱捏","date":"2023-12-31T13:00:00.000Z","path":"post/67fc8613.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"Inline expansion","date":"2023-12-31T13:00:00.000Z","path":"post/2660e935.html","excerpt":"","tags":[{"name":"Composition principle","slug":"Composition-principle","permalink":"https://longsizhuo.github.io/tags/Composition-principle/"}]},{"title":"Some doubt","date":"2023-12-31T13:00:00.000Z","path":"post/941aeb72.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"encryption","slug":"encryption","permalink":"https://longsizhuo.github.io/tags/encryption/"}]},{"title":"math","date":"2023-12-31T13:00:00.000Z","path":"post/a927044d.html","excerpt":"like $\\lim_{x \\to 0} \\frac{\\sin x}{x}$ Rendering $$\\begin{eqnarray} \\lim_{x \\to 0} \\frac{\\sin x + x^2 + x^3}{x} &amp; = &amp; \\lim_{x \\to 0} \\frac{\\sin x }{x} + \\lim_{x \\to 0} \\frac{x^2 }{x} + \\lim_{x \\to 0}\\frac{x^3}{x}\\\\ &amp; = &amp; \\lim_{x \\to 0}\\frac{\\sin x}{x}\\\\ &amp; = &amp; 1\\end{eqnarray}$$","tags":[{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"}]},{"title":"Sword finger Offer 68 - II. The recent public ancestor of the binary tree","date":"2023-12-31T13:00:00.000Z","path":"post/36f314aa.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"Sword finger Offer II 021. Delete the countdown of the linked list n Node","date":"2023-12-31T13:00:00.000Z","path":"post/3ed2f01c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"2085. Public string that has occurred once","date":"2023-11-30T13:00:00.000Z","path":"post/bbe4bff6.html","excerpt":"","tags":[{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"String","slug":"String","permalink":"https://longsizhuo.github.io/tags/String/"},{"name":"count","slug":"count","permalink":"https://longsizhuo.github.io/tags/count/"}]},{"title":"1004.Maximum continuity1Number III Maximum continuity1Number III","date":"2022-12-06T14:15:00.000Z","path":"post/ed19b576.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]}]
\ No newline at end of file
+[{"title":"9021_TUT_2","date":"2024-09-18T01:00:36.787Z","path":"post/becdc081.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Tutorial","slug":"Tutorial","permalink":"https://longsizhuo.github.io/tags/Tutorial/"}]},{"title":"Top of an article","date":"2024-09-10T15:11:32.940Z","path":"post/edc2b94.html","excerpt":"","tags":[{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"front end","slug":"front-end","permalink":"https://longsizhuo.github.io/tags/front-end/"}]},{"title":"9021_TUT_1","date":"2024-09-10T14:00:00.000Z","path":"post/ac786f6f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Tutorial","slug":"Tutorial","permalink":"https://longsizhuo.github.io/tags/Tutorial/"}]},{"title":"964E","date":"2024-08-06T17:34:00.000Z","path":"post/2280b647.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Answer","slug":"Answer","permalink":"https://longsizhuo.github.io/tags/Answer/"}]},{"title":"56. Merge Intervals","date":"2024-05-27T13:48:54.582Z","path":"post/50818339.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"数组","slug":"数组","permalink":"https://longsizhuo.github.io/tags/%E6%95%B0%E7%BB%84/"},{"name":"排序","slug":"排序","permalink":"https://longsizhuo.github.io/tags/%E6%8E%92%E5%BA%8F/"}]},{"title":"994.Rotten orange","date":"2024-05-13T14:00:00.000Z","path":"post/56e64fdd.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"BFS","slug":"BFS","permalink":"https://longsizhuo.github.io/tags/BFS/"},{"name":"Bilateral queue","slug":"Bilateral-queue","permalink":"https://longsizhuo.github.io/tags/Bilateral-queue/"}]},{"title":"1017. Negative binary conversion","date":"2023-12-31T13:00:00.000Z","path":"post/dce95dce.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1017.Negative binary conversion","date":"2023-12-31T13:00:00.000Z","path":"post/80cafdc8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1124. The longest period of performance One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/a5d1dfda.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Prefix and","slug":"Prefix-and","permalink":"https://longsizhuo.github.io/tags/Prefix-and/"}]},{"title":"1138. The path on the letter board One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/fd471847.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1139. The greatest 1 Formation of the border  One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/eb193c1f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Prefix and","slug":"Prefix-and","permalink":"https://longsizhuo.github.io/tags/Prefix-and/"}]},{"title":"1233Delete the subfolder folder One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/6610c769.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Dictionary tree","slug":"Dictionary-tree","permalink":"https://longsizhuo.github.io/tags/Dictionary-tree/"}]},{"title":"1234. Replace the sub -string to get a balanced string One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/56d97dcf.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1237. Find out the positive combination of the given square  One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/14b94db7.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1250. examine「Good array」 One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/435a9a0d.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"}]},{"title":"1551. Make all the minimum operations of all elements in the array","date":"2023-12-31T13:00:00.000Z","path":"post/b2a927d5.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"}]},{"title":"142.Ring linkedII","date":"2023-12-31T13:00:00.000Z","path":"post/e2c9cca9.html","excerpt":"142.Ring listII.md Thought：Problem -solving：这类Linkedtopic一般都yes使用双pointer法解决的，For example, looking for distance tail K Node、Find a ring entrance、Find the entrance of the public tail, etc.。 Algorithm： Double pointer met for the first time： Set two pointers fast，slow 指向Linked头部 head，fast Walk per round 2 step，slow Walk per round 1 step； a. First result： fast pointer走过Linked末端，说明Linked无环，直接return null； .TIPS: If there is a ring，Two pointers will definitely meet。Because every time I go 1 wheel，fast and slow Pitch +1，fast The event will catch up slow； b. Second result： whenfast == slowhour， Two pointers in the ring First encounter 。下面分析此hourfast and slowPassing step数关系 ： .设Linked共have a+b Node，in Linked头部到Linked入口 have a Node（不计Linked入口节点）， Linked环 have b Node（这里需要Notice，a and b yes未知数，例如图解上Linked a=4 , b=5）；Set two pointers分别走了 f，s step，则have： a. fast 走的step数yesslowstep数的 2 Double，Right now f=2s；（Analyze： fast Walk per round 2 step） b.fast Compare slowGo more n Length of a ring，Right now f=s+nb；（ Analyze： Double pointers have gone through a step，然后在环Inside绕圈直到重合，重合hour fast Compare slow Go 环的长度整数Double ）； .The above two types are reduced：f=2nb，s=nb，Right nowfastandslow The pointer left separately 2n，n indivual Circumference of the ring （Notice： n yes未知数，不同Linked的情况不同）。","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1590.Make the array and energyPDivide","date":"2023-12-31T13:00:00.000Z","path":"post/59825e1f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1604Warn alert person who uses the same employee card within one hour One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/bb7bcf54.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"}]},{"title":"1653. The minimum number of times to balance the string balance","date":"2023-12-31T13:00:00.000Z","path":"post/cac21f27.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1663. The smallest string with a given value One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/4d7252f8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"}]},{"title":"1664. Number of schemes to generate balance numbers One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/1978f474.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"}]},{"title":"1669. Merge two linked watches One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/d482ac75.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"Linked","slug":"Linked","permalink":"https://longsizhuo.github.io/tags/Linked/"}]},{"title":"1798You can construct the maximum number of continuity One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/3667cd44.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"}]},{"title":"1801-1803 Liech buckle novice！","date":"2023-12-31T13:00:00.000Z","path":"post/2f3e8e26.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"1813. Sentence similarity III","date":"2023-12-31T13:00:00.000Z","path":"post/69c2a1dd.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"Double pointer","slug":"Double-pointer","permalink":"https://longsizhuo.github.io/tags/Double-pointer/"}]},{"title":"1814. Statistics the number of good pairs in an array One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/ceb1e67f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"Double pointer","slug":"Double-pointer","permalink":"https://longsizhuo.github.io/tags/Double-pointer/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"}]},{"title":"1817. Find the number of users of users active One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/d0a9337b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"}]},{"title":"1819.Different numbers in the sequence","date":"2023-12-31T13:00:00.000Z","path":"post/de522cea.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"}]},{"title":"1825. Seek out MK average value","date":"2023-12-31T13:00:00.000Z","path":"post/6be57ef7.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"},{"name":"Graph Theory","slug":"Graph-Theory","permalink":"https://longsizhuo.github.io/tags/Graph-Theory/"}]},{"title":"1825. Seek out MK average value","date":"2023-12-31T13:00:00.000Z","path":"post/6be57ef7.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"},{"name":"Multiple set","slug":"Multiple-set","permalink":"https://longsizhuo.github.io/tags/Multiple-set/"}]},{"title":"1828. Statistics the number of a circle mid -point One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/3277549c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"}]},{"title":"19.Delete the countdown of the linked listNNode","date":"2023-12-31T13:00:00.000Z","path":"post/c916b663.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"PythonCoincidence，Random algorithmO(nlogn)Push","date":"2023-12-31T13:00:00.000Z","path":"post/a1d26db4.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"209.Small length array","date":"2023-12-31T13:00:00.000Z","path":"post/e6227611.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"217. Existing duplicate elements C++/Python3","date":"2023-12-31T13:00:00.000Z","path":"post/717042a6.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"C++","slug":"C","permalink":"https://longsizhuo.github.io/tags/C/"}]},{"title":"217. Existing duplicate elements C++/Python3","date":"2023-12-31T13:00:00.000Z","path":"post/717042a6.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"C++","slug":"C","permalink":"https://longsizhuo.github.io/tags/C/"}]},{"title":"219.Existing duplicate elements II Hash table graphics","date":"2023-12-31T13:00:00.000Z","path":"post/16b0e9f1.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"}]},{"title":"221Maximum square","date":"2023-12-31T13:00:00.000Z","path":"post/e03edda.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"}]},{"title":"One question daily 2283","date":"2023-12-31T13:00:00.000Z","path":"post/c3f7f59f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"One question daily 2293. Great mini game","date":"2023-12-31T13:00:00.000Z","path":"post/9df6242c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"One question daily 2299. Code inspection device II","date":"2023-12-31T13:00:00.000Z","path":"post/7ded25bb.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Bit operation","slug":"Bit-operation","permalink":"https://longsizhuo.github.io/tags/Bit-operation/"}]},{"title":"2303. Calculate the total taxable amount","date":"2023-12-31T13:00:00.000Z","path":"post/11597f8b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"}]},{"title":"2309. The best English letters with both appropriates and lowercases One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/b4953d62.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"C++","slug":"C","permalink":"https://longsizhuo.github.io/tags/C/"},{"name":"Bit operation","slug":"Bit-operation","permalink":"https://longsizhuo.github.io/tags/Bit-operation/"}]},{"title":"2315. Statistical star number One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/dc8d7590.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"}]},{"title":"2319Determine whether the matrix is ​​one X matrix One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/f7c5db77.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"2325Decrypt One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/f4b99a74.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"}]},{"title":"2331Calculate the value of the Boolean binary tree One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/a564ea0e.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Binary tree","slug":"Binary-tree","permalink":"https://longsizhuo.github.io/tags/Binary-tree/"}]},{"title":"2335. The shortest total time to be filled with a cup One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/4400daa1.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"},{"name":"dp","slug":"dp","permalink":"https://longsizhuo.github.io/tags/dp/"}]},{"title":"2341. How much can the array be formed  One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/f953c753.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"24.Two or two exchanges linked watches","date":"2023-12-31T13:00:00.000Z","path":"post/d030a5a0.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"2527.Query arrayXorBeautiful value Zhou Sai Third Question","date":"2023-12-31T13:00:00.000Z","path":"post/20ffa67a.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"2639. Query the width of each column in the grid diagram","date":"2023-12-31T13:00:00.000Z","path":"post/5a764983.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"2679.In the matrix and the harmony","date":"2023-12-31T13:00:00.000Z","path":"post/5277100.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"matrix","slug":"matrix","permalink":"https://longsizhuo.github.io/tags/matrix/"},{"name":"Sort","slug":"Sort","permalink":"https://longsizhuo.github.io/tags/Sort/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"},{"name":"heap（Priority queue）","slug":"heap（Priority-queue）","permalink":"https://longsizhuo.github.io/tags/heap%EF%BC%88Priority-queue%EF%BC%89/"}]},{"title":"271. Code and decoding of string - Python Add the transposition symbol solution method Dual complexityO(n)","date":"2023-12-31T13:00:00.000Z","path":"post/5992f238.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"2997. Make an array or harmony K The minimum number of operations","date":"2023-12-31T13:00:00.000Z","path":"post/3109a910.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"},{"name":"Bit operation","slug":"Bit-operation","permalink":"https://longsizhuo.github.io/tags/Bit-operation/"}]},{"title":"2998. make X and Y Equal number of operations","date":"2023-12-31T13:00:00.000Z","path":"post/5ee4164.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"Priority search","slug":"Priority-search","permalink":"https://longsizhuo.github.io/tags/Priority-search/"},{"name":"Memory search","slug":"Memory-search","permalink":"https://longsizhuo.github.io/tags/Memory-search/"}]},{"title":"3072. Allocate elements into two arrays II","date":"2023-12-31T13:00:00.000Z","path":"post/48a38683.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"},{"name":"Tree array","slug":"Tree-array","permalink":"https://longsizhuo.github.io/tags/Tree-array/"},{"name":"Thread tree","slug":"Thread-tree","permalink":"https://longsizhuo.github.io/tags/Thread-tree/"}]},{"title":"345. Voice letter in the reverse string","date":"2023-12-31T13:00:00.000Z","path":"post/1c57c22c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"350.The intersection of two array","date":"2023-12-31T13:00:00.000Z","path":"post/616577aa.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"Double pointer","slug":"Double-pointer","permalink":"https://longsizhuo.github.io/tags/Double-pointer/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"}]},{"title":"445.Two numbersII","date":"2023-12-31T13:00:00.000Z","path":"post/2c4cc46c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"Linked","slug":"Linked","permalink":"https://longsizhuo.github.io/tags/Linked/"},{"name":"recursion","slug":"recursion","permalink":"https://longsizhuo.github.io/tags/recursion/"},{"name":"Stack","slug":"Stack","permalink":"https://longsizhuo.github.io/tags/Stack/"}]},{"title":"538.Convert the binary search tree to cumulative tree","date":"2023-12-31T13:00:00.000Z","path":"post/32401b69.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Binary tree","slug":"Binary-tree","permalink":"https://longsizhuo.github.io/tags/Binary-tree/"}]},{"title":"6275. Make all the minimum operations of all elements in the array II","date":"2023-12-31T13:00:00.000Z","path":"post/4e14482b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"}]},{"title":"6293. Count the number of good array","date":"2023-12-31T13:00:00.000Z","path":"post/81004405.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"}]},{"title":"6300. Minimum public value","date":"2023-12-31T13:00:00.000Z","path":"post/fefe18d8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"6323. Child that divides money the most","date":"2023-12-31T13:00:00.000Z","path":"post/b9130c0e.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"6324. Maximize the great value of the array","date":"2023-12-31T13:00:00.000Z","path":"post/1e6b72b8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"6331The most prizes won in the two lines make()usage","date":"2023-12-31T13:00:00.000Z","path":"post/14d9382b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"}]},{"title":"6338. Number of methods of monkey collision Weekly","date":"2023-12-31T13:00:00.000Z","path":"post/2aa720ec.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"Fast power","slug":"Fast-power","permalink":"https://longsizhuo.github.io/tags/Fast-power/"},{"name":"Weekly","slug":"Weekly","permalink":"https://longsizhuo.github.io/tags/Weekly/"}]},{"title":"6347Number of vowel string within the scope of statistics","date":"2023-12-31T13:00:00.000Z","path":"post/52923acb.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"6351. The scores of the array after the marking all elements","date":"2023-12-31T13:00:00.000Z","path":"post/20116270.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"704. Two -point search","date":"2023-12-31T13:00:00.000Z","path":"post/41f30363.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"76Minimum cover string","date":"2023-12-31T13:00:00.000Z","path":"post/ae10d3c1.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"}]},{"title":"Python beat98.40% collectionsofCounter method！","date":"2023-12-31T13:00:00.000Z","path":"post/73b5ce9c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"977.Orderly array square","date":"2023-12-31T13:00:00.000Z","path":"post/a386fcdc.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"Sword finger Offer 43. 1～n Integer 1 Number of times","date":"2023-12-31T13:00:00.000Z","path":"post/f0d96a1f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"}]},{"title":"121.The best time for buying and selling stocks","date":"2023-12-31T13:00:00.000Z","path":"post/3a21fe32.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"}]},{"title":"1222.Can attack the queen of the king","date":"2023-12-31T13:00:00.000Z","path":"post/a6577367.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"matrix","slug":"matrix","permalink":"https://longsizhuo.github.io/tags/matrix/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"}]},{"title":"122.The best time for buying and selling stocksII","date":"2023-12-31T13:00:00.000Z","path":"post/a75da5a.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"}]},{"title":"1253.Reconstruct 2 Line binary matrix","date":"2023-12-31T13:00:00.000Z","path":"post/5c98e66b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"matrix","slug":"matrix","permalink":"https://longsizhuo.github.io/tags/matrix/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"},{"name":"medium","slug":"medium","permalink":"https://longsizhuo.github.io/tags/medium/"}]},{"title":"1333.Restaurant filter","date":"2023-12-31T13:00:00.000Z","path":"post/7f1331bc.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"Sort","slug":"Sort","permalink":"https://longsizhuo.github.io/tags/Sort/"}]},{"title":"1460.Class ScheduleIV","date":"2023-12-31T13:00:00.000Z","path":"post/d8b8a149.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Priority search","slug":"Priority-search","permalink":"https://longsizhuo.github.io/tags/Priority-search/"},{"name":"In -depth priority search","slug":"In-depth-priority-search","permalink":"https://longsizhuo.github.io/tags/In-depth-priority-search/"},{"name":"picture","slug":"picture","permalink":"https://longsizhuo.github.io/tags/picture/"},{"name":"Topology","slug":"Topology","permalink":"https://longsizhuo.github.io/tags/Topology/"}]},{"title":"146.LRU cache","date":"2023-12-31T13:00:00.000Z","path":"post/b9130c0e.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"Linked","slug":"Linked","permalink":"https://longsizhuo.github.io/tags/Linked/"},{"name":"design","slug":"design","permalink":"https://longsizhuo.github.io/tags/design/"},{"name":"双向Linked","slug":"双向Linked","permalink":"https://longsizhuo.github.io/tags/%E5%8F%8C%E5%90%91Linked/"}]},{"title":"213.Hiccup II","date":"2023-12-31T13:00:00.000Z","path":"post/85beb0bf.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"}]},{"title":"2251.The number of flowers during the flowering period","date":"2023-12-31T13:00:00.000Z","path":"post/3a21fe32.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Prefix and","slug":"Prefix-and","permalink":"https://longsizhuo.github.io/tags/Prefix-and/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"Sort","slug":"Sort","permalink":"https://longsizhuo.github.io/tags/Sort/"},{"name":"Two -point search","slug":"Two-point-search","permalink":"https://longsizhuo.github.io/tags/Two-point-search/"},{"name":"Orderly collection","slug":"Orderly-collection","permalink":"https://longsizhuo.github.io/tags/Orderly-collection/"}]},{"title":"2490Return ring sentence","date":"2023-12-31T13:00:00.000Z","path":"post/5c07686c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"String","slug":"String","permalink":"https://longsizhuo.github.io/tags/String/"}]},{"title":"2562.Find the series of the array","date":"2023-12-31T13:00:00.000Z","path":"post/b625a0e1.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Double pointer","slug":"Double-pointer","permalink":"https://longsizhuo.github.io/tags/Double-pointer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"}]},{"title":"2582.Pillow","date":"2023-12-31T13:00:00.000Z","path":"post/82e09f92.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"}]},{"title":"2591.Child that divides money the most","date":"2023-12-31T13:00:00.000Z","path":"post/6a9ab144.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"}]},{"title":"2596.Check the Cavaliers patrol plan","date":"2023-12-31T13:00:00.000Z","path":"post/29546b92.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"matrix","slug":"matrix","permalink":"https://longsizhuo.github.io/tags/matrix/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"},{"name":"Priority search","slug":"Priority-search","permalink":"https://longsizhuo.github.io/tags/Priority-search/"},{"name":"In -depth priority search","slug":"In-depth-priority-search","permalink":"https://longsizhuo.github.io/tags/In-depth-priority-search/"}]},{"title":"2 .Two numbers","date":"2023-12-31T13:00:00.000Z","path":"post/fa9db6b8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"Linked","slug":"Linked","permalink":"https://longsizhuo.github.io/tags/Linked/"},{"name":"recursion","slug":"recursion","permalink":"https://longsizhuo.github.io/tags/recursion/"}]},{"title":"213.Hiccup III","date":"2023-12-31T13:00:00.000Z","path":"post/86590614.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"Binary tree","slug":"Binary-tree","permalink":"https://longsizhuo.github.io/tags/Binary-tree/"},{"name":"In -depth priority search","slug":"In-depth-priority-search","permalink":"https://longsizhuo.github.io/tags/In-depth-priority-search/"},{"name":"Tree","slug":"Tree","permalink":"https://longsizhuo.github.io/tags/Tree/"}]},{"title":"630.Class ScheduleIII","date":"2023-12-31T13:00:00.000Z","path":"post/e14241e.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"},{"name":"Priority queue","slug":"Priority-queue","permalink":"https://longsizhuo.github.io/tags/Priority-queue/"}]},{"title":"LCP 06.Coin","date":"2023-12-31T13:00:00.000Z","path":"post/66079b7b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"}]},{"title":"LCP 50.Gem supply","date":"2023-12-31T13:00:00.000Z","path":"post/762ca698.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"}]},{"title":"brief_alternate Assignment","date":"2023-12-31T13:00:00.000Z","path":"post/dbbd7d58.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"pandas","slug":"pandas","permalink":"https://longsizhuo.github.io/tags/pandas/"}]},{"title":"GOlanguage# GOlanguage可爱捏","date":"2023-12-31T13:00:00.000Z","path":"post/67fc8613.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"Inline expansion","date":"2023-12-31T13:00:00.000Z","path":"post/2660e935.html","excerpt":"","tags":[{"name":"Composition principle","slug":"Composition-principle","permalink":"https://longsizhuo.github.io/tags/Composition-principle/"}]},{"title":"Some doubt","date":"2023-12-31T13:00:00.000Z","path":"post/941aeb72.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"encryption","slug":"encryption","permalink":"https://longsizhuo.github.io/tags/encryption/"}]},{"title":"math","date":"2023-12-31T13:00:00.000Z","path":"post/a927044d.html","excerpt":"like $\\lim_{x \\to 0} \\frac{\\sin x}{x}$ Rendering $$\\begin{eqnarray} \\lim_{x \\to 0} \\frac{\\sin x + x^2 + x^3}{x} &amp; = &amp; \\lim_{x \\to 0} \\frac{\\sin x }{x} + \\lim_{x \\to 0} \\frac{x^2 }{x} + \\lim_{x \\to 0}\\frac{x^3}{x}\\\\ &amp; = &amp; \\lim_{x \\to 0}\\frac{\\sin x}{x}\\\\ &amp; = &amp; 1\\end{eqnarray}$$","tags":[{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"}]},{"title":"Sword finger Offer 68 - II. The recent public ancestor of the binary tree","date":"2023-12-31T13:00:00.000Z","path":"post/36f314aa.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"Sword finger Offer II 021. Delete the countdown of the linked list n Node","date":"2023-12-31T13:00:00.000Z","path":"post/3ed2f01c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"2085. Public string that has occurred once","date":"2023-11-30T13:00:00.000Z","path":"post/bbe4bff6.html","excerpt":"","tags":[{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"String","slug":"String","permalink":"https://longsizhuo.github.io/tags/String/"},{"name":"count","slug":"count","permalink":"https://longsizhuo.github.io/tags/count/"}]},{"title":"1004.Maximum continuity1Number III Maximum continuity1Number III","date":"2022-12-06T14:15:00.000Z","path":"post/ed19b576.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]}]
\ No newline at end of file
diff --git a/html/Sichuan_Traveler/404.html b/html/Sichuan_Traveler/404.html
index 421b9226e..a2691f2d0 100644
--- a/html/Sichuan_Traveler/404.html
+++ b/html/Sichuan_Traveler/404.html
@@ -649,7 +649,7 @@ <h1 class="fourofour">404</h1><script>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/html/Sichuan_Traveler/Mark_down_.html b/html/Sichuan_Traveler/Mark_down_.html
index 9009167bc..685962e13 100644
--- a/html/Sichuan_Traveler/Mark_down_.html
+++ b/html/Sichuan_Traveler/Mark_down_.html
@@ -556,7 +556,7 @@ <h3>默认模式</h3>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/html/Sichuan_Traveler/ad.html b/html/Sichuan_Traveler/ad.html
index c46c868c3..04b6faf27 100644
--- a/html/Sichuan_Traveler/ad.html
+++ b/html/Sichuan_Traveler/ad.html
@@ -638,7 +638,7 @@ <h1>菜单</h1>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/html/Sichuan_Traveler/comment.html b/html/Sichuan_Traveler/comment.html
index ed9f8e28a..b9afb2cd6 100644
--- a/html/Sichuan_Traveler/comment.html
+++ b/html/Sichuan_Traveler/comment.html
@@ -618,7 +618,7 @@ <h1>菜单</h1>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/html/Sichuan_Traveler/design.html b/html/Sichuan_Traveler/design.html
index 2ea3b6319..345009242 100644
--- a/html/Sichuan_Traveler/design.html
+++ b/html/Sichuan_Traveler/design.html
@@ -738,7 +738,7 @@ <h1>菜单</h1>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/html/Sichuan_Traveler/index.html b/html/Sichuan_Traveler/index.html
index a3b52702f..e1aaee204 100644
--- a/html/Sichuan_Traveler/index.html
+++ b/html/Sichuan_Traveler/index.html
@@ -711,7 +711,7 @@ <h1>快捷操作</h1>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/html/Sichuan_Traveler/insert-ad.html b/html/Sichuan_Traveler/insert-ad.html
index c49d65058..d2c9d96bf 100644
--- a/html/Sichuan_Traveler/insert-ad.html
+++ b/html/Sichuan_Traveler/insert-ad.html
@@ -605,7 +605,7 @@ <h1>菜单</h1>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/html/Sichuan_Traveler/insert-comment.html b/html/Sichuan_Traveler/insert-comment.html
index 7f01ebc52..d233a28b3 100644
--- a/html/Sichuan_Traveler/insert-comment.html
+++ b/html/Sichuan_Traveler/insert-comment.html
@@ -605,7 +605,7 @@ <h1>菜单</h1>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/html/Sichuan_Traveler/insert.html b/html/Sichuan_Traveler/insert.html
index bb4c2a451..ddbd4893e 100644
--- a/html/Sichuan_Traveler/insert.html
+++ b/html/Sichuan_Traveler/insert.html
@@ -605,7 +605,7 @@ <h1>菜单</h1>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/html/Sichuan_Traveler/login.html b/html/Sichuan_Traveler/login.html
index 56f22bc4b..8bb9dd395 100644
--- a/html/Sichuan_Traveler/login.html
+++ b/html/Sichuan_Traveler/login.html
@@ -539,7 +539,7 @@ <h1>后台管理</h1>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/html/Sichuan_Traveler/system.html b/html/Sichuan_Traveler/system.html
index 15cb7d5e0..a1bb03f89 100644
--- a/html/Sichuan_Traveler/system.html
+++ b/html/Sichuan_Traveler/system.html
@@ -636,7 +636,7 @@ <h1><i class="icon-font">&#xe014;</i>信息设置</h1>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/html/Sichuan_Traveler/tj.html b/html/Sichuan_Traveler/tj.html
index 8dffad687..acb77f226 100644
--- a/html/Sichuan_Traveler/tj.html
+++ b/html/Sichuan_Traveler/tj.html
@@ -611,7 +611,7 @@ <h1><i class="icon-font">&#xe014;</i>景点统计</h1>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/html/home.html b/html/home.html
index 62f6de022..4008b0984 100644
--- a/html/home.html
+++ b/html/home.html
@@ -516,7 +516,7 @@
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/html/index.html b/html/index.html
index e06532b22..88f028d9c 100644
--- a/html/index.html
+++ b/html/index.html
@@ -580,7 +580,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/index.html b/index.html
index a8fcbfcfa..c497a3e97 100644
--- a/index.html
+++ b/index.html
@@ -337,7 +337,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">2.5k字</span>
+        <span class="post-count">2.8k字</span>
       </span>
     </span>
 
@@ -346,7 +346,7 @@ <h2 itemprop="name">
       <span class="post-meta-item-icon">
 	    <i class="fa fa-pagelines" aria-hidden="true"></i>
         <span class="post-meta-item-text">阅读时长: </span>
-        <span class="post-count">15min</span>
+        <span class="post-count">17min</span>
       </span>
     </span>
 	
@@ -469,6 +469,16 @@ <h1 id="Exercise-6"><a href="#Exercise-6" class="headerlink" title="Exercise 6:"
 </ol>
 <figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="comment"># Assume that the argument n is an integer.</span></span><br><span class="line"><span class="comment">#</span></span><br><span class="line"><span class="comment"># The output is printed out, not returned.</span></span><br><span class="line"><span class="comment">#</span></span><br><span class="line"><span class="comment"># You might find the abs() function useful.</span></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">f6</span>(<span class="params">n</span>):</span><br><span class="line">    <span class="keyword">if</span> n == <span class="number">0</span>:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;0 = 2^k * 0 for all integers k!&quot;</span>)</span><br><span class="line">    <span class="keyword">else</span>:</span><br><span class="line">        k = <span class="number">0</span></span><br><span class="line">        ori = n</span><br><span class="line">        <span class="keyword">if</span> n &lt; <span class="number">0</span>:</span><br><span class="line">            sign = <span class="string">&#x27;-&#x27;</span></span><br><span class="line">            n = -n</span><br><span class="line">        <span class="keyword">else</span>:</span><br><span class="line">            sign = <span class="string">&#x27;&#x27;</span></span><br><span class="line">        <span class="keyword">while</span> n % <span class="number">2</span> == <span class="number">0</span>:</span><br><span class="line">            n //= <span class="number">2</span></span><br><span class="line">            k += <span class="number">1</span></span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;<span class="subst">&#123;ori&#125;</span> = <span class="subst">&#123;sign&#125;</span>2^<span class="subst">&#123;k&#125;</span> * <span class="subst">&#123;n&#125;</span>&quot;</span>)</span><br><span class="line">    <span class="keyword">return</span></span><br></pre></td></tr></table></figure>
 
+<p><strong>FOR VERY VERY VERY VERY VERY BIG NUMBER:</strong></p>
+<p>When dealing with very large integers, the method of continuously dividing the number by 2 to factor out powers of 2 (2^k) can become inefficient. This is because each division can be costly in terms of computational time, especially for very large numbers with millions or billions of digits. Each division involves recalculating the entire integer, which is slow for large integers.<br>Using Bit Manipulation:</p>
+<p>A much more efficient approach is to use <strong>bit manipulation</strong> to determine how many times a number can be divided by 2 (i.e., how many factors of 2 it has). This method avoids division altogether and instead directly analyzes the binary representation of the number to count the number of trailing zeros, which correspond to the powers of 2 in the factorization.</p>
+<h3 id="Why"><a href="#Why" class="headerlink" title="Why?"></a>Why?</h3><ol>
+<li><p>Bitwise operations are much faster than arithmetic operations like division, especially for large integers. Counting the trailing zeros in a number’s binary representation can be done in constant time.</p>
+</li>
+<li><p>Extracting the lowest set bit of a number allows us to quickly find how many times a number can be divided by 2 without having to repeatedly divide the number. This provides the power of 2 (k) directly.</p>
+</li>
+</ol>
+<figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">def</span> <span class="title function_">f6</span>(<span class="params">n</span>):</span><br><span class="line">    <span class="keyword">if</span> n == <span class="number">0</span>:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;0 = 2^k * 0 for all integers k!&quot;</span>)</span><br><span class="line">        <span class="keyword">return</span></span><br><span class="line">    </span><br><span class="line">    <span class="comment"># Handle negative sign</span></span><br><span class="line">    sign = <span class="string">&#x27;-&#x27;</span> <span class="keyword">if</span> n &lt; <span class="number">0</span> <span class="keyword">else</span> <span class="string">&#x27;&#x27;</span></span><br><span class="line">    n = <span class="built_in">abs</span>(n)</span><br><span class="line">    </span><br><span class="line">    <span class="comment"># Using bit manipulation to count how many trailing zeros (powers of 2)</span></span><br><span class="line">    k = (n &amp; -n).bit_length() - <span class="number">1</span>  <span class="comment"># Count trailing zeros by isolating the lowest set bit</span></span><br><span class="line">    </span><br><span class="line">    <span class="comment"># Remove 2^k factor from n</span></span><br><span class="line">    m = n &gt;&gt; k  <span class="comment"># Equivalent to n // 2^k, shifting right by k bits</span></span><br><span class="line">    </span><br><span class="line">    <span class="comment"># Print the result</span></span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;<span class="subst">&#123;sign&#125;</span><span class="subst">&#123;n&#125;</span> = <span class="subst">&#123;sign&#125;</span>2^<span class="subst">&#123;k&#125;</span> * <span class="subst">&#123;m&#125;</span>&quot;</span>)</span><br></pre></td></tr></table></figure>
                 
             
 
@@ -625,7 +635,7 @@ <h3 id="Why-you-should-follow-me"><a href="#Why-you-should-follow-me" class="hea
 <li>I’m open to collaboration and feedback.</li>
 </ul>
 <h3 id="How-to-contact-me"><a href="#How-to-contact-me" class="headerlink" title="How to contact me"></a>How to contact me</h3><ul>
-<li>Email: <a href="mailto:&#x6c;&#111;&#110;&#103;&#115;&#105;&#x7a;&#104;&#x75;&#111;&#64;&#x67;&#x6d;&#x61;&#105;&#108;&#x2e;&#99;&#111;&#109;">&#x6c;&#111;&#110;&#103;&#115;&#105;&#x7a;&#104;&#x75;&#111;&#64;&#x67;&#x6d;&#x61;&#105;&#108;&#x2e;&#99;&#111;&#109;</a></li>
+<li>Email: <a href="mailto:&#x6c;&#111;&#x6e;&#103;&#x73;&#x69;&#x7a;&#104;&#117;&#x6f;&#64;&#103;&#x6d;&#97;&#x69;&#x6c;&#46;&#99;&#x6f;&#x6d;">&#x6c;&#111;&#x6e;&#103;&#x73;&#x69;&#x7a;&#104;&#117;&#x6f;&#64;&#103;&#x6d;&#97;&#x69;&#x6c;&#46;&#99;&#x6f;&#x6d;</a></li>
 <li>LinkedIn: <a target="_blank" rel="noopener" href="https://www.linkedin.com/in/longsizhuo/">Sizhuo Long</a></li>
 <li>XiaoHongShu(Small RedBook): <a target="_blank" rel="noopener" href="https://www.xiaohongshu.com/user/profile/5c0b8cc2000000000601e809">@sizhuo_long</a></li>
 </ul>
@@ -1576,20 +1586,20 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 
 <!-- 文章页添加mathjax公式 -->
   
-    <article id="post-1124. 表现良好的最长时间段_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-1017.负二进制转换_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/a5d1dfda.html">1124. The longest period of performance One question daily</a>
+      <a class="article-title_code_ant" href="/post/80cafdc8.html">1017.Negative binary conversion</a>
     </h2>
   
 
 
                 
-                    <a href="/post/a5d1dfda.html" class="archive-article-date">
+                    <a href="/post/80cafdc8.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -1621,7 +1631,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">260字</span>
+        <span class="post-count">220字</span>
       </span>
     </span>
 
@@ -1645,13 +1655,49 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-15.png" alt="2023-02-15.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/longest-well-performing-interval/description/">1124. The longest period of performance.md</a></p>
-<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>This question is not，I thought it was a double pointer but timeout over time，结果是Prefix and算法。The following is<a target="_blank" rel="noopener" href="https://leetcode.cn/problems/longest-well-performing-interval/solutions/2110211/liang-chong-zuo-fa-liang-zhang-tu-miao-d-hysl/">Spiritual god</a>Solution<br>通过Prefix and，我们可以把Elements and elements of sub -array转换成两个Prefix and的差，Right now<br>$$<br>\sum_{j=left}^{right} nums[j] = \sum_{j=0}^{right} nums[j]− \sum_{j=0}^{left-1} nums[j]=s[right+1]−s[left]<br>$$<br>Now that I said it「Elements and elements of sub -array」，那么利用Prefix and s，Turn the problem to：<br>Find two bidding i and j，satisfy j&lt;ij&lt;ij&lt;i and s[j]&lt;s[i]，maximize i−jValue。</p>
-<p><img src="https://pic.leetcode.cn/1676294271-XVWmuP-1124-3.png"></p>
-<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><figcaption><span>Double pointer</span></figcaption><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">longestWPI</span>(<span class="params">self, hours: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        ans = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> index, i <span class="keyword">in</span> <span class="built_in">enumerate</span>(hours):</span><br><span class="line">            count = <span class="number">0</span></span><br><span class="line">            j = index</span><br><span class="line">            <span class="keyword">while</span> j &lt; <span class="built_in">len</span>(hours):</span><br><span class="line">                <span class="keyword">if</span> hours[j] &lt;= <span class="number">8</span>:</span><br><span class="line">                    count -= <span class="number">1</span></span><br><span class="line">                <span class="keyword">elif</span> hours[j] &gt; <span class="number">8</span>:</span><br><span class="line">                    count += <span class="number">1</span></span><br><span class="line">                <span class="keyword">if</span> count &gt; <span class="number">0</span>:</span><br><span class="line">                    ans = <span class="built_in">max</span>(ans, j - index + <span class="number">1</span>)</span><br><span class="line">                j += <span class="number">1</span></span><br><span class="line">        <span class="keyword">return</span> ans</span><br></pre></td></tr></table></figure>
+                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p>Give you an integer <code>n</code> ，Return to the integer in the form of a binary string <strong>Negative binary（<code>base -2</code>）</strong>express。</p>
 
-<figure class="highlight python"><figcaption><span>Prefix and</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">longestWPI</span>(<span class="params">self, hours: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        n = <span class="built_in">len</span>(hours)</span><br><span class="line">        s = [<span class="number">0</span>] * (n + <span class="number">1</span>)</span><br><span class="line">        st = [<span class="number">0</span>]</span><br><span class="line">        <span class="keyword">for</span> j, h <span class="keyword">in</span> <span class="built_in">enumerate</span>(hours, <span class="number">1</span>):</span><br><span class="line">            s[j] = s[j - <span class="number">1</span>] + (<span class="number">1</span> <span class="keyword">if</span> h &gt; <span class="number">8</span> <span class="keyword">else</span> -<span class="number">1</span>)</span><br><span class="line">            <span class="keyword">if</span> s[j] &lt; s[st[-<span class="number">1</span>]]:</span><br><span class="line">                st.append(j)</span><br><span class="line">        ans = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(n, <span class="number">0</span> , -<span class="number">1</span>):</span><br><span class="line">            <span class="keyword">while</span> st <span class="keyword">and</span> s[i] &gt; s[st[-<span class="number">1</span>]]:</span><br><span class="line">                ans = <span class="built_in">max</span>(ans, i-st.pop())</span><br><span class="line">        <span class="keyword">return</span> ans</span><br></pre></td></tr></table></figure>
+<p><strong>Notice，</strong>Unless the string is&nbsp;<code>"0"</code>，Otherwise, the returned string cannot contain the front guide zero。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>Exemplary example 1：</strong></p>
+
+<pre>
+<strong>enter：</strong>n = 2
+<strong>Output：</strong>"110"
+<strong>explain：</strong>(-2)<sup>2</sup> + (-2)<sup>1</sup> = 2
+</pre>
+
+<p><strong>Exemplary example 2：</strong></p>
+
+<pre>
+<strong>enter：</strong>n = 3
+<strong>Output：</strong>"111"
+<strong>explain：</strong>(-2)<sup>2</sup> + (-2)<sup>1</sup> + (-2)<sup>0</sup> = 3
+</pre>
+
+<p><strong>Exemplary example 3：</strong></p>
+
+<pre>
+<strong>enter：</strong>n = 4
+<strong>Output：</strong>"100"
+<strong>explain：</strong>(-2)<sup>2</sup> = 4
+</pre>
+
+<p>&nbsp;</p>
 
+<p><strong>hint：</strong></p>
+
+<ul> 
+ <li><code>0 &lt;= n &lt;= 10<sup>9</sup></code></li> 
+</ul>
+
+<div><div>Related Topics</div><div><li>math</li></div></div><br><div><li>👍 111</li><li>👎 0</li></div>
+[1017.Negative binary conversion.md]()
+
+<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>We can judge n Every bit from low to high，If the bit is 1，Then the answer is 1，Otherwise 0。If the bit is 1，So we need to n minus k。Next we update n=⌊n/2⌋, k=−k。Continue to judge the next。<br>at last，We will return to the answer。<br>time complexity O(logn)，in n For the given integer。Ignore the space consumption of the answer，Spatial complexity O(1)。</p>
+<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">baseNeg2</span>(<span class="params">self, n: <span class="built_in">int</span></span>) -&gt; <span class="built_in">str</span>:</span><br><span class="line">        k = <span class="number">1</span></span><br><span class="line">        ans = []</span><br><span class="line">        <span class="keyword">while</span> n:</span><br><span class="line">            <span class="keyword">if</span> n % <span class="number">2</span>:</span><br><span class="line">                ans.append(<span class="string">&#x27;1&#x27;</span>)</span><br><span class="line">                n -= k</span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                ans.append(<span class="string">&#x27;0&#x27;</span>)</span><br><span class="line">            n //= <span class="number">2</span></span><br><span class="line">            k *= -<span class="number">1</span></span><br><span class="line">        <span class="keyword">return</span> <span class="string">&#x27;&#x27;</span>.join(ans[::-<span class="number">1</span>]) <span class="keyword">or</span> <span class="string">&#x27;0&#x27;</span></span><br></pre></td></tr></table></figure>
                 
             
 
@@ -1680,10 +1726,6 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
-        		</li>
       		
 		</ul>
 	</div>
@@ -1693,7 +1735,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/a5d1dfda.html">show all >></a>
+                    <a class="article-more-a" href="/post/80cafdc8.html">show all >></a>
                 </p>
             
 
@@ -1731,20 +1773,20 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 
 <!-- 文章页添加mathjax公式 -->
   
-    <article id="post-1017.负二进制转换_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-1124. 表现良好的最长时间段_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/80cafdc8.html">1017.Negative binary conversion</a>
+      <a class="article-title_code_ant" href="/post/a5d1dfda.html">1124. The longest period of performance One question daily</a>
     </h2>
   
 
 
                 
-                    <a href="/post/80cafdc8.html" class="archive-article-date">
+                    <a href="/post/a5d1dfda.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -1776,7 +1818,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">220字</span>
+        <span class="post-count">260字</span>
       </span>
     </span>
 
@@ -1800,49 +1842,13 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p>Give you an integer <code>n</code> ，Return to the integer in the form of a binary string <strong>Negative binary（<code>base -2</code>）</strong>express。</p>
-
-<p><strong>Notice，</strong>Unless the string is&nbsp;<code>"0"</code>，Otherwise, the returned string cannot contain the front guide zero。</p>
-
-<p>&nbsp;</p>
-
-<p><strong>Exemplary example 1：</strong></p>
-
-<pre>
-<strong>enter：</strong>n = 2
-<strong>Output：</strong>"110"
-<strong>explain：</strong>(-2)<sup>2</sup> + (-2)<sup>1</sup> = 2
-</pre>
-
-<p><strong>Exemplary example 2：</strong></p>
-
-<pre>
-<strong>enter：</strong>n = 3
-<strong>Output：</strong>"111"
-<strong>explain：</strong>(-2)<sup>2</sup> + (-2)<sup>1</sup> + (-2)<sup>0</sup> = 3
-</pre>
-
-<p><strong>Exemplary example 3：</strong></p>
-
-<pre>
-<strong>enter：</strong>n = 4
-<strong>Output：</strong>"100"
-<strong>explain：</strong>(-2)<sup>2</sup> = 4
-</pre>
-
-<p>&nbsp;</p>
-
-<p><strong>hint：</strong></p>
-
-<ul> 
- <li><code>0 &lt;= n &lt;= 10<sup>9</sup></code></li> 
-</ul>
+                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-15.png" alt="2023-02-15.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/longest-well-performing-interval/description/">1124. The longest period of performance.md</a></p>
+<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>This question is not，I thought it was a double pointer but timeout over time，结果是Prefix and算法。The following is<a target="_blank" rel="noopener" href="https://leetcode.cn/problems/longest-well-performing-interval/solutions/2110211/liang-chong-zuo-fa-liang-zhang-tu-miao-d-hysl/">Spiritual god</a>Solution<br>通过Prefix and，我们可以把Elements and elements of sub -array转换成两个Prefix and的差，Right now<br>$$<br>\sum_{j=left}^{right} nums[j] = \sum_{j=0}^{right} nums[j]− \sum_{j=0}^{left-1} nums[j]=s[right+1]−s[left]<br>$$<br>Now that I said it「Elements and elements of sub -array」，那么利用Prefix and s，Turn the problem to：<br>Find two bidding i and j，satisfy j&lt;ij&lt;ij&lt;i and s[j]&lt;s[i]，maximize i−jValue。</p>
+<p><img src="https://pic.leetcode.cn/1676294271-XVWmuP-1124-3.png"></p>
+<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><figcaption><span>Double pointer</span></figcaption><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">longestWPI</span>(<span class="params">self, hours: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        ans = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> index, i <span class="keyword">in</span> <span class="built_in">enumerate</span>(hours):</span><br><span class="line">            count = <span class="number">0</span></span><br><span class="line">            j = index</span><br><span class="line">            <span class="keyword">while</span> j &lt; <span class="built_in">len</span>(hours):</span><br><span class="line">                <span class="keyword">if</span> hours[j] &lt;= <span class="number">8</span>:</span><br><span class="line">                    count -= <span class="number">1</span></span><br><span class="line">                <span class="keyword">elif</span> hours[j] &gt; <span class="number">8</span>:</span><br><span class="line">                    count += <span class="number">1</span></span><br><span class="line">                <span class="keyword">if</span> count &gt; <span class="number">0</span>:</span><br><span class="line">                    ans = <span class="built_in">max</span>(ans, j - index + <span class="number">1</span>)</span><br><span class="line">                j += <span class="number">1</span></span><br><span class="line">        <span class="keyword">return</span> ans</span><br></pre></td></tr></table></figure>
 
-<div><div>Related Topics</div><div><li>math</li></div></div><br><div><li>👍 111</li><li>👎 0</li></div>
-[1017.Negative binary conversion.md]()
+<figure class="highlight python"><figcaption><span>Prefix and</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">longestWPI</span>(<span class="params">self, hours: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        n = <span class="built_in">len</span>(hours)</span><br><span class="line">        s = [<span class="number">0</span>] * (n + <span class="number">1</span>)</span><br><span class="line">        st = [<span class="number">0</span>]</span><br><span class="line">        <span class="keyword">for</span> j, h <span class="keyword">in</span> <span class="built_in">enumerate</span>(hours, <span class="number">1</span>):</span><br><span class="line">            s[j] = s[j - <span class="number">1</span>] + (<span class="number">1</span> <span class="keyword">if</span> h &gt; <span class="number">8</span> <span class="keyword">else</span> -<span class="number">1</span>)</span><br><span class="line">            <span class="keyword">if</span> s[j] &lt; s[st[-<span class="number">1</span>]]:</span><br><span class="line">                st.append(j)</span><br><span class="line">        ans = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(n, <span class="number">0</span> , -<span class="number">1</span>):</span><br><span class="line">            <span class="keyword">while</span> st <span class="keyword">and</span> s[i] &gt; s[st[-<span class="number">1</span>]]:</span><br><span class="line">                ans = <span class="built_in">max</span>(ans, i-st.pop())</span><br><span class="line">        <span class="keyword">return</span> ans</span><br></pre></td></tr></table></figure>
 
-<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>We can judge n Every bit from low to high，If the bit is 1，Then the answer is 1，Otherwise 0。If the bit is 1，So we need to n minus k。Next we update n=⌊n/2⌋, k=−k。Continue to judge the next。<br>at last，We will return to the answer。<br>time complexity O(logn)，in n For the given integer。Ignore the space consumption of the answer，Spatial complexity O(1)。</p>
-<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">baseNeg2</span>(<span class="params">self, n: <span class="built_in">int</span></span>) -&gt; <span class="built_in">str</span>:</span><br><span class="line">        k = <span class="number">1</span></span><br><span class="line">        ans = []</span><br><span class="line">        <span class="keyword">while</span> n:</span><br><span class="line">            <span class="keyword">if</span> n % <span class="number">2</span>:</span><br><span class="line">                ans.append(<span class="string">&#x27;1&#x27;</span>)</span><br><span class="line">                n -= k</span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                ans.append(<span class="string">&#x27;0&#x27;</span>)</span><br><span class="line">            n //= <span class="number">2</span></span><br><span class="line">            k *= -<span class="number">1</span></span><br><span class="line">        <span class="keyword">return</span> <span class="string">&#x27;&#x27;</span>.join(ans[::-<span class="number">1</span>]) <span class="keyword">or</span> <span class="string">&#x27;0&#x27;</span></span><br></pre></td></tr></table></figure>
                 
             
 
@@ -1871,6 +1877,10 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
+        		</li>
       		
 		</ul>
 	</div>
@@ -1880,7 +1890,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/80cafdc8.html">show all >></a>
+                    <a class="article-more-a" href="/post/a5d1dfda.html">show all >></a>
                 </p>
             
 
@@ -2126,7 +2136,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/music/index.html b/music/index.html
index 677e01d25..950a69269 100644
--- a/music/index.html
+++ b/music/index.html
@@ -573,7 +573,7 @@ <h1></h1>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/page/10/index.html b/page/10/index.html
index 4582ab2ec..f8a47d884 100644
--- a/page/10/index.html
+++ b/page/10/index.html
@@ -1961,7 +1961,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/page/11/index.html b/page/11/index.html
index 59550cb3a..192da2d09 100644
--- a/page/11/index.html
+++ b/page/11/index.html
@@ -966,7 +966,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/page/2/index.html b/page/2/index.html
index 6cde005f5..9af04bcd6 100644
--- a/page/2/index.html
+++ b/page/2/index.html
@@ -292,20 +292,20 @@
         <div id="js-content" class="content-ll">
           
   
-    <article id="post-1233删除子文件夹_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-1139. 最大的以 1 为边界的正方形_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/6610c769.html">1233Delete the subfolder folder One question daily</a>
+      <a class="article-title_code_ant" href="/post/eb193c1f.html">1139. The greatest 1 Formation of the border  One question daily</a>
     </h2>
   
 
 
                 
-                    <a href="/post/6610c769.html" class="archive-article-date">
+                    <a href="/post/eb193c1f.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -337,7 +337,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">587字</span>
+        <span class="post-count">331字</span>
       </span>
     </span>
 
@@ -346,7 +346,7 @@ <h2 itemprop="name">
       <span class="post-meta-item-icon">
 	    <i class="fa fa-pagelines" aria-hidden="true"></i>
         <span class="post-meta-item-text">阅读时长: </span>
-        <span class="post-count">3min</span>
+        <span class="post-count">2min</span>
       </span>
     </span>
 	
@@ -361,16 +361,11 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-09.png" alt="2023-02-09.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/remove-sub-folders-from-the-filesystem/description/">1233. Delete the subfolder folder</a></p>
-<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>脑子里的构思yesDictionary tree，But<code>Clanguage</code>的Dictionary tree，Whether it is<code>Python</code><br>still <code>golang</code>I won’t write。 So helpless can only look at the answer。<br>ylbThe big guy is right firstlistSort，Then traverse the list。</p>
-<p>1.ifiBefore<code>[len(ans[-1])]</code>Just happens<code>ans[-1]</code>The element is consistent，Explainiyes<br>ans[-1]Subfolder folder，Then skip。</p>
-<p>2.ifyes<code>[&quot;/a/b/c&quot;,&quot;/a/b/ca&quot;,&quot;/a/b/d&quot;]</code>This situation，Be alone1.的判断yes不够的，at this time<br><code>&quot;/a/b/ca&quot;</code>Before缀and<code>&quot;/a/b/c&quot;</code>yes一样的，但yescaandc实际上yes两个不同的文件夹，So add a judgment front end<br>yes否yes<code>/</code>，<code>&quot;/a/b/ca&quot;</code>and<code>&quot;/a/b/c/a&quot;</code>中后者才会被判定yes前面一个元素的子集。</p>
-<p>Dictionary tree没太看懂:<br>我们可以使用Dictionary tree存储数组 folder All folders in。<br>Dictionary tree的每个节点包含 children Field，Sub -nodes for storing the current nodes，as well as fid Field，<br>Used to store the folder corresponding to the current node in the array folder Bidding。</p>
-<p>For array folder Each folder in it f，We will first f according to / Divide into several skewers，<br>Then start from the root node，依次将子串加入Dictionary tree中。Next，我们从根节点开始搜索Dictionary tree，<br>if当前节点的 fid Field不为 -1，则说明当前节点对应的文件夹yes答案数组中的一个文件夹，<br>We add it to the array and return。otherwise，We search for all sub -nodes of the current node，Finally return to the array of answers。</p>
-<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><figcaption><span>python3</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">removeSubfolders</span>(<span class="params">self, folder: <span class="type">List</span>[<span class="built_in">str</span>]</span>) -&gt; <span class="type">List</span>[<span class="built_in">str</span>]:</span><br><span class="line">        folder.sort()</span><br><span class="line">        ans = [folder[<span class="number">0</span>]]</span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> folder[<span class="number">1</span>:]:</span><br><span class="line">            m, n = <span class="built_in">len</span>(ans[-<span class="number">1</span>]), <span class="built_in">len</span>(i)</span><br><span class="line">            <span class="comment"># if它的长度大于等于答案数组中最后一个文件夹的长度，并且它Before缀包含答案数组的最后一个文件夹再加上一个 /</span></span><br><span class="line">            <span class="keyword">if</span> m &gt;= n <span class="keyword">or</span> <span class="keyword">not</span> (ans[-<span class="number">1</span>] == i[:m] <span class="keyword">and</span> i[m] == <span class="string">&#x27;/&#x27;</span>):</span><br><span class="line">                ans.append(i)</span><br><span class="line">        <span class="keyword">return</span> ans</span><br><span class="line"><span class="comment"># Dictionary tree</span></span><br><span class="line"><span class="keyword">class</span> <span class="title class_">Trie</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">__init__</span>(<span class="params">self</span>):</span><br><span class="line">        self.children = &#123;&#125;</span><br><span class="line">        self.fid = -<span class="number">1</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">insert</span>(<span class="params">self, i, f</span>):</span><br><span class="line">        node = self</span><br><span class="line">        ps = f.split(<span class="string">&#x27;/&#x27;</span>)</span><br><span class="line">        <span class="keyword">for</span> p <span class="keyword">in</span> ps[<span class="number">1</span>:]:</span><br><span class="line">            <span class="keyword">if</span> p <span class="keyword">not</span> <span class="keyword">in</span> node.children:</span><br><span class="line">                node.children[p] = Trie()</span><br><span class="line">            node = node.children[p]</span><br><span class="line">        node.fid = <span class="number">1</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">search</span>(<span class="params">self</span>):</span><br><span class="line">        <span class="keyword">def</span> <span class="title function_">dfs</span>(<span class="params">root</span>):</span><br><span class="line">            <span class="keyword">if</span> root.fid != -<span class="number">1</span>:</span><br><span class="line">                ans.append(root.fid)</span><br><span class="line">                <span class="keyword">return</span></span><br><span class="line">            <span class="keyword">for</span> child <span class="keyword">in</span> root.children.values():</span><br><span class="line">                dfs(child)</span><br><span class="line">        ans = []</span><br><span class="line">        dfs(self)</span><br><span class="line">        <span class="keyword">return</span> ans</span><br><span class="line">    </span><br><span class="line">    </span><br><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">removeSubfolders</span>(<span class="params">self, folder: <span class="type">List</span>[<span class="built_in">str</span>]</span>) -&gt; <span class="type">List</span>[<span class="built_in">str</span>]:</span><br><span class="line">        trie = Trie()</span><br><span class="line">        <span class="keyword">for</span> i, f <span class="keyword">in</span> <span class="built_in">enumerate</span>(folder):</span><br><span class="line">            trie.insert(i, f)</span><br><span class="line">        <span class="keyword">return</span> [folder[i] <span class="keyword">for</span> i <span class="keyword">in</span> trie.search()]</span><br></pre></td></tr></table></figure>
-<figure class="highlight golang"><figcaption><span>golang</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="keyword">func</span> <span class="title">removeSubfolders</span><span class="params">(folder []<span class="type">string</span>)</span></span> (ans []<span class="type">string</span>) &#123;</span><br><span class="line">	sort.Strings(folder)</span><br><span class="line">	ans = []<span class="type">string</span>&#123;folder[<span class="number">0</span>]&#125;</span><br><span class="line">	<span class="keyword">for</span> _, i := <span class="keyword">range</span> folder[<span class="number">1</span>:] &#123;</span><br><span class="line">		m, n := <span class="built_in">len</span>(ans[<span class="built_in">len</span>(ans)<span class="number">-1</span>]), <span class="built_in">len</span>(i)</span><br><span class="line">		<span class="keyword">if</span> m &gt;= n || !(ans[<span class="built_in">len</span>(ans)<span class="number">-1</span>] == i[:m] &amp;&amp; i[m] == <span class="string">&#x27;/&#x27;</span>)&#123;</span><br><span class="line">			ans = <span class="built_in">append</span>(ans, i)</span><br><span class="line">		&#125;</span><br><span class="line">	&#125;</span><br><span class="line">	<span class="keyword">return</span> </span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
-
+                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-17.png" alt="2023-02-17.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/largest-1-bordered-square/description/">1139. The greatest 1 Formation of the border.md</a></p>
+<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>quiz6 Simple version，Prefix and求解。It should be noted that the upper left corner is0 Special circumstances are not considered，<br>Need to verify # superior Left Down right Four -edge 1 The number of individuals d<br><img src="https://pic.leetcode.cn/1676448329-qJcoyK-1139.png"></p>
+<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><figcaption><span>错误Code</span></figcaption><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">largest1BorderedSquare</span>(<span class="params">self, grid: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        matrix_heng = copy.deepcopy(grid)</span><br><span class="line">        matrix_su = copy.deepcopy(grid)</span><br><span class="line">        ans = <span class="number">0</span></span><br><span class="line">        <span class="keyword">if</span> <span class="built_in">len</span>(grid) == <span class="number">1</span>:</span><br><span class="line">            <span class="keyword">if</span> <span class="number">1</span> <span class="keyword">in</span> grid[<span class="number">0</span>]:</span><br><span class="line">                <span class="keyword">return</span> <span class="number">1</span></span><br><span class="line">            <span class="keyword">else</span>:<span class="keyword">return</span> <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> ind, i <span class="keyword">in</span> <span class="built_in">enumerate</span>(grid):</span><br><span class="line">            <span class="keyword">for</span> index <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(i)):</span><br><span class="line">                <span class="comment"># Each line adds</span></span><br><span class="line">                <span class="keyword">if</span> index &gt;= <span class="number">1</span>:</span><br><span class="line">                    matrix_heng[ind][index] += matrix_heng[ind][index-<span class="number">1</span>]</span><br><span class="line">                <span class="comment"># Add each column</span></span><br><span class="line">                <span class="keyword">if</span> ind &gt;= <span class="number">1</span>:</span><br><span class="line">                    matrix_su[ind][index] += matrix_su[ind-<span class="number">1</span>][index]</span><br><span class="line">        <span class="built_in">print</span>(matrix_heng, matrix_su)</span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(grid)):</span><br><span class="line">            <span class="keyword">for</span> j <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(grid[i])):</span><br><span class="line">                minus = <span class="built_in">min</span>(matrix_heng[i][j], matrix_su[i][j])</span><br><span class="line">                <span class="keyword">try</span>:</span><br><span class="line">                    <span class="keyword">if</span> grid[i-minus+<span class="number">1</span>][j-minus+<span class="number">1</span>] == <span class="number">1</span> <span class="keyword">and</span> i &gt;= minus-<span class="number">1</span> <span class="keyword">and</span> j &gt;= minus-<span class="number">1</span>:</span><br><span class="line">                        ans = <span class="built_in">max</span>(ans, minus ** <span class="number">2</span>)</span><br><span class="line">                <span class="keyword">except</span>:</span><br><span class="line">                    <span class="keyword">pass</span></span><br><span class="line">        <span class="keyword">return</span> ans</span><br></pre></td></tr></table></figure>
 
+<figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">largest1BorderedSquare</span>(<span class="params">self, grid: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        m, n = <span class="built_in">len</span>(grid), <span class="built_in">len</span>(grid[<span class="number">0</span>])</span><br><span class="line">        rs = [<span class="built_in">list</span>(accumulate(row, initial=<span class="number">0</span>)) <span class="keyword">for</span> row <span class="keyword">in</span> grid]  <span class="comment"># 每行的Prefix and</span></span><br><span class="line">        cs = [<span class="built_in">list</span>(accumulate(col, initial=<span class="number">0</span>)) <span class="keyword">for</span> col <span class="keyword">in</span> <span class="built_in">zip</span>(*grid)]  <span class="comment"># 每列的Prefix and</span></span><br><span class="line">        <span class="keyword">for</span> d <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">min</span>(m, n), <span class="number">0</span>, -<span class="number">1</span>):  <span class="comment"># From large to small enumeration square edges d</span></span><br><span class="line">            <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(m - d + <span class="number">1</span>):</span><br><span class="line">                <span class="keyword">for</span> j <span class="keyword">in</span> <span class="built_in">range</span>(n - d + <span class="number">1</span>):  <span class="comment"># 枚举正方形Leftsuperior角坐标 (i,j)</span></span><br><span class="line">                    <span class="comment"># superior Left Down right Four -edge 1 The number of individuals d</span></span><br><span class="line">                    <span class="keyword">if</span> rs[i][j + d] - rs[i][j] == d <span class="keyword">and</span> \</span><br><span class="line">                       cs[j][i + d] - cs[j][i] == d <span class="keyword">and</span> \</span><br><span class="line">                       rs[i + d - <span class="number">1</span>][j + d] - rs[i + d - <span class="number">1</span>][j] == d <span class="keyword">and</span> \</span><br><span class="line">                       cs[j + d - <span class="number">1</span>][i + d] - cs[j + d - <span class="number">1</span>][i] == d:</span><br><span class="line">                        <span class="keyword">return</span> d * d</span><br><span class="line">        <span class="keyword">return</span> <span class="number">0</span></span><br></pre></td></tr></table></figure>
                 
             
 
@@ -401,7 +396,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Dictionary tree</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
         		</li>
       		
 		</ul>
@@ -412,7 +407,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/6610c769.html">show all >></a>
+                    <a class="article-more-a" href="/post/eb193c1f.html">show all >></a>
                 </p>
             
 
@@ -450,20 +445,20 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 
 <!-- 文章页添加mathjax公式 -->
   
-    <article id="post-1139. 最大的以 1 为边界的正方形_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-1233删除子文件夹_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/eb193c1f.html">1139. The greatest 1 Formation of the border  One question daily</a>
+      <a class="article-title_code_ant" href="/post/6610c769.html">1233Delete the subfolder folder One question daily</a>
     </h2>
   
 
 
                 
-                    <a href="/post/eb193c1f.html" class="archive-article-date">
+                    <a href="/post/6610c769.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -495,7 +490,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">331字</span>
+        <span class="post-count">587字</span>
       </span>
     </span>
 
@@ -504,7 +499,7 @@ <h2 itemprop="name">
       <span class="post-meta-item-icon">
 	    <i class="fa fa-pagelines" aria-hidden="true"></i>
         <span class="post-meta-item-text">阅读时长: </span>
-        <span class="post-count">2min</span>
+        <span class="post-count">3min</span>
       </span>
     </span>
 	
@@ -519,11 +514,16 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-17.png" alt="2023-02-17.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/largest-1-bordered-square/description/">1139. The greatest 1 Formation of the border.md</a></p>
-<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>quiz6 Simple version，Prefix and求解。It should be noted that the upper left corner is0 Special circumstances are not considered，<br>Need to verify # superior Left Down right Four -edge 1 The number of individuals d<br><img src="https://pic.leetcode.cn/1676448329-qJcoyK-1139.png"></p>
-<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><figcaption><span>错误Code</span></figcaption><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">largest1BorderedSquare</span>(<span class="params">self, grid: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        matrix_heng = copy.deepcopy(grid)</span><br><span class="line">        matrix_su = copy.deepcopy(grid)</span><br><span class="line">        ans = <span class="number">0</span></span><br><span class="line">        <span class="keyword">if</span> <span class="built_in">len</span>(grid) == <span class="number">1</span>:</span><br><span class="line">            <span class="keyword">if</span> <span class="number">1</span> <span class="keyword">in</span> grid[<span class="number">0</span>]:</span><br><span class="line">                <span class="keyword">return</span> <span class="number">1</span></span><br><span class="line">            <span class="keyword">else</span>:<span class="keyword">return</span> <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> ind, i <span class="keyword">in</span> <span class="built_in">enumerate</span>(grid):</span><br><span class="line">            <span class="keyword">for</span> index <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(i)):</span><br><span class="line">                <span class="comment"># Each line adds</span></span><br><span class="line">                <span class="keyword">if</span> index &gt;= <span class="number">1</span>:</span><br><span class="line">                    matrix_heng[ind][index] += matrix_heng[ind][index-<span class="number">1</span>]</span><br><span class="line">                <span class="comment"># Add each column</span></span><br><span class="line">                <span class="keyword">if</span> ind &gt;= <span class="number">1</span>:</span><br><span class="line">                    matrix_su[ind][index] += matrix_su[ind-<span class="number">1</span>][index]</span><br><span class="line">        <span class="built_in">print</span>(matrix_heng, matrix_su)</span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(grid)):</span><br><span class="line">            <span class="keyword">for</span> j <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(grid[i])):</span><br><span class="line">                minus = <span class="built_in">min</span>(matrix_heng[i][j], matrix_su[i][j])</span><br><span class="line">                <span class="keyword">try</span>:</span><br><span class="line">                    <span class="keyword">if</span> grid[i-minus+<span class="number">1</span>][j-minus+<span class="number">1</span>] == <span class="number">1</span> <span class="keyword">and</span> i &gt;= minus-<span class="number">1</span> <span class="keyword">and</span> j &gt;= minus-<span class="number">1</span>:</span><br><span class="line">                        ans = <span class="built_in">max</span>(ans, minus ** <span class="number">2</span>)</span><br><span class="line">                <span class="keyword">except</span>:</span><br><span class="line">                    <span class="keyword">pass</span></span><br><span class="line">        <span class="keyword">return</span> ans</span><br></pre></td></tr></table></figure>
+                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-09.png" alt="2023-02-09.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/remove-sub-folders-from-the-filesystem/description/">1233. Delete the subfolder folder</a></p>
+<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>脑子里的构思yesDictionary tree，But<code>Clanguage</code>的Dictionary tree，Whether it is<code>Python</code><br>still <code>golang</code>I won’t write。 So helpless can only look at the answer。<br>ylbThe big guy is right firstlistSort，Then traverse the list。</p>
+<p>1.ifiBefore<code>[len(ans[-1])]</code>Just happens<code>ans[-1]</code>The element is consistent，Explainiyes<br>ans[-1]Subfolder folder，Then skip。</p>
+<p>2.ifyes<code>[&quot;/a/b/c&quot;,&quot;/a/b/ca&quot;,&quot;/a/b/d&quot;]</code>This situation，Be alone1.的判断yes不够的，at this time<br><code>&quot;/a/b/ca&quot;</code>Before缀and<code>&quot;/a/b/c&quot;</code>yes一样的，但yescaandc实际上yes两个不同的文件夹，So add a judgment front end<br>yes否yes<code>/</code>，<code>&quot;/a/b/ca&quot;</code>and<code>&quot;/a/b/c/a&quot;</code>中后者才会被判定yes前面一个元素的子集。</p>
+<p>Dictionary tree没太看懂:<br>我们可以使用Dictionary tree存储数组 folder All folders in。<br>Dictionary tree的每个节点包含 children Field，Sub -nodes for storing the current nodes，as well as fid Field，<br>Used to store the folder corresponding to the current node in the array folder Bidding。</p>
+<p>For array folder Each folder in it f，We will first f according to / Divide into several skewers，<br>Then start from the root node，依次将子串加入Dictionary tree中。Next，我们从根节点开始搜索Dictionary tree，<br>if当前节点的 fid Field不为 -1，则说明当前节点对应的文件夹yes答案数组中的一个文件夹，<br>We add it to the array and return。otherwise，We search for all sub -nodes of the current node，Finally return to the array of answers。</p>
+<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><figcaption><span>python3</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">removeSubfolders</span>(<span class="params">self, folder: <span class="type">List</span>[<span class="built_in">str</span>]</span>) -&gt; <span class="type">List</span>[<span class="built_in">str</span>]:</span><br><span class="line">        folder.sort()</span><br><span class="line">        ans = [folder[<span class="number">0</span>]]</span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> folder[<span class="number">1</span>:]:</span><br><span class="line">            m, n = <span class="built_in">len</span>(ans[-<span class="number">1</span>]), <span class="built_in">len</span>(i)</span><br><span class="line">            <span class="comment"># if它的长度大于等于答案数组中最后一个文件夹的长度，并且它Before缀包含答案数组的最后一个文件夹再加上一个 /</span></span><br><span class="line">            <span class="keyword">if</span> m &gt;= n <span class="keyword">or</span> <span class="keyword">not</span> (ans[-<span class="number">1</span>] == i[:m] <span class="keyword">and</span> i[m] == <span class="string">&#x27;/&#x27;</span>):</span><br><span class="line">                ans.append(i)</span><br><span class="line">        <span class="keyword">return</span> ans</span><br><span class="line"><span class="comment"># Dictionary tree</span></span><br><span class="line"><span class="keyword">class</span> <span class="title class_">Trie</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">__init__</span>(<span class="params">self</span>):</span><br><span class="line">        self.children = &#123;&#125;</span><br><span class="line">        self.fid = -<span class="number">1</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">insert</span>(<span class="params">self, i, f</span>):</span><br><span class="line">        node = self</span><br><span class="line">        ps = f.split(<span class="string">&#x27;/&#x27;</span>)</span><br><span class="line">        <span class="keyword">for</span> p <span class="keyword">in</span> ps[<span class="number">1</span>:]:</span><br><span class="line">            <span class="keyword">if</span> p <span class="keyword">not</span> <span class="keyword">in</span> node.children:</span><br><span class="line">                node.children[p] = Trie()</span><br><span class="line">            node = node.children[p]</span><br><span class="line">        node.fid = <span class="number">1</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">search</span>(<span class="params">self</span>):</span><br><span class="line">        <span class="keyword">def</span> <span class="title function_">dfs</span>(<span class="params">root</span>):</span><br><span class="line">            <span class="keyword">if</span> root.fid != -<span class="number">1</span>:</span><br><span class="line">                ans.append(root.fid)</span><br><span class="line">                <span class="keyword">return</span></span><br><span class="line">            <span class="keyword">for</span> child <span class="keyword">in</span> root.children.values():</span><br><span class="line">                dfs(child)</span><br><span class="line">        ans = []</span><br><span class="line">        dfs(self)</span><br><span class="line">        <span class="keyword">return</span> ans</span><br><span class="line">    </span><br><span class="line">    </span><br><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">removeSubfolders</span>(<span class="params">self, folder: <span class="type">List</span>[<span class="built_in">str</span>]</span>) -&gt; <span class="type">List</span>[<span class="built_in">str</span>]:</span><br><span class="line">        trie = Trie()</span><br><span class="line">        <span class="keyword">for</span> i, f <span class="keyword">in</span> <span class="built_in">enumerate</span>(folder):</span><br><span class="line">            trie.insert(i, f)</span><br><span class="line">        <span class="keyword">return</span> [folder[i] <span class="keyword">for</span> i <span class="keyword">in</span> trie.search()]</span><br></pre></td></tr></table></figure>
+<figure class="highlight golang"><figcaption><span>golang</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="keyword">func</span> <span class="title">removeSubfolders</span><span class="params">(folder []<span class="type">string</span>)</span></span> (ans []<span class="type">string</span>) &#123;</span><br><span class="line">	sort.Strings(folder)</span><br><span class="line">	ans = []<span class="type">string</span>&#123;folder[<span class="number">0</span>]&#125;</span><br><span class="line">	<span class="keyword">for</span> _, i := <span class="keyword">range</span> folder[<span class="number">1</span>:] &#123;</span><br><span class="line">		m, n := <span class="built_in">len</span>(ans[<span class="built_in">len</span>(ans)<span class="number">-1</span>]), <span class="built_in">len</span>(i)</span><br><span class="line">		<span class="keyword">if</span> m &gt;= n || !(ans[<span class="built_in">len</span>(ans)<span class="number">-1</span>] == i[:m] &amp;&amp; i[m] == <span class="string">&#x27;/&#x27;</span>)&#123;</span><br><span class="line">			ans = <span class="built_in">append</span>(ans, i)</span><br><span class="line">		&#125;</span><br><span class="line">	&#125;</span><br><span class="line">	<span class="keyword">return</span> </span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
+
 
-<figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">largest1BorderedSquare</span>(<span class="params">self, grid: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        m, n = <span class="built_in">len</span>(grid), <span class="built_in">len</span>(grid[<span class="number">0</span>])</span><br><span class="line">        rs = [<span class="built_in">list</span>(accumulate(row, initial=<span class="number">0</span>)) <span class="keyword">for</span> row <span class="keyword">in</span> grid]  <span class="comment"># 每行的Prefix and</span></span><br><span class="line">        cs = [<span class="built_in">list</span>(accumulate(col, initial=<span class="number">0</span>)) <span class="keyword">for</span> col <span class="keyword">in</span> <span class="built_in">zip</span>(*grid)]  <span class="comment"># 每列的Prefix and</span></span><br><span class="line">        <span class="keyword">for</span> d <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">min</span>(m, n), <span class="number">0</span>, -<span class="number">1</span>):  <span class="comment"># From large to small enumeration square edges d</span></span><br><span class="line">            <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(m - d + <span class="number">1</span>):</span><br><span class="line">                <span class="keyword">for</span> j <span class="keyword">in</span> <span class="built_in">range</span>(n - d + <span class="number">1</span>):  <span class="comment"># 枚举正方形Leftsuperior角坐标 (i,j)</span></span><br><span class="line">                    <span class="comment"># superior Left Down right Four -edge 1 The number of individuals d</span></span><br><span class="line">                    <span class="keyword">if</span> rs[i][j + d] - rs[i][j] == d <span class="keyword">and</span> \</span><br><span class="line">                       cs[j][i + d] - cs[j][i] == d <span class="keyword">and</span> \</span><br><span class="line">                       rs[i + d - <span class="number">1</span>][j + d] - rs[i + d - <span class="number">1</span>][j] == d <span class="keyword">and</span> \</span><br><span class="line">                       cs[j + d - <span class="number">1</span>][i + d] - cs[j + d - <span class="number">1</span>][i] == d:</span><br><span class="line">                        <span class="keyword">return</span> d * d</span><br><span class="line">        <span class="keyword">return</span> <span class="number">0</span></span><br></pre></td></tr></table></figure>
                 
             
 
@@ -554,7 +554,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Dictionary tree</a>
         		</li>
       		
 		</ul>
@@ -565,7 +565,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/eb193c1f.html">show all >></a>
+                    <a class="article-more-a" href="/post/6610c769.html">show all >></a>
                 </p>
             
 
@@ -1067,20 +1067,20 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 
 <!-- 文章页添加mathjax公式 -->
   
-    <article id="post-142.环形链表II_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-1551使数组中所有元素相等的最小操作数_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/e2c9cca9.html">142.Ring linkedII</a>
+      <a class="article-title_code_ant" href="/post/b2a927d5.html">1551. Make all the minimum operations of all elements in the array</a>
     </h2>
   
 
 
                 
-                    <a href="/post/e2c9cca9.html" class="archive-article-date">
+                    <a href="/post/b2a927d5.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -1112,7 +1112,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">738字</span>
+        <span class="post-count">516字</span>
       </span>
     </span>
 
@@ -1136,18 +1136,24 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <p><img src="../assets/img/2023-07-01%20(1).png" alt="2023-07-01 (1).png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/linked-list-cycle-ii/">142.Ring listII.md</a></p>
-<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><h3 id="Problem-solving："><a href="#Problem-solving：" class="headerlink" title="Problem -solving："></a>Problem -solving：</h3><p>这类Linkedtopic一般都yes使用双pointer法解决的，For example, looking for distance tail K Node、Find a ring entrance、Find the entrance of the public tail, etc.。</p>
-<h3 id="Algorithm："><a href="#Algorithm：" class="headerlink" title="Algorithm："></a>Algorithm：</h3><ol>
-<li><p>Double pointer met for the first time： Set two pointers fast，slow 指向Linked头部 head，fast Walk per round 2 step，slow Walk per round 1 step；</p>
-<p> a. First result： fast pointer走过Linked末端，说明Linked无环，直接return null；</p>
-<p> .TIPS: If there is a ring，Two pointers will definitely meet。Because every time I go 1 wheel，fast and slow Pitch +1，fast The event will catch up slow；<br> b. Second result： whenfast == slowhour， Two pointers in the ring First encounter 。下面分析此hourfast and slowPassing step数关系 ：</p>
-<p> .设Linked共have a+b Node，in Linked头部到Linked入口 have a Node（不计Linked入口节点）， Linked环 have b Node（这里需要Notice，a and b yes未知数，例如图解上Linked a=4 , b=5）；Set two pointers分别走了 f，s step，则have：<br> a. fast 走的step数yesslowstep数的 2 Double，Right now f=2s；（Analyze： fast Walk per round 2 step）<br> b.fast Compare slowGo more n Length of a ring，Right now f=s+nb；（ Analyze： Double pointers have gone through a step，然后在环Inside绕圈直到重合，重合hour fast Compare slow Go 环的长度整数Double ）；<br> .The above two types are reduced：f=2nb，s=nb，Right nowfastandslow The pointer left separately 2n，n indivual Circumference of the ring （Notice： n yes未知数，不同Linked的情况不同）。</p>
-</li>
+                    <p><img src="../assets/img/2023-01-22%20(3).png" alt="2023-01-22 (3).png"></p>
+<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>It is the second question of the weekly match：<a href="6275%CA%B9%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%D4%AA%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%C8%B5%EF%BF%BD%EF%BF%BD%EF%BF%BD%D0%A1%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD.md">6275Make all the minimum operations of all elements in the arrayII.md</a><br>The first edition of the heart of the heart。It’s completely different from the second edition，Originally wanted to practice the greedy algorithm。但是做着做着就发现了存在math规律。<br>Quote[yong]Big guy’s words：<br>Because it is the difference between the difference,很可能找到一个math公式,use<code>O(1)</code>Time complexity solution. Get a few simple examples first to find the rules</p>
+<ol>
+<li>n=3 The minimum operation is 2</li>
+<li>n=4 The minimum operation is 1 + 3</li>
+<li>n=5 The minimum operation is 2 + 4</li>
+<li>n=6 The minimum operation is 1 + 3 + 5</li>
+<li>n=7 The minimum operation is 2 + 4 + 6<br>whennWhen the number is,The minimum operation is<code>1 + 3 + 5 + ... + n-1 = n*n/4 </code><br>whennWhen it is a strange number,The minimum operation is<code>2 + 4 + ... + n-1 = (n*n - 1) / 4</code></li>
 </ol>
-                    
-                        <a class="article-more-a" href="/post/e2c9cca9.html#more">more >></a>
-                    
+<p>Get this question,Feel a bit around,Careful analysis discovery <code>arr[i] = (2 * i) + 1 (0 &lt;= i &lt; n)</code>Is a typical equal number list<code>(1,3,5,7,9...)</code>.<br>According to the formula of the equal number column,It’s easy to find a grouparrThe total element is<code>n^2</code>. In the question design, two bids are selected for each operationx ymake<code>arr[x]</code>minus one<code>arr[y]</code>plus one.<br>in other words,No matter how you choosex y,No matter how many times the operation,The sum of the array will not change. The design and guarantee that all elements in the array can ultimately be equal equal.<br>Then we assume that the final element is equal toaSo<code>n*a == n^2</code>,soa == n,That is to say, the final array elements are alln.actuallynIs the average value of the array.<br>Know the end element is allnback,Start traversing in the middle by starting from the start and end of the array,You can reach the smallest number of operations.<br>Suppose the bidding on the left is<code>i ((2 * i) + 1 &lt; n)</code>So相应右边的下标是<code>n - i.</code><br>The corresponding two elemental values ​​andnThe difference is<code>n - 1 + 2 * i</code>.so我们只要计算数组中值小于nElements andnSummary of difference,Get the minimum operation number.</p>
+<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight java"><figcaption><span>java</span></figcaption><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></pre></td><td class="code"><pre><span class="line"> <span class="type">int</span> <span class="title function_">minOperations</span><span class="params">(<span class="type">int</span> n)</span> &#123;</span><br><span class="line">     <span class="keyword">return</span> n * n / <span class="number">4</span>;</span><br><span class="line">&#125;</span><br><span class="line"><span class="comment">// Time and space complexity is all O(1)</span></span><br></pre></td></tr></table></figure>
+<figure class="highlight java"><figcaption><span>java</span></figcaption><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"> <span class="type">int</span> <span class="title function_">minOperations</span><span class="params">(<span class="type">int</span> n)</span> &#123;</span><br><span class="line">    <span class="type">int</span> <span class="variable">operation</span> <span class="operator">=</span> <span class="number">0</span>;</span><br><span class="line">    <span class="keyword">for</span>(<span class="type">int</span> <span class="variable">i</span> <span class="operator">=</span> <span class="number">1</span>; i &lt; n ; i += <span class="number">2</span>) &#123;</span><br><span class="line">        operation += (n - i);</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">return</span> operation;</span><br><span class="line">&#125;</span><br><span class="line"><span class="comment">// Time complexity isO(n) Space complexity isO(1)</span></span><br></pre></td></tr></table></figure>
+<figure class="highlight python"><figcaption><span>python</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">minOperations</span>(<span class="params">self, n: <span class="built_in">int</span></span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        operate = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="number">1</span>, n, <span class="number">2</span>):</span><br><span class="line">            operate += (n - i)</span><br><span class="line">        <span class="keyword">return</span> operate</span><br></pre></td></tr></table></figure>
+<figure class="highlight erlang"><figcaption><span>erlang</span></figcaption><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">-spec</span> min_operations<span class="params">(N :: integer())</span> -&gt; integer<span class="params">()</span>.</span><br><span class="line"><span class="function"><span class="title">min_operations</span><span class="params">(N)</span> -&gt;</span></span><br><span class="line">N * N <span class="keyword">div</span> <span class="number">4</span>.</span><br></pre></td></tr></table></figure>
+<figure class="highlight dart"><figcaption><span>dart</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="class"><span class="keyword">class</span> <span class="title">Solution</span> </span>&#123;</span><br><span class="line">  <span class="built_in">int</span> minOperations(<span class="built_in">int</span> n) &#123;</span><br><span class="line">    <span class="keyword">return</span> n * n ~/ <span class="number">4</span>;</span><br><span class="line">  &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
+<figure class="highlight elixir"><figcaption><span>elixir</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="class"><span class="keyword">defmodule</span> <span class="title">Solution</span></span> <span class="keyword">do</span></span><br><span class="line">  <span class="variable">@spec</span> min_operations(n :: integer) :: integer</span><br><span class="line">  <span class="function"><span class="keyword">def</span> <span class="title">min_operations</span></span>(n) <span class="keyword">do</span></span><br><span class="line">        div(n * n , <span class="number">4</span>)</span><br><span class="line">  <span class="keyword">end</span></span><br><span class="line"><span class="keyword">end</span></span><br></pre></td></tr></table></figure>
+
+
                 
             
 
@@ -1176,6 +1182,10 @@ <h3 id="Algorithm："><a href="#Algorithm：" class="headerlink" title="Algorith
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
+        		</li>
       		
 		</ul>
 	</div>
@@ -1185,7 +1195,7 @@ <h3 id="Algorithm："><a href="#Algorithm：" class="headerlink" title="Algorith
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/e2c9cca9.html">show all >></a>
+                    <a class="article-more-a" href="/post/b2a927d5.html">show all >></a>
                 </p>
             
 
@@ -1223,20 +1233,20 @@ <h3 id="Algorithm："><a href="#Algorithm：" class="headerlink" title="Algorith
 
 <!-- 文章页添加mathjax公式 -->
   
-    <article id="post-1551使数组中所有元素相等的最小操作数_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-142.环形链表II_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/b2a927d5.html">1551. Make all the minimum operations of all elements in the array</a>
+      <a class="article-title_code_ant" href="/post/e2c9cca9.html">142.Ring linkedII</a>
     </h2>
   
 
 
                 
-                    <a href="/post/b2a927d5.html" class="archive-article-date">
+                    <a href="/post/e2c9cca9.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -1268,7 +1278,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">516字</span>
+        <span class="post-count">738字</span>
       </span>
     </span>
 
@@ -1292,24 +1302,18 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <p><img src="../assets/img/2023-01-22%20(3).png" alt="2023-01-22 (3).png"></p>
-<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>It is the second question of the weekly match：<a href="6275%CA%B9%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%D4%AA%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%C8%B5%EF%BF%BD%EF%BF%BD%EF%BF%BD%D0%A1%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD.md">6275Make all the minimum operations of all elements in the arrayII.md</a><br>The first edition of the heart of the heart。It’s completely different from the second edition，Originally wanted to practice the greedy algorithm。但是做着做着就发现了存在math规律。<br>Quote[yong]Big guy’s words：<br>Because it is the difference between the difference,很可能找到一个math公式,use<code>O(1)</code>Time complexity solution. Get a few simple examples first to find the rules</p>
-<ol>
-<li>n=3 The minimum operation is 2</li>
-<li>n=4 The minimum operation is 1 + 3</li>
-<li>n=5 The minimum operation is 2 + 4</li>
-<li>n=6 The minimum operation is 1 + 3 + 5</li>
-<li>n=7 The minimum operation is 2 + 4 + 6<br>whennWhen the number is,The minimum operation is<code>1 + 3 + 5 + ... + n-1 = n*n/4 </code><br>whennWhen it is a strange number,The minimum operation is<code>2 + 4 + ... + n-1 = (n*n - 1) / 4</code></li>
+                    <p><img src="../assets/img/2023-07-01%20(1).png" alt="2023-07-01 (1).png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/linked-list-cycle-ii/">142.Ring listII.md</a></p>
+<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><h3 id="Problem-solving："><a href="#Problem-solving：" class="headerlink" title="Problem -solving："></a>Problem -solving：</h3><p>这类Linkedtopic一般都yes使用双pointer法解决的，For example, looking for distance tail K Node、Find a ring entrance、Find the entrance of the public tail, etc.。</p>
+<h3 id="Algorithm："><a href="#Algorithm：" class="headerlink" title="Algorithm："></a>Algorithm：</h3><ol>
+<li><p>Double pointer met for the first time： Set two pointers fast，slow 指向Linked头部 head，fast Walk per round 2 step，slow Walk per round 1 step；</p>
+<p> a. First result： fast pointer走过Linked末端，说明Linked无环，直接return null；</p>
+<p> .TIPS: If there is a ring，Two pointers will definitely meet。Because every time I go 1 wheel，fast and slow Pitch +1，fast The event will catch up slow；<br> b. Second result： whenfast == slowhour， Two pointers in the ring First encounter 。下面分析此hourfast and slowPassing step数关系 ：</p>
+<p> .设Linked共have a+b Node，in Linked头部到Linked入口 have a Node（不计Linked入口节点）， Linked环 have b Node（这里需要Notice，a and b yes未知数，例如图解上Linked a=4 , b=5）；Set two pointers分别走了 f，s step，则have：<br> a. fast 走的step数yesslowstep数的 2 Double，Right now f=2s；（Analyze： fast Walk per round 2 step）<br> b.fast Compare slowGo more n Length of a ring，Right now f=s+nb；（ Analyze： Double pointers have gone through a step，然后在环Inside绕圈直到重合，重合hour fast Compare slow Go 环的长度整数Double ）；<br> .The above two types are reduced：f=2nb，s=nb，Right nowfastandslow The pointer left separately 2n，n indivual Circumference of the ring （Notice： n yes未知数，不同Linked的情况不同）。</p>
+</li>
 </ol>
-<p>Get this question,Feel a bit around,Careful analysis discovery <code>arr[i] = (2 * i) + 1 (0 &lt;= i &lt; n)</code>Is a typical equal number list<code>(1,3,5,7,9...)</code>.<br>According to the formula of the equal number column,It’s easy to find a grouparrThe total element is<code>n^2</code>. In the question design, two bids are selected for each operationx ymake<code>arr[x]</code>minus one<code>arr[y]</code>plus one.<br>in other words,No matter how you choosex y,No matter how many times the operation,The sum of the array will not change. The design and guarantee that all elements in the array can ultimately be equal equal.<br>Then we assume that the final element is equal toaSo<code>n*a == n^2</code>,soa == n,That is to say, the final array elements are alln.actuallynIs the average value of the array.<br>Know the end element is allnback,Start traversing in the middle by starting from the start and end of the array,You can reach the smallest number of operations.<br>Suppose the bidding on the left is<code>i ((2 * i) + 1 &lt; n)</code>So相应右边的下标是<code>n - i.</code><br>The corresponding two elemental values ​​andnThe difference is<code>n - 1 + 2 * i</code>.so我们只要计算数组中值小于nElements andnSummary of difference,Get the minimum operation number.</p>
-<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight java"><figcaption><span>java</span></figcaption><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></pre></td><td class="code"><pre><span class="line"> <span class="type">int</span> <span class="title function_">minOperations</span><span class="params">(<span class="type">int</span> n)</span> &#123;</span><br><span class="line">     <span class="keyword">return</span> n * n / <span class="number">4</span>;</span><br><span class="line">&#125;</span><br><span class="line"><span class="comment">// Time and space complexity is all O(1)</span></span><br></pre></td></tr></table></figure>
-<figure class="highlight java"><figcaption><span>java</span></figcaption><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"> <span class="type">int</span> <span class="title function_">minOperations</span><span class="params">(<span class="type">int</span> n)</span> &#123;</span><br><span class="line">    <span class="type">int</span> <span class="variable">operation</span> <span class="operator">=</span> <span class="number">0</span>;</span><br><span class="line">    <span class="keyword">for</span>(<span class="type">int</span> <span class="variable">i</span> <span class="operator">=</span> <span class="number">1</span>; i &lt; n ; i += <span class="number">2</span>) &#123;</span><br><span class="line">        operation += (n - i);</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">return</span> operation;</span><br><span class="line">&#125;</span><br><span class="line"><span class="comment">// Time complexity isO(n) Space complexity isO(1)</span></span><br></pre></td></tr></table></figure>
-<figure class="highlight python"><figcaption><span>python</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">minOperations</span>(<span class="params">self, n: <span class="built_in">int</span></span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        operate = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="number">1</span>, n, <span class="number">2</span>):</span><br><span class="line">            operate += (n - i)</span><br><span class="line">        <span class="keyword">return</span> operate</span><br></pre></td></tr></table></figure>
-<figure class="highlight erlang"><figcaption><span>erlang</span></figcaption><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">-spec</span> min_operations<span class="params">(N :: integer())</span> -&gt; integer<span class="params">()</span>.</span><br><span class="line"><span class="function"><span class="title">min_operations</span><span class="params">(N)</span> -&gt;</span></span><br><span class="line">N * N <span class="keyword">div</span> <span class="number">4</span>.</span><br></pre></td></tr></table></figure>
-<figure class="highlight dart"><figcaption><span>dart</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="class"><span class="keyword">class</span> <span class="title">Solution</span> </span>&#123;</span><br><span class="line">  <span class="built_in">int</span> minOperations(<span class="built_in">int</span> n) &#123;</span><br><span class="line">    <span class="keyword">return</span> n * n ~/ <span class="number">4</span>;</span><br><span class="line">  &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
-<figure class="highlight elixir"><figcaption><span>elixir</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="class"><span class="keyword">defmodule</span> <span class="title">Solution</span></span> <span class="keyword">do</span></span><br><span class="line">  <span class="variable">@spec</span> min_operations(n :: integer) :: integer</span><br><span class="line">  <span class="function"><span class="keyword">def</span> <span class="title">min_operations</span></span>(n) <span class="keyword">do</span></span><br><span class="line">        div(n * n , <span class="number">4</span>)</span><br><span class="line">  <span class="keyword">end</span></span><br><span class="line"><span class="keyword">end</span></span><br></pre></td></tr></table></figure>
-
-
+                    
+                        <a class="article-more-a" href="/post/e2c9cca9.html#more">more >></a>
+                    
                 
             
 
@@ -1338,10 +1342,6 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
-        		</li>
       		
 		</ul>
 	</div>
@@ -1351,7 +1351,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/b2a927d5.html">show all >></a>
+                    <a class="article-more-a" href="/post/e2c9cca9.html">show all >></a>
                 </p>
             
 
@@ -1908,7 +1908,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/page/3/index.html b/page/3/index.html
index 17f085a52..31504db2d 100644
--- a/page/3/index.html
+++ b/page/3/index.html
@@ -448,20 +448,20 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 
 <!-- 文章页添加mathjax公式 -->
   
-    <article id="post-1669合并两个链表_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-1664生成平衡数组的方案数_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/d482ac75.html">1669. Merge two linked watches One question daily</a>
+      <a class="article-title_code_ant" href="/post/1978f474.html">1664. Number of schemes to generate balance numbers One question daily</a>
     </h2>
   
 
 
                 
-                    <a href="/post/d482ac75.html" class="archive-article-date">
+                    <a href="/post/1978f474.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -493,7 +493,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">163字</span>
+        <span class="post-count">235字</span>
       </span>
     </span>
 
@@ -517,11 +517,28 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/1675057199631.png" alt="1675057199631.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/merge-in-between-linked-lists/description/">1669. Merge two linked watches</a></p>
-<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>直接放上官方answer了，就yes模拟Linked。</p>
-<p>topic要求将 list1<br>First a arrive b Delete all nodes，Replace it for list2<br>。therefore，我们首先找arrive list1<br>B a−1 Node preA，As well as b+1 Node aftB。because 1≤a≤b&lt;n−1<br>（in n yes list1 length），so preA and aftB yes一定存在of。</p>
-<p>Then we let us give up preA of next direction list2<br>of头节点，Give up list2<br>of尾节点of next direction aftB To。</p>
-<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">ListNode</span>(<span class="title class_ inherited__">object</span>):</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">__init__</span>(<span class="params">self, x</span>):</span><br><span class="line">        self.val = x</span><br><span class="line">        self.<span class="built_in">next</span> = <span class="literal">None</span></span><br><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">mergeInBetween</span>(<span class="params">self, list1: ListNode, a: <span class="built_in">int</span>, b: <span class="built_in">int</span>, list2: ListNode</span>) -&gt; ListNode:</span><br><span class="line">        preA = list1</span><br><span class="line">        <span class="keyword">for</span> _ <span class="keyword">in</span> <span class="built_in">range</span>(a-<span class="number">1</span>):</span><br><span class="line">            preA = preA.<span class="built_in">next</span></span><br><span class="line">        preB = preA</span><br><span class="line">        <span class="keyword">for</span> _ <span class="keyword">in</span> <span class="built_in">range</span>(b - a + <span class="number">2</span>):</span><br><span class="line">            preB = preB.<span class="built_in">next</span></span><br><span class="line">        preA.<span class="built_in">next</span> = list2</span><br><span class="line">        <span class="keyword">while</span> list2.<span class="built_in">next</span>:</span><br><span class="line">            list2 = list2.<span class="built_in">next</span></span><br><span class="line">        list2.<span class="built_in">next</span> = preB</span><br><span class="line">        <span class="keyword">return</span> list1</span><br></pre></td></tr></table></figure>
+                    <p><img src="../assets/img/1674887518406.png" alt="1674887518406.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/ways-to-make-a-fair-array/description/?orderBy=most_relevant">1664. Number of schemes to generate balance numbers</a></p>
+<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>See when you read the question medium I know that it is definitely not really going to delete an element。Otherwise it will time out，So I tried to try polepythonFeature code：Use slice to process all data；<br>But it’s timeout。。</p>
+<p>然后看官方answer，用的Dynamic planning。中心Thought是：</p>
+<blockquote>
+<p>General nature，Now we will settle down i Delete elements，<br>Obviously the bidding i The previous element bidding will not change from this，Bidding i<br>The original was originally j，j&gt;iThe array elements of the bid will move to the bidding j−1，<br>Immediately bidding i The subsequent bidding elements will become the rated element，<br>The even bidding element will become a strange number of bidding elements。</p>
+</blockquote>
+<h1 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h1><figure class="highlight python"><figcaption><span>slice</span></figcaption><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">waysToMakeFair</span>(<span class="params">self, nums: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        flag = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(nums)):</span><br><span class="line">            temp_nums = nums[:i] + nums[i+<span class="number">1</span>:]</span><br><span class="line">            <span class="keyword">if</span> <span class="built_in">sum</span>(temp_nums[::<span class="number">2</span>])==<span class="built_in">sum</span>(temp_nums[<span class="number">1</span>::<span class="number">2</span>]):</span><br><span class="line">                flag += <span class="number">1</span></span><br><span class="line">        <span class="keyword">return</span> flag</span><br></pre></td></tr></table></figure>
+
+
+
+<figure class="highlight python"><figcaption><span>官方answer</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">waysToMakeFair</span>(<span class="params">self, nums: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        res = odd1 = even1 = odd2 = even2 = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> i, num <span class="keyword">in</span> <span class="built_in">enumerate</span>(nums):</span><br><span class="line">            <span class="keyword">if</span> i &amp; <span class="number">1</span>:</span><br><span class="line">                odd2 += num</span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                even2 += num</span><br><span class="line">        <span class="keyword">for</span> i, num <span class="keyword">in</span> <span class="built_in">enumerate</span>(nums):</span><br><span class="line">            <span class="keyword">if</span> i &amp; <span class="number">1</span>:</span><br><span class="line">                odd2 -= num</span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                even2 -= num</span><br><span class="line">            <span class="keyword">if</span> odd1 + even2 == odd2 + even1:</span><br><span class="line">                res += <span class="number">1</span></span><br><span class="line">            <span class="keyword">if</span> i &amp; <span class="number">1</span>:</span><br><span class="line">                odd1 += num</span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                even1 += num</span><br><span class="line">        <span class="keyword">return</span> res</span><br></pre></td></tr></table></figure>
+
+
+
+
+
+
+
+
+
+
+
                 
             
 
@@ -556,7 +573,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Linked</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
         		</li>
       		
 		</ul>
@@ -567,7 +584,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/d482ac75.html">show all >></a>
+                    <a class="article-more-a" href="/post/1978f474.html">show all >></a>
                 </p>
             
 
@@ -605,20 +622,20 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 
 <!-- 文章页添加mathjax公式 -->
   
-    <article id="post-1798你能构造出连续值的最大数目_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-1669合并两个链表_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/3667cd44.html">1798You can construct the maximum number of continuity One question daily</a>
+      <a class="article-title_code_ant" href="/post/d482ac75.html">1669. Merge two linked watches One question daily</a>
     </h2>
   
 
 
                 
-                    <a href="/post/3667cd44.html" class="archive-article-date">
+                    <a href="/post/d482ac75.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -650,7 +667,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">187字</span>
+        <span class="post-count">163字</span>
       </span>
     </span>
 
@@ -674,16 +691,11 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-05.png" alt="2023-02-05.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/maximum-number-of-consecutive-values-you-can-make/description/?orderBy=most_votes">1798. You can construct the maximum number of continuity</a></p>
-<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p><img src="../assets/img/4A052176419779588F1300C93180C44A.png" alt="4A052176419779588F1300C93180C44A.png"><br><img src="../assets/img/img.png" alt="img.png"><br><code>nums = [1,4,10,3,1]</code>1 ~ 10 All can be constructed，so11 ~ 20As well。<br>Traversal <code>nums = [1,1,3,4,10]</code>， if i&lt;= <em>Earlier+1</em></p>
-<blockquote>
-<p>$i_0(1) &lt;= 0+1; i_1(1) &lt;= 1+1; i_2(3) &lt;= 2+1; i_3(4) &lt;= 5+1; i_4(10) &lt;= 9+1$</p>
-</blockquote>
-<p>, ExplainiThe previous numbers can be constructed。<code>if i &gt; m + 1</code>It means that it cannot be constructed。</p>
-<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">getMaximumConsecutive</span>(<span class="params">self, coins: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        m = <span class="number">0</span>  <span class="comment"># At the beginning, it can only be constructed 0</span></span><br><span class="line">        coins.sort()</span><br><span class="line">        <span class="keyword">for</span> c <span class="keyword">in</span> coins:</span><br><span class="line">            <span class="keyword">if</span> c &gt; m + <span class="number">1</span>:  <span class="comment"># coins Sort，There is no comparison c Smaller</span></span><br><span class="line">                <span class="keyword">break</span>  <span class="comment"># Unable to construct m+1，Continue to loop is meaningless</span></span><br><span class="line">            m += c  <span class="comment"># Can be constructed [0,m+c] All integer</span></span><br><span class="line">        <span class="keyword">return</span> m + <span class="number">1</span>  <span class="comment"># [0,m] China m+1 An integer</span></span><br></pre></td></tr></table></figure>
-
-<figure class="highlight go"><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"><span class="function"><span class="keyword">func</span> <span class="title">getMaximumConsecutive</span><span class="params">(coins []<span class="type">int</span>)</span></span> <span class="type">int</span> &#123;</span><br><span class="line">	<span class="comment">// Initialize a containing0Array</span></span><br><span class="line">	m := <span class="number">0</span></span><br><span class="line">	sort.Ints(coins)</span><br><span class="line">	<span class="keyword">for</span> _, c := <span class="keyword">range</span> coins &#123;</span><br><span class="line">		<span class="keyword">if</span> c &gt; m+<span class="number">1</span> &#123;</span><br><span class="line">			<span class="keyword">break</span></span><br><span class="line">		&#125;</span><br><span class="line">		m += c</span><br><span class="line">	&#125;</span><br><span class="line">	<span class="keyword">return</span> m + <span class="number">1</span></span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
-
+                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/1675057199631.png" alt="1675057199631.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/merge-in-between-linked-lists/description/">1669. Merge two linked watches</a></p>
+<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>直接放上官方answer了，就yes模拟Linked。</p>
+<p>topic要求将 list1<br>First a arrive b Delete all nodes，Replace it for list2<br>。therefore，我们首先找arrive list1<br>B a−1 Node preA，As well as b+1 Node aftB。because 1≤a≤b&lt;n−1<br>（in n yes list1 length），so preA and aftB yes一定存在of。</p>
+<p>Then we let us give up preA of next direction list2<br>of头节点，Give up list2<br>of尾节点of next direction aftB To。</p>
+<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">ListNode</span>(<span class="title class_ inherited__">object</span>):</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">__init__</span>(<span class="params">self, x</span>):</span><br><span class="line">        self.val = x</span><br><span class="line">        self.<span class="built_in">next</span> = <span class="literal">None</span></span><br><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">mergeInBetween</span>(<span class="params">self, list1: ListNode, a: <span class="built_in">int</span>, b: <span class="built_in">int</span>, list2: ListNode</span>) -&gt; ListNode:</span><br><span class="line">        preA = list1</span><br><span class="line">        <span class="keyword">for</span> _ <span class="keyword">in</span> <span class="built_in">range</span>(a-<span class="number">1</span>):</span><br><span class="line">            preA = preA.<span class="built_in">next</span></span><br><span class="line">        preB = preA</span><br><span class="line">        <span class="keyword">for</span> _ <span class="keyword">in</span> <span class="built_in">range</span>(b - a + <span class="number">2</span>):</span><br><span class="line">            preB = preB.<span class="built_in">next</span></span><br><span class="line">        preA.<span class="built_in">next</span> = list2</span><br><span class="line">        <span class="keyword">while</span> list2.<span class="built_in">next</span>:</span><br><span class="line">            list2 = list2.<span class="built_in">next</span></span><br><span class="line">        list2.<span class="built_in">next</span> = preB</span><br><span class="line">        <span class="keyword">return</span> list1</span><br></pre></td></tr></table></figure>
                 
             
 
@@ -714,7 +726,11 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">One question daily</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Linked</a>
         		</li>
       		
 		</ul>
@@ -725,7 +741,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/3667cd44.html">show all >></a>
+                    <a class="article-more-a" href="/post/d482ac75.html">show all >></a>
                 </p>
             
 
@@ -763,20 +779,20 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 
 <!-- 文章页添加mathjax公式 -->
   
-    <article id="post-1802_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-1798你能构造出连续值的最大数目_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/2f3e8e26.html">1801-1803 Liech buckle novice！</a>
+      <a class="article-title_code_ant" href="/post/3667cd44.html">1798You can construct the maximum number of continuity One question daily</a>
     </h2>
   
 
 
                 
-                    <a href="/post/2f3e8e26.html" class="archive-article-date">
+                    <a href="/post/3667cd44.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -808,7 +824,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">427字</span>
+        <span class="post-count">187字</span>
       </span>
     </span>
 
@@ -817,7 +833,7 @@ <h2 itemprop="name">
       <span class="post-meta-item-icon">
 	    <i class="fa fa-pagelines" aria-hidden="true"></i>
         <span class="post-meta-item-text">阅读时长: </span>
-        <span class="post-count">2min</span>
+        <span class="post-count">1min</span>
       </span>
     </span>
 	
@@ -832,13 +848,15 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <p>Just write a question every day，然后写下能让自己看懂的answer吧!<br>The new year has passed5All over，Write this at one time5God。</p>
-<p>first of all1801.1802.1803，The daily questions of these three days are actually a high -quality weekly match last year，Even the simple label is also ordinary difficulty。</p>
-<p>If the method is solved, it is a stack of a triangle，Stop increased after reaching the boundary（If it continues to increase, it will lead to timeout） 。</p>
-<p>When both sides are reached，Just lay all the remaining bricks directly on the top layer。</p>
-<figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="number">1802.</span> Specify the maximum value of the lower bid <span class="keyword">in</span> the bounded array</span><br><span class="line">      medium</span><br><span class="line">      <span class="number">182</span></span><br><span class="line">      company</span><br><span class="line">      Amazon</span><br><span class="line">      company</span><br><span class="line">      Facebook</span><br><span class="line">      Give you three positive integers n、index <span class="keyword">and</span> maxSum 。You need to construct an array that meets <span class="built_in">all</span> the conditions at the same time nums（Bidding <span class="keyword">from</span> <span class="number">0</span> start count）：</span><br><span class="line"></span><br><span class="line">nums.length == n</span><br><span class="line">nums[i] yes Positive integer ，<span class="keyword">in</span> <span class="number">0</span> &lt;= i &lt; n</span><br><span class="line"><span class="built_in">abs</span>(nums[i] - nums[i+<span class="number">1</span>]) &lt;= <span class="number">1</span> ，<span class="keyword">in</span> <span class="number">0</span> &lt;= i &lt; n-<span class="number">1</span></span><br><span class="line">nums 中所有元素之<span class="keyword">and</span>不超过 maxSum</span><br><span class="line">nums[index] Value maximize</span><br><span class="line">Return to the array you constructed nums[index] 。</span><br><span class="line"></span><br><span class="line">Notice：<span class="built_in">abs</span>(x) equal x 的前提yes x &gt;= <span class="number">0</span> ；otherwise，<span class="built_in">abs</span>(x) equal -x 。</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"></span><br><span class="line">Exemplary example <span class="number">1</span>：</span><br><span class="line"></span><br><span class="line">enter：n = <span class="number">4</span>, index = <span class="number">2</span>,  maxSum = <span class="number">6</span></span><br><span class="line">Output：<span class="number">2</span></span><br><span class="line">explain：Array [<span class="number">1</span>,<span class="number">1</span>,<span class="number">2</span>,<span class="number">1</span>] <span class="keyword">and</span> [<span class="number">1</span>,<span class="number">2</span>,<span class="number">2</span>,<span class="number">1</span>] Meet <span class="built_in">all</span> conditions。不存在其他在指定BiddingPlace具有更大值的有效Array。</span><br><span class="line">Exemplary example <span class="number">2</span>：</span><br><span class="line"></span><br><span class="line">enter：n = <span class="number">6</span>, index = <span class="number">1</span>,  maxSum = <span class="number">10</span></span><br><span class="line">Output：<span class="number">3</span></span><br><span class="line"></span><br><span class="line"></span><br><span class="line">hint：</span><br><span class="line"></span><br><span class="line"><span class="number">1</span> &lt;= n &lt;= maxSum &lt;= <span class="number">109</span></span><br><span class="line"><span class="number">0</span> &lt;= index &lt; n</span><br></pre></td></tr></table></figure>
+                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-05.png" alt="2023-02-05.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/maximum-number-of-consecutive-values-you-can-make/description/?orderBy=most_votes">1798. You can construct the maximum number of continuity</a></p>
+<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p><img src="../assets/img/4A052176419779588F1300C93180C44A.png" alt="4A052176419779588F1300C93180C44A.png"><br><img src="../assets/img/img.png" alt="img.png"><br><code>nums = [1,4,10,3,1]</code>1 ~ 10 All can be constructed，so11 ~ 20As well。<br>Traversal <code>nums = [1,1,3,4,10]</code>， if i&lt;= <em>Earlier+1</em></p>
+<blockquote>
+<p>$i_0(1) &lt;= 0+1; i_1(1) &lt;= 1+1; i_2(3) &lt;= 2+1; i_3(4) &lt;= 5+1; i_4(10) &lt;= 9+1$</p>
+</blockquote>
+<p>, ExplainiThe previous numbers can be constructed。<code>if i &gt; m + 1</code>It means that it cannot be constructed。</p>
+<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">getMaximumConsecutive</span>(<span class="params">self, coins: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        m = <span class="number">0</span>  <span class="comment"># At the beginning, it can only be constructed 0</span></span><br><span class="line">        coins.sort()</span><br><span class="line">        <span class="keyword">for</span> c <span class="keyword">in</span> coins:</span><br><span class="line">            <span class="keyword">if</span> c &gt; m + <span class="number">1</span>:  <span class="comment"># coins Sort，There is no comparison c Smaller</span></span><br><span class="line">                <span class="keyword">break</span>  <span class="comment"># Unable to construct m+1，Continue to loop is meaningless</span></span><br><span class="line">            m += c  <span class="comment"># Can be constructed [0,m+c] All integer</span></span><br><span class="line">        <span class="keyword">return</span> m + <span class="number">1</span>  <span class="comment"># [0,m] China m+1 An integer</span></span><br></pre></td></tr></table></figure>
 
-<figure class="highlight plaintext"><figcaption><span>[]</span></figcaption><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></pre></td><td class="code"><pre><span class="line">class Solution:</span><br><span class="line">    def maxValue(self, n: int, index: int, maxSum: int) -&gt; int:</span><br><span class="line">        diff = maxSum - n</span><br><span class="line">        left = index</span><br><span class="line">        right = index</span><br><span class="line">        res = 1</span><br><span class="line">        dl = 0</span><br><span class="line">        dr = 0</span><br><span class="line">        while diff &gt; 0:  # When there are remaining bricks</span><br><span class="line">            left -= 1</span><br><span class="line">            right += 1</span><br><span class="line">            if left &gt;= 0:</span><br><span class="line">                dl = dl + 1  # Before reaching the left boundary</span><br><span class="line">            if right &lt; n:</span><br><span class="line">                dr = dr + 1  # Have not arrived at the right boundary</span><br><span class="line">            if left &lt; 0 and right &gt;= n:  # 当到达左边界and右边界时 Exit</span><br><span class="line">                # res+=diff%n==0?diff/n:diff/n+1 #Divide the remaining bricks，Exit directly</span><br><span class="line">                res += diff // n if diff % n == 0 else diff // n + 1</span><br><span class="line">                return res</span><br><span class="line">            res += 1  # Layer renewal</span><br><span class="line">            diff -= (dl + dr + 1)  # The number of bricks needed to strictly pile the top layer into strict triangle(On the left+Need to be on the right+indexPlace1indivual)</span><br><span class="line"></span><br><span class="line">        return res</span><br><span class="line"></span><br></pre></td></tr></table></figure>
+<figure class="highlight go"><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"><span class="function"><span class="keyword">func</span> <span class="title">getMaximumConsecutive</span><span class="params">(coins []<span class="type">int</span>)</span></span> <span class="type">int</span> &#123;</span><br><span class="line">	<span class="comment">// Initialize a containing0Array</span></span><br><span class="line">	m := <span class="number">0</span></span><br><span class="line">	sort.Ints(coins)</span><br><span class="line">	<span class="keyword">for</span> _, c := <span class="keyword">range</span> coins &#123;</span><br><span class="line">		<span class="keyword">if</span> c &gt; m+<span class="number">1</span> &#123;</span><br><span class="line">			<span class="keyword">break</span></span><br><span class="line">		&#125;</span><br><span class="line">		m += c</span><br><span class="line">	&#125;</span><br><span class="line">	<span class="keyword">return</span> m + <span class="number">1</span></span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
 
                 
             
@@ -866,7 +884,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -877,7 +899,7 @@ <h2 itemprop="name">
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/2f3e8e26.html">show all >></a>
+                    <a class="article-more-a" href="/post/3667cd44.html">show all >></a>
                 </p>
             
 
@@ -915,20 +937,20 @@ <h2 itemprop="name">
 
 <!-- 文章页添加mathjax公式 -->
   
-    <article id="post-1664生成平衡数组的方案数_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-1802_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/1978f474.html">1664. Number of schemes to generate balance numbers One question daily</a>
+      <a class="article-title_code_ant" href="/post/2f3e8e26.html">1801-1803 Liech buckle novice！</a>
     </h2>
   
 
 
                 
-                    <a href="/post/1978f474.html" class="archive-article-date">
+                    <a href="/post/2f3e8e26.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -960,7 +982,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">235字</span>
+        <span class="post-count">427字</span>
       </span>
     </span>
 
@@ -969,7 +991,7 @@ <h2 itemprop="name">
       <span class="post-meta-item-icon">
 	    <i class="fa fa-pagelines" aria-hidden="true"></i>
         <span class="post-meta-item-text">阅读时长: </span>
-        <span class="post-count">1min</span>
+        <span class="post-count">2min</span>
       </span>
     </span>
 	
@@ -984,27 +1006,13 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <p><img src="../assets/img/1674887518406.png" alt="1674887518406.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/ways-to-make-a-fair-array/description/?orderBy=most_relevant">1664. Number of schemes to generate balance numbers</a></p>
-<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>See when you read the question medium I know that it is definitely not really going to delete an element。Otherwise it will time out，So I tried to try polepythonFeature code：Use slice to process all data；<br>But it’s timeout。。</p>
-<p>然后看官方answer，用的Dynamic planning。中心Thought是：</p>
-<blockquote>
-<p>General nature，Now we will settle down i Delete elements，<br>Obviously the bidding i The previous element bidding will not change from this，Bidding i<br>The original was originally j，j&gt;iThe array elements of the bid will move to the bidding j−1，<br>Immediately bidding i The subsequent bidding elements will become the rated element，<br>The even bidding element will become a strange number of bidding elements。</p>
-</blockquote>
-<h1 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h1><figure class="highlight python"><figcaption><span>slice</span></figcaption><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">waysToMakeFair</span>(<span class="params">self, nums: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        flag = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(nums)):</span><br><span class="line">            temp_nums = nums[:i] + nums[i+<span class="number">1</span>:]</span><br><span class="line">            <span class="keyword">if</span> <span class="built_in">sum</span>(temp_nums[::<span class="number">2</span>])==<span class="built_in">sum</span>(temp_nums[<span class="number">1</span>::<span class="number">2</span>]):</span><br><span class="line">                flag += <span class="number">1</span></span><br><span class="line">        <span class="keyword">return</span> flag</span><br></pre></td></tr></table></figure>
-
-
-
-<figure class="highlight python"><figcaption><span>官方answer</span></figcaption><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">waysToMakeFair</span>(<span class="params">self, nums: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        res = odd1 = even1 = odd2 = even2 = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> i, num <span class="keyword">in</span> <span class="built_in">enumerate</span>(nums):</span><br><span class="line">            <span class="keyword">if</span> i &amp; <span class="number">1</span>:</span><br><span class="line">                odd2 += num</span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                even2 += num</span><br><span class="line">        <span class="keyword">for</span> i, num <span class="keyword">in</span> <span class="built_in">enumerate</span>(nums):</span><br><span class="line">            <span class="keyword">if</span> i &amp; <span class="number">1</span>:</span><br><span class="line">                odd2 -= num</span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                even2 -= num</span><br><span class="line">            <span class="keyword">if</span> odd1 + even2 == odd2 + even1:</span><br><span class="line">                res += <span class="number">1</span></span><br><span class="line">            <span class="keyword">if</span> i &amp; <span class="number">1</span>:</span><br><span class="line">                odd1 += num</span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                even1 += num</span><br><span class="line">        <span class="keyword">return</span> res</span><br></pre></td></tr></table></figure>
-
-
-
-
-
-
-
-
-
+                    <p>Just write a question every day，然后写下能让自己看懂的answer吧!<br>The new year has passed5All over，Write this at one time5God。</p>
+<p>first of all1801.1802.1803，The daily questions of these three days are actually a high -quality weekly match last year，Even the simple label is also ordinary difficulty。</p>
+<p>If the method is solved, it is a stack of a triangle，Stop increased after reaching the boundary（If it continues to increase, it will lead to timeout） 。</p>
+<p>When both sides are reached，Just lay all the remaining bricks directly on the top layer。</p>
+<figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="number">1802.</span> Specify the maximum value of the lower bid <span class="keyword">in</span> the bounded array</span><br><span class="line">      medium</span><br><span class="line">      <span class="number">182</span></span><br><span class="line">      company</span><br><span class="line">      Amazon</span><br><span class="line">      company</span><br><span class="line">      Facebook</span><br><span class="line">      Give you three positive integers n、index <span class="keyword">and</span> maxSum 。You need to construct an array that meets <span class="built_in">all</span> the conditions at the same time nums（Bidding <span class="keyword">from</span> <span class="number">0</span> start count）：</span><br><span class="line"></span><br><span class="line">nums.length == n</span><br><span class="line">nums[i] yes Positive integer ，<span class="keyword">in</span> <span class="number">0</span> &lt;= i &lt; n</span><br><span class="line"><span class="built_in">abs</span>(nums[i] - nums[i+<span class="number">1</span>]) &lt;= <span class="number">1</span> ，<span class="keyword">in</span> <span class="number">0</span> &lt;= i &lt; n-<span class="number">1</span></span><br><span class="line">nums 中所有元素之<span class="keyword">and</span>不超过 maxSum</span><br><span class="line">nums[index] Value maximize</span><br><span class="line">Return to the array you constructed nums[index] 。</span><br><span class="line"></span><br><span class="line">Notice：<span class="built_in">abs</span>(x) equal x 的前提yes x &gt;= <span class="number">0</span> ；otherwise，<span class="built_in">abs</span>(x) equal -x 。</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"></span><br><span class="line">Exemplary example <span class="number">1</span>：</span><br><span class="line"></span><br><span class="line">enter：n = <span class="number">4</span>, index = <span class="number">2</span>,  maxSum = <span class="number">6</span></span><br><span class="line">Output：<span class="number">2</span></span><br><span class="line">explain：Array [<span class="number">1</span>,<span class="number">1</span>,<span class="number">2</span>,<span class="number">1</span>] <span class="keyword">and</span> [<span class="number">1</span>,<span class="number">2</span>,<span class="number">2</span>,<span class="number">1</span>] Meet <span class="built_in">all</span> conditions。不存在其他在指定BiddingPlace具有更大值的有效Array。</span><br><span class="line">Exemplary example <span class="number">2</span>：</span><br><span class="line"></span><br><span class="line">enter：n = <span class="number">6</span>, index = <span class="number">1</span>,  maxSum = <span class="number">10</span></span><br><span class="line">Output：<span class="number">3</span></span><br><span class="line"></span><br><span class="line"></span><br><span class="line">hint：</span><br><span class="line"></span><br><span class="line"><span class="number">1</span> &lt;= n &lt;= maxSum &lt;= <span class="number">109</span></span><br><span class="line"><span class="number">0</span> &lt;= index &lt; n</span><br></pre></td></tr></table></figure>
 
+<figure class="highlight plaintext"><figcaption><span>[]</span></figcaption><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></pre></td><td class="code"><pre><span class="line">class Solution:</span><br><span class="line">    def maxValue(self, n: int, index: int, maxSum: int) -&gt; int:</span><br><span class="line">        diff = maxSum - n</span><br><span class="line">        left = index</span><br><span class="line">        right = index</span><br><span class="line">        res = 1</span><br><span class="line">        dl = 0</span><br><span class="line">        dr = 0</span><br><span class="line">        while diff &gt; 0:  # When there are remaining bricks</span><br><span class="line">            left -= 1</span><br><span class="line">            right += 1</span><br><span class="line">            if left &gt;= 0:</span><br><span class="line">                dl = dl + 1  # Before reaching the left boundary</span><br><span class="line">            if right &lt; n:</span><br><span class="line">                dr = dr + 1  # Have not arrived at the right boundary</span><br><span class="line">            if left &lt; 0 and right &gt;= n:  # 当到达左边界and右边界时 Exit</span><br><span class="line">                # res+=diff%n==0?diff/n:diff/n+1 #Divide the remaining bricks，Exit directly</span><br><span class="line">                res += diff // n if diff % n == 0 else diff // n + 1</span><br><span class="line">                return res</span><br><span class="line">            res += 1  # Layer renewal</span><br><span class="line">            diff -= (dl + dr + 1)  # The number of bricks needed to strictly pile the top layer into strict triangle(On the left+Need to be on the right+indexPlace1indivual)</span><br><span class="line"></span><br><span class="line">        return res</span><br><span class="line"></span><br></pre></td></tr></table></figure>
 
                 
             
@@ -1032,15 +1040,7 @@ <h1 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h1><figu
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">One question daily</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -1051,7 +1051,7 @@ <h1 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h1><figu
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/1978f474.html">show all >></a>
+                    <a class="article-more-a" href="/post/2f3e8e26.html">show all >></a>
                 </p>
             
 
@@ -1944,7 +1944,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/page/4/index.html b/page/4/index.html
index 400151394..70d933952 100644
--- a/page/4/index.html
+++ b/page/4/index.html
@@ -292,20 +292,20 @@
         <div id="js-content" class="content-ll">
           
   
-    <article id="post-1828统计一个圆中点的数目_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-1825求出 MK 平均值_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/3277549c.html">1828. Statistics the number of a circle mid -point One question daily</a>
+      <a class="article-title_code_ant" href="/post/6be57ef7.html">1825. Seek out MK average value</a>
     </h2>
   
 
 
                 
-                    <a href="/post/3277549c.html" class="archive-article-date">
+                    <a href="/post/6be57ef7.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -337,7 +337,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">283字</span>
+        <span class="post-count">216字</span>
       </span>
     </span>
 
@@ -361,16 +361,15 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-01-25.png" alt="2023-01-25.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/queries-on-number-of-points-inside-a-circle/description/">1828. Statistics the number of a circle mid -point</a></p>
-<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>Today’s question is very simple，I wonder if it is against yesterday’s question bidding。<br>Ask<code>queries</code>There are a few in the circle<code>points</code>Points in an array。<br>To be honest, I was scared，I think this question is the question of the picture again。不过仔细读题了后发现只是一道简单的math题，<br>We can use European -style distance to solve（Time complexity isOn^2，I thought I had a better solution，At first glance everyone is like this（））</p>
-<p>The formula of the European -style distance is as follows：</p>
-<p>$\sqrt{(x_1 - x_2)^2 + (y_1 - y_2)^2}$</p>
-<p>We look at the code for specific operations：</p>
-<h1 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h1><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">countPoints</span>(<span class="params">self, points: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]], queries: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]]</span>) -&gt; <span class="type">List</span>[<span class="built_in">int</span>]:</span><br><span class="line">        <span class="comment"># Seek to solve whether the European -style distance from the center is less than r</span></span><br><span class="line">        ans = [<span class="number">0</span>] * <span class="built_in">len</span>(queries)</span><br><span class="line">        flag = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> x, y, r <span class="keyword">in</span> queries:</span><br><span class="line">            <span class="keyword">for</span> i, j <span class="keyword">in</span> points:</span><br><span class="line">                <span class="keyword">if</span> ((x - i) ** <span class="number">2</span> + (y - j) ** <span class="number">2</span>) ** (<span class="number">1</span> / <span class="number">2</span>) &lt;= r:</span><br><span class="line">                    ans[flag] += <span class="number">1</span></span><br><span class="line">            flag += <span class="number">1</span></span><br><span class="line">        <span class="keyword">return</span> ans</span><br></pre></td></tr></table></figure>
-
-<p>Take a look at someone who can’t understandpythonCode：</p>
-<figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">countPoints</span>(<span class="params">self, points: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]], queries: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]]</span>) -&gt; <span class="type">List</span>[<span class="built_in">int</span>]:</span><br><span class="line">        points = <span class="built_in">sorted</span>(points)</span><br><span class="line"></span><br><span class="line">        res = [<span class="number">0</span> <span class="keyword">for</span> _ <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(queries))]</span><br><span class="line"></span><br><span class="line">        <span class="keyword">for</span> i, (u, v, r) <span class="keyword">in</span> <span class="built_in">enumerate</span>(queries):</span><br><span class="line">            left, right = u - r, u + r</span><br><span class="line"></span><br><span class="line">            idx1 = bisect_left(points, [left, -inf])</span><br><span class="line">            idx2 = bisect_right(points, [right, inf])</span><br><span class="line"></span><br><span class="line">            <span class="keyword">for</span> x, y <span class="keyword">in</span> points[idx1: idx2 + <span class="number">1</span>]:</span><br><span class="line">                <span class="keyword">if</span> (v - r &lt;= y &lt;= v + r <span class="keyword">and</span> </span><br><span class="line">                    (x - u) * (x - u) + (y - v) * (y - v) &lt;= r * r):</span><br><span class="line">  </span><br><span class="line">                    res[i] += <span class="number">1</span></span><br><span class="line"></span><br><span class="line">        <span class="keyword">return</span> res</span><br></pre></td></tr></table></figure>
-
+                    <p><img src="../assets/img/cadf1776c7767e9ac0bf17750f18368.png" alt="cadf1776c7767e9ac0bf17750f18368.png"></p>
+<h1 id="Problem-solving"><a href="#Problem-solving" class="headerlink" title="Problem -solving"></a>Problem -solving</h1><p>maintain 3 indivual multiset：lower（Minimum kkk indivual数）、middle（Number in the middle）、upper（Most kkk indivual数）。</p>
+<h1 id="Insert-operation"><a href="#Insert-operation" class="headerlink" title="Insert operation"></a>Insert operation</h1><p>·if num≤max(lower)，Then lowerInsert num<br>·if num≥min(upper)，Then upper Insert num<br>·otherwise，exist middle Insert num<br>if插入后，lower or upper There are more elements than k indivual，Then middle middle Transfer element</p>
+<p>操作过程middlemaintain middle 的element和 sum</p>
+<h1 id="Delete-operation"><a href="#Delete-operation" class="headerlink" title="Delete operation"></a>Delete operation</h1><p>·设删除的element为 d<br>·d 一定存exist于 lower ormiddle or upper middle的一indivualor多indivual集合middle<br>·Choose one delete<br>if删除后，lower or upper middle的element少于 k indivual，Then from middle middle Obtain element</p>
+<p>操作过程middlemaintain middle 的element和 sum</p>
+<h1 id="average-value操作"><a href="#average-value操作" class="headerlink" title="average value操作"></a>average value操作</h1><p>average value = sum/(m−2⋅k)sum / (m - 2\cdot k)sum/(m−2⋅k) （Take down）。</p>
+<p>Code with problems：</p>
+<figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">MKAverage</span>:</span><br><span class="line"></span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">__init__</span>(<span class="params">self, m: <span class="built_in">int</span>, k: <span class="built_in">int</span></span>):</span><br><span class="line">        self.m = m</span><br><span class="line">        self.k = k</span><br><span class="line">        self.list1 = []</span><br><span class="line"></span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">addElement</span>(<span class="params">self, num: <span class="built_in">int</span></span>) -&gt; <span class="literal">None</span>:</span><br><span class="line">        self.list1.append(num)</span><br><span class="line"></span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">calculateMKAverage</span>(<span class="params">self</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        <span class="keyword">if</span> <span class="built_in">len</span>(self.list1) &lt; self.m:</span><br><span class="line">            <span class="keyword">return</span> -<span class="number">1</span></span><br><span class="line">        <span class="keyword">else</span>:</span><br><span class="line">            list2 = self.list1[-<span class="number">1</span>:-self.m-<span class="number">1</span>:-<span class="number">1</span>]</span><br><span class="line">            list2 = <span class="built_in">sorted</span>(list2)</span><br><span class="line">            list2 = list2[self.k:<span class="built_in">len</span>(list2) - self.k]</span><br><span class="line">        <span class="keyword">return</span> <span class="built_in">sum</span>(list2) // <span class="built_in">len</span>(list2)</span><br></pre></td></tr></table></figure>
                 
             
 
@@ -397,11 +396,15 @@ <h1 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h1><figu
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">unsolved</a>
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">difficulty</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color3">Multiple set</a>
         		</li>
       		
 		</ul>
@@ -412,7 +415,7 @@ <h1 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h1><figu
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/3277549c.html">show all >></a>
+                    <a class="article-more-a" href="/post/6be57ef7.html">show all >></a>
                 </p>
             
 
@@ -450,20 +453,20 @@ <h1 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h1><figu
 
 <!-- 文章页添加mathjax公式 -->
   
-    <article id="post-1825求出 MK 平均值_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-1828统计一个圆中点的数目_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/6be57ef7.html">1825. Seek out MK average value</a>
+      <a class="article-title_code_ant" href="/post/3277549c.html">1828. Statistics the number of a circle mid -point One question daily</a>
     </h2>
   
 
 
                 
-                    <a href="/post/6be57ef7.html" class="archive-article-date">
+                    <a href="/post/3277549c.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -495,7 +498,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">216字</span>
+        <span class="post-count">283字</span>
       </span>
     </span>
 
@@ -519,15 +522,16 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <p><img src="../assets/img/cadf1776c7767e9ac0bf17750f18368.png" alt="cadf1776c7767e9ac0bf17750f18368.png"></p>
-<h1 id="Problem-solving"><a href="#Problem-solving" class="headerlink" title="Problem -solving"></a>Problem -solving</h1><p>maintain 3 indivual multiset：lower（Minimum kkk indivual数）、middle（Number in the middle）、upper（Most kkk indivual数）。</p>
-<h1 id="Insert-operation"><a href="#Insert-operation" class="headerlink" title="Insert operation"></a>Insert operation</h1><p>·if num≤max(lower)，Then lowerInsert num<br>·if num≥min(upper)，Then upper Insert num<br>·otherwise，exist middle Insert num<br>if插入后，lower or upper There are more elements than k indivual，Then middle middle Transfer element</p>
-<p>操作过程middlemaintain middle 的element和 sum</p>
-<h1 id="Delete-operation"><a href="#Delete-operation" class="headerlink" title="Delete operation"></a>Delete operation</h1><p>·设删除的element为 d<br>·d 一定存exist于 lower ormiddle or upper middle的一indivualor多indivual集合middle<br>·Choose one delete<br>if删除后，lower or upper middle的element少于 k indivual，Then from middle middle Obtain element</p>
-<p>操作过程middlemaintain middle 的element和 sum</p>
-<h1 id="average-value操作"><a href="#average-value操作" class="headerlink" title="average value操作"></a>average value操作</h1><p>average value = sum/(m−2⋅k)sum / (m - 2\cdot k)sum/(m−2⋅k) （Take down）。</p>
-<p>Code with problems：</p>
-<figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">MKAverage</span>:</span><br><span class="line"></span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">__init__</span>(<span class="params">self, m: <span class="built_in">int</span>, k: <span class="built_in">int</span></span>):</span><br><span class="line">        self.m = m</span><br><span class="line">        self.k = k</span><br><span class="line">        self.list1 = []</span><br><span class="line"></span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">addElement</span>(<span class="params">self, num: <span class="built_in">int</span></span>) -&gt; <span class="literal">None</span>:</span><br><span class="line">        self.list1.append(num)</span><br><span class="line"></span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">calculateMKAverage</span>(<span class="params">self</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        <span class="keyword">if</span> <span class="built_in">len</span>(self.list1) &lt; self.m:</span><br><span class="line">            <span class="keyword">return</span> -<span class="number">1</span></span><br><span class="line">        <span class="keyword">else</span>:</span><br><span class="line">            list2 = self.list1[-<span class="number">1</span>:-self.m-<span class="number">1</span>:-<span class="number">1</span>]</span><br><span class="line">            list2 = <span class="built_in">sorted</span>(list2)</span><br><span class="line">            list2 = list2[self.k:<span class="built_in">len</span>(list2) - self.k]</span><br><span class="line">        <span class="keyword">return</span> <span class="built_in">sum</span>(list2) // <span class="built_in">len</span>(list2)</span><br></pre></td></tr></table></figure>
+                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-01-25.png" alt="2023-01-25.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/queries-on-number-of-points-inside-a-circle/description/">1828. Statistics the number of a circle mid -point</a></p>
+<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>Today’s question is very simple，I wonder if it is against yesterday’s question bidding。<br>Ask<code>queries</code>There are a few in the circle<code>points</code>Points in an array。<br>To be honest, I was scared，I think this question is the question of the picture again。不过仔细读题了后发现只是一道简单的math题，<br>We can use European -style distance to solve（Time complexity isOn^2，I thought I had a better solution，At first glance everyone is like this（））</p>
+<p>The formula of the European -style distance is as follows：</p>
+<p>$\sqrt{(x_1 - x_2)^2 + (y_1 - y_2)^2}$</p>
+<p>We look at the code for specific operations：</p>
+<h1 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h1><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">countPoints</span>(<span class="params">self, points: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]], queries: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]]</span>) -&gt; <span class="type">List</span>[<span class="built_in">int</span>]:</span><br><span class="line">        <span class="comment"># Seek to solve whether the European -style distance from the center is less than r</span></span><br><span class="line">        ans = [<span class="number">0</span>] * <span class="built_in">len</span>(queries)</span><br><span class="line">        flag = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> x, y, r <span class="keyword">in</span> queries:</span><br><span class="line">            <span class="keyword">for</span> i, j <span class="keyword">in</span> points:</span><br><span class="line">                <span class="keyword">if</span> ((x - i) ** <span class="number">2</span> + (y - j) ** <span class="number">2</span>) ** (<span class="number">1</span> / <span class="number">2</span>) &lt;= r:</span><br><span class="line">                    ans[flag] += <span class="number">1</span></span><br><span class="line">            flag += <span class="number">1</span></span><br><span class="line">        <span class="keyword">return</span> ans</span><br></pre></td></tr></table></figure>
+
+<p>Take a look at someone who can’t understandpythonCode：</p>
+<figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">countPoints</span>(<span class="params">self, points: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]], queries: <span class="type">List</span>[<span class="type">List</span>[<span class="built_in">int</span>]]</span>) -&gt; <span class="type">List</span>[<span class="built_in">int</span>]:</span><br><span class="line">        points = <span class="built_in">sorted</span>(points)</span><br><span class="line"></span><br><span class="line">        res = [<span class="number">0</span> <span class="keyword">for</span> _ <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(queries))]</span><br><span class="line"></span><br><span class="line">        <span class="keyword">for</span> i, (u, v, r) <span class="keyword">in</span> <span class="built_in">enumerate</span>(queries):</span><br><span class="line">            left, right = u - r, u + r</span><br><span class="line"></span><br><span class="line">            idx1 = bisect_left(points, [left, -inf])</span><br><span class="line">            idx2 = bisect_right(points, [right, inf])</span><br><span class="line"></span><br><span class="line">            <span class="keyword">for</span> x, y <span class="keyword">in</span> points[idx1: idx2 + <span class="number">1</span>]:</span><br><span class="line">                <span class="keyword">if</span> (v - r &lt;= y &lt;= v + r <span class="keyword">and</span> </span><br><span class="line">                    (x - u) * (x - u) + (y - v) * (y - v) &lt;= r * r):</span><br><span class="line">  </span><br><span class="line">                    res[i] += <span class="number">1</span></span><br><span class="line"></span><br><span class="line">        <span class="keyword">return</span> res</span><br></pre></td></tr></table></figure>
+
                 
             
 
@@ -554,15 +558,11 @@ <h1 id="average-value操作"><a href="#average-value操作" class="headerlink" t
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">unsolved</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">difficulty</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color3">Multiple set</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
         		</li>
       		
 		</ul>
@@ -573,7 +573,7 @@ <h1 id="average-value操作"><a href="#average-value操作" class="headerlink" t
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/6be57ef7.html">show all >></a>
+                    <a class="article-more-a" href="/post/3277549c.html">show all >></a>
                 </p>
             
 
@@ -1478,20 +1478,20 @@ <h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought：">
 
 <!-- 文章页添加mathjax公式 -->
   
-    <article id="post-221最大正方形_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-219_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/e03edda.html">221Maximum square</a>
+      <a class="article-title_code_ant" href="/post/16b0e9f1.html">219.Existing duplicate elements II Hash table graphics</a>
     </h2>
   
 
 
                 
-                    <a href="/post/e03edda.html" class="archive-article-date">
+                    <a href="/post/16b0e9f1.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -1523,7 +1523,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">388字</span>
+        <span class="post-count">254字</span>
       </span>
     </span>
 
@@ -1532,7 +1532,7 @@ <h2 itemprop="name">
       <span class="post-meta-item-icon">
 	    <i class="fa fa-pagelines" aria-hidden="true"></i>
         <span class="post-meta-item-text">阅读时长: </span>
-        <span class="post-count">2min</span>
+        <span class="post-count">1min</span>
       </span>
     </span>
 	
@@ -1547,14 +1547,11 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-01.png" alt="2023-02-01.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/maximal-square/description/?orderBy=most_votes">221. Maximum square</a></p>
-<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>可以使用Dynamic planning降低时间复杂度。we use dp(i,j) Express (i,j) The lower right corner，Only contain 1 The maximum value of the side length of the square。If we can calculate all dp(i,j) Value，Then the maximum value is that it is only included in the matrix 1 The maximum value of the side length of the square，其平方即为Maximum square的面积。</p>
-<p>So how to calculate dp Each element value？For each position (i,j)，检查在矩阵中该位置Value：</p>
-<p>if该位置Value是 0，but dp(i,j)=0，Because the current location cannot 1 Folk formation of composition；</p>
-<p>if该位置Value是 1，but dp(i,j) Value由其上方、Three adjacent locations on the left and upper left dp Value decision。in particular，The element value of the current position is equal to the minimum value of the three adjacent elements 1，The state transfer equation is as follows：</p>
-<p><code>dp(i,j)=min(dp(i−1,j),dp(i−1,j−1),dp(i,j−1))+1</code><br>also，You also need to consider boundary conditions。if i and j At least one of them is 0，but以位置(i,j) The lower right corner的Maximum square的边长只能是 1，therefore dp(i,j)=1<br><img src="https://assets.leetcode-cn.com/solution-static/221/221_fig1.png" alt="fig1"></p>
-<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight go"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">package</span> main</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">func</span> <span class="title">maximalSquare</span><span class="params">(matrix [][]<span class="type">byte</span>)</span></span> <span class="type">int</span> &#123;</span><br><span class="line">	dp := <span class="built_in">make</span>([][]<span class="type">int</span>, <span class="built_in">len</span>(matrix))</span><br><span class="line">	maxSide := <span class="number">0</span></span><br><span class="line">	<span class="keyword">for</span> i := <span class="number">0</span>; i &lt; <span class="built_in">len</span>(matrix); i++ &#123;</span><br><span class="line">		dp[i] = <span class="built_in">make</span>([]<span class="type">int</span>, <span class="built_in">len</span>(matrix[i]))</span><br><span class="line">		<span class="keyword">for</span> j := <span class="number">0</span>; j &lt; <span class="built_in">len</span>(matrix[i]); j++ &#123;</span><br><span class="line">			dp[i][j] = <span class="type">int</span>(matrix[i][j] - <span class="string">&#x27;0&#x27;</span>)</span><br><span class="line">			<span class="keyword">if</span> dp[i][j] == <span class="number">1</span> &#123;</span><br><span class="line">				maxSide = <span class="number">1</span></span><br><span class="line">			&#125;</span><br><span class="line">		&#125;</span><br><span class="line">	&#125;</span><br><span class="line">	<span class="keyword">for</span> i := <span class="number">1</span>; i &lt; <span class="built_in">len</span>(matrix); i++ &#123;</span><br><span class="line">		<span class="keyword">for</span> j := <span class="number">1</span>; j &lt; <span class="built_in">len</span>(matrix[i]); j++ &#123;</span><br><span class="line">			<span class="keyword">if</span> dp[i][j] == <span class="number">1</span> &#123;</span><br><span class="line">				dp[i][j] = min(min(dp[i<span class="number">-1</span>][j], dp[i][j<span class="number">-1</span>]), dp[i<span class="number">-1</span>][j<span class="number">-1</span>]) + <span class="number">1</span></span><br><span class="line">				<span class="keyword">if</span> dp[i][j] &gt; maxSide &#123;</span><br><span class="line">					maxSide = dp[i][j]</span><br><span class="line">				&#125;</span><br><span class="line">			&#125;</span><br><span class="line">		&#125;</span><br><span class="line">	&#125;</span><br><span class="line">	<span class="keyword">return</span> maxSide * maxSide</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">func</span> <span class="title">min</span><span class="params">(x, y <span class="type">int</span>)</span></span> <span class="type">int</span> &#123;</span><br><span class="line">	<span class="keyword">if</span> x &lt; y &#123;</span><br><span class="line">		<span class="keyword">return</span> x</span><br><span class="line">	&#125;</span><br><span class="line">	<span class="keyword">return</span> y</span><br><span class="line">&#125;</span><br><span class="line"></span><br></pre></td></tr></table></figure>
+                    <h1 id="Thought"><a href="#Thought" class="headerlink" title="Thought"></a>Thought</h1><p>This question was done on the phone at first，直接用的是双Hash table，An element，One depositindex，When a certain element exceeds2Judging whether there are two of them when they areindexSubtission is equal tokCase。So the complexity of time is<code>O(n^3)</code>。</p>
+<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">containsNearbyDuplicate</span>(<span class="params">self, nums: <span class="type">List</span>[<span class="built_in">int</span>], k: <span class="built_in">int</span></span>) -&gt; <span class="built_in">bool</span>:</span><br><span class="line">        hash_1=&#123;&#125;</span><br><span class="line">        hash_2=&#123;&#125;</span><br><span class="line">        <span class="keyword">for</span> index, i <span class="keyword">in</span> <span class="built_in">enumerate</span>(nums):</span><br><span class="line">            <span class="keyword">if</span> i <span class="keyword">not</span> <span class="keyword">in</span> hash_1:</span><br><span class="line">                hash_1[i] = <span class="number">1</span></span><br><span class="line">                hash_2[i] = [index]</span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                hash_1[i] += <span class="number">1</span></span><br><span class="line">                hash_2[i].append(index)</span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> hash_1:</span><br><span class="line">            <span class="keyword">if</span> hash_1[i] &gt;= <span class="number">2</span>:</span><br><span class="line">                <span class="keyword">for</span> j <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(hash_2[i])):</span><br><span class="line">                    <span class="keyword">for</span> m <span class="keyword">in</span> <span class="built_in">range</span>(j + <span class="number">1</span>, <span class="built_in">len</span>(hash_2[i])):</span><br><span class="line">                        <span class="keyword">if</span> <span class="built_in">abs</span>(hash_2[i][j]-hash_2[i][m]) &lt;= k:</span><br><span class="line">                            <span class="keyword">return</span> <span class="literal">True</span></span><br><span class="line">        <span class="keyword">return</span> <span class="literal">False</span></span><br></pre></td></tr></table></figure>
 
+<p>look<a href="/u/ac_oier">@Gongshui Sanye</a>Gongshui Sanye的解法后，Only think of，这道题的目的是为了练习双指针在Hash table中的应用，TAThe original words are sorting the meaning：Whether the existence does not exceed k+1k + 1k+1 window，window内有相同元素。</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">#Sort out the meaning：Whether the existence does not exceed k+1k + 1k+1 window，window内有相同元素。</span><br><span class="line">class Solution:</span><br><span class="line">    def containsNearbyDuplicate(self, nums: List[int], k: int) -&gt; bool:</span><br><span class="line">        n = len(nums)</span><br><span class="line">        s = set()</span><br><span class="line">        for i in range(n):</span><br><span class="line">            if i &gt; k:</span><br><span class="line">                s.remove(nums[i - k - 1])</span><br><span class="line">            if nums[i] in s:</span><br><span class="line">                return True</span><br><span class="line">            s.add(nums[i])</span><br><span class="line">        return False</span><br></pre></td></tr></table></figure>
                 
             
 
@@ -1581,15 +1578,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">solved</a>
         		</li>
       		
 		</ul>
@@ -1600,7 +1589,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/e03edda.html">show all >></a>
+                    <a class="article-more-a" href="/post/16b0e9f1.html">show all >></a>
                 </p>
             
 
@@ -1638,20 +1627,20 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 
 <!-- 文章页添加mathjax公式 -->
   
-    <article id="post-2283_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-221最大正方形_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/c3f7f59f.html">One question daily 2283</a>
+      <a class="article-title_code_ant" href="/post/e03edda.html">221Maximum square</a>
     </h2>
   
 
 
                 
-                    <a href="/post/c3f7f59f.html" class="archive-article-date">
+                    <a href="/post/e03edda.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -1683,7 +1672,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">106字</span>
+        <span class="post-count">388字</span>
       </span>
     </span>
 
@@ -1692,7 +1681,7 @@ <h2 itemprop="name">
       <span class="post-meta-item-icon">
 	    <i class="fa fa-pagelines" aria-hidden="true"></i>
         <span class="post-meta-item-text">阅读时长: </span>
-        <span class="post-count">1min</span>
+        <span class="post-count">2min</span>
       </span>
     </span>
 	
@@ -1707,11 +1696,13 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <p>2283.Determine whether the number of a number is equal to the value of the digital position。</p>
-<figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">digitCount</span>(<span class="params">self, num: <span class="built_in">str</span></span>) -&gt; <span class="built_in">bool</span>:</span><br><span class="line">        hash_1 = &#123;&#125;</span><br><span class="line">        <span class="keyword">for</span> index, i <span class="keyword">in</span> <span class="built_in">enumerate</span>(num):</span><br><span class="line">            <span class="keyword">if</span> <span class="built_in">int</span>(i) != <span class="number">0</span>:</span><br><span class="line">                hash_1[<span class="built_in">str</span>(index)] = <span class="built_in">int</span>(i)</span><br><span class="line">        hash_2 = Counter(num)</span><br><span class="line">        <span class="keyword">if</span> hash_1 == <span class="built_in">dict</span>(hash_2):</span><br><span class="line">            <span class="keyword">return</span> <span class="literal">True</span></span><br><span class="line">        <span class="keyword">return</span> <span class="literal">False</span></span><br></pre></td></tr></table></figure>
-
-<p>I read this question for a while，Meaning<code>index</code>Read，<code>index</code>Appear<code>num[index]</code>Second-rate，1210that is”0Appear1Second-rate，”1Appear2Second-rate，”2Appear1Second-rate，”3Appear0Second-rate。ThennumJust count the things in。</p>
-<p>Because I was doing the practice of hash table two days ago，So at a glance at this question，Use directlyCounterFunction counts，Compare，Finish</p>
+                    <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>topic：</h1><p><img src="../assets/img/2023-02-01.png" alt="2023-02-01.png"><br><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/maximal-square/description/?orderBy=most_votes">221. Maximum square</a></p>
+<h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought："></a>Thought：</h1><p>可以使用Dynamic planning降低时间复杂度。we use dp(i,j) Express (i,j) The lower right corner，Only contain 1 The maximum value of the side length of the square。If we can calculate all dp(i,j) Value，Then the maximum value is that it is only included in the matrix 1 The maximum value of the side length of the square，其平方即为Maximum square的面积。</p>
+<p>So how to calculate dp Each element value？For each position (i,j)，检查在矩阵中该位置Value：</p>
+<p>if该位置Value是 0，but dp(i,j)=0，Because the current location cannot 1 Folk formation of composition；</p>
+<p>if该位置Value是 1，but dp(i,j) Value由其上方、Three adjacent locations on the left and upper left dp Value decision。in particular，The element value of the current position is equal to the minimum value of the three adjacent elements 1，The state transfer equation is as follows：</p>
+<p><code>dp(i,j)=min(dp(i−1,j),dp(i−1,j−1),dp(i,j−1))+1</code><br>also，You also need to consider boundary conditions。if i and j At least one of them is 0，but以位置(i,j) The lower right corner的Maximum square的边长只能是 1，therefore dp(i,j)=1<br><img src="https://assets.leetcode-cn.com/solution-static/221/221_fig1.png" alt="fig1"></p>
+<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight go"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">package</span> main</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">func</span> <span class="title">maximalSquare</span><span class="params">(matrix [][]<span class="type">byte</span>)</span></span> <span class="type">int</span> &#123;</span><br><span class="line">	dp := <span class="built_in">make</span>([][]<span class="type">int</span>, <span class="built_in">len</span>(matrix))</span><br><span class="line">	maxSide := <span class="number">0</span></span><br><span class="line">	<span class="keyword">for</span> i := <span class="number">0</span>; i &lt; <span class="built_in">len</span>(matrix); i++ &#123;</span><br><span class="line">		dp[i] = <span class="built_in">make</span>([]<span class="type">int</span>, <span class="built_in">len</span>(matrix[i]))</span><br><span class="line">		<span class="keyword">for</span> j := <span class="number">0</span>; j &lt; <span class="built_in">len</span>(matrix[i]); j++ &#123;</span><br><span class="line">			dp[i][j] = <span class="type">int</span>(matrix[i][j] - <span class="string">&#x27;0&#x27;</span>)</span><br><span class="line">			<span class="keyword">if</span> dp[i][j] == <span class="number">1</span> &#123;</span><br><span class="line">				maxSide = <span class="number">1</span></span><br><span class="line">			&#125;</span><br><span class="line">		&#125;</span><br><span class="line">	&#125;</span><br><span class="line">	<span class="keyword">for</span> i := <span class="number">1</span>; i &lt; <span class="built_in">len</span>(matrix); i++ &#123;</span><br><span class="line">		<span class="keyword">for</span> j := <span class="number">1</span>; j &lt; <span class="built_in">len</span>(matrix[i]); j++ &#123;</span><br><span class="line">			<span class="keyword">if</span> dp[i][j] == <span class="number">1</span> &#123;</span><br><span class="line">				dp[i][j] = min(min(dp[i<span class="number">-1</span>][j], dp[i][j<span class="number">-1</span>]), dp[i<span class="number">-1</span>][j<span class="number">-1</span>]) + <span class="number">1</span></span><br><span class="line">				<span class="keyword">if</span> dp[i][j] &gt; maxSide &#123;</span><br><span class="line">					maxSide = dp[i][j]</span><br><span class="line">				&#125;</span><br><span class="line">			&#125;</span><br><span class="line">		&#125;</span><br><span class="line">	&#125;</span><br><span class="line">	<span class="keyword">return</span> maxSide * maxSide</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">func</span> <span class="title">min</span><span class="params">(x, y <span class="type">int</span>)</span></span> <span class="type">int</span> &#123;</span><br><span class="line">	<span class="keyword">if</span> x &lt; y &#123;</span><br><span class="line">		<span class="keyword">return</span> x</span><br><span class="line">	&#125;</span><br><span class="line">	<span class="keyword">return</span> y</span><br><span class="line">&#125;</span><br><span class="line"></span><br></pre></td></tr></table></figure>
 
                 
             
@@ -1739,7 +1730,15 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -1750,7 +1749,7 @@ <h2 itemprop="name">
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/c3f7f59f.html">show all >></a>
+                    <a class="article-more-a" href="/post/e03edda.html">show all >></a>
                 </p>
             
 
@@ -1788,20 +1787,20 @@ <h2 itemprop="name">
 
 <!-- 文章页添加mathjax公式 -->
   
-    <article id="post-219_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-2283_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/16b0e9f1.html">219.Existing duplicate elements II Hash table graphics</a>
+      <a class="article-title_code_ant" href="/post/c3f7f59f.html">One question daily 2283</a>
     </h2>
   
 
 
                 
-                    <a href="/post/16b0e9f1.html" class="archive-article-date">
+                    <a href="/post/c3f7f59f.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -1833,7 +1832,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">254字</span>
+        <span class="post-count">106字</span>
       </span>
     </span>
 
@@ -1857,11 +1856,12 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <h1 id="Thought"><a href="#Thought" class="headerlink" title="Thought"></a>Thought</h1><p>This question was done on the phone at first，直接用的是双Hash table，An element，One depositindex，When a certain element exceeds2Judging whether there are two of them when they areindexSubtission is equal tokCase。So the complexity of time is<code>O(n^3)</code>。</p>
-<h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code：</h1><figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">containsNearbyDuplicate</span>(<span class="params">self, nums: <span class="type">List</span>[<span class="built_in">int</span>], k: <span class="built_in">int</span></span>) -&gt; <span class="built_in">bool</span>:</span><br><span class="line">        hash_1=&#123;&#125;</span><br><span class="line">        hash_2=&#123;&#125;</span><br><span class="line">        <span class="keyword">for</span> index, i <span class="keyword">in</span> <span class="built_in">enumerate</span>(nums):</span><br><span class="line">            <span class="keyword">if</span> i <span class="keyword">not</span> <span class="keyword">in</span> hash_1:</span><br><span class="line">                hash_1[i] = <span class="number">1</span></span><br><span class="line">                hash_2[i] = [index]</span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                hash_1[i] += <span class="number">1</span></span><br><span class="line">                hash_2[i].append(index)</span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> hash_1:</span><br><span class="line">            <span class="keyword">if</span> hash_1[i] &gt;= <span class="number">2</span>:</span><br><span class="line">                <span class="keyword">for</span> j <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(hash_2[i])):</span><br><span class="line">                    <span class="keyword">for</span> m <span class="keyword">in</span> <span class="built_in">range</span>(j + <span class="number">1</span>, <span class="built_in">len</span>(hash_2[i])):</span><br><span class="line">                        <span class="keyword">if</span> <span class="built_in">abs</span>(hash_2[i][j]-hash_2[i][m]) &lt;= k:</span><br><span class="line">                            <span class="keyword">return</span> <span class="literal">True</span></span><br><span class="line">        <span class="keyword">return</span> <span class="literal">False</span></span><br></pre></td></tr></table></figure>
+                    <p>2283.Determine whether the number of a number is equal to the value of the digital position。</p>
+<figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">digitCount</span>(<span class="params">self, num: <span class="built_in">str</span></span>) -&gt; <span class="built_in">bool</span>:</span><br><span class="line">        hash_1 = &#123;&#125;</span><br><span class="line">        <span class="keyword">for</span> index, i <span class="keyword">in</span> <span class="built_in">enumerate</span>(num):</span><br><span class="line">            <span class="keyword">if</span> <span class="built_in">int</span>(i) != <span class="number">0</span>:</span><br><span class="line">                hash_1[<span class="built_in">str</span>(index)] = <span class="built_in">int</span>(i)</span><br><span class="line">        hash_2 = Counter(num)</span><br><span class="line">        <span class="keyword">if</span> hash_1 == <span class="built_in">dict</span>(hash_2):</span><br><span class="line">            <span class="keyword">return</span> <span class="literal">True</span></span><br><span class="line">        <span class="keyword">return</span> <span class="literal">False</span></span><br></pre></td></tr></table></figure>
+
+<p>I read this question for a while，Meaning<code>index</code>Read，<code>index</code>Appear<code>num[index]</code>Second-rate，1210that is”0Appear1Second-rate，”1Appear2Second-rate，”2Appear1Second-rate，”3Appear0Second-rate。ThennumJust count the things in。</p>
+<p>Because I was doing the practice of hash table two days ago，So at a glance at this question，Use directlyCounterFunction counts，Compare，Finish</p>
 
-<p>look<a href="/u/ac_oier">@Gongshui Sanye</a>Gongshui Sanye的解法后，Only think of，这道题的目的是为了练习双指针在Hash table中的应用，TAThe original words are sorting the meaning：Whether the existence does not exceed k+1k + 1k+1 window，window内有相同元素。</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">#Sort out the meaning：Whether the existence does not exceed k+1k + 1k+1 window，window内有相同元素。</span><br><span class="line">class Solution:</span><br><span class="line">    def containsNearbyDuplicate(self, nums: List[int], k: int) -&gt; bool:</span><br><span class="line">        n = len(nums)</span><br><span class="line">        s = set()</span><br><span class="line">        for i in range(n):</span><br><span class="line">            if i &gt; k:</span><br><span class="line">                s.remove(nums[i - k - 1])</span><br><span class="line">            if nums[i] in s:</span><br><span class="line">                return True</span><br><span class="line">            s.add(nums[i])</span><br><span class="line">        return False</span><br></pre></td></tr></table></figure>
                 
             
 
@@ -1888,7 +1888,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">solved</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -1899,7 +1899,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/16b0e9f1.html">show all >></a>
+                    <a class="article-more-a" href="/post/c3f7f59f.html">show all >></a>
                 </p>
             
 
@@ -1994,7 +1994,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/page/5/index.html b/page/5/index.html
index 391fbf738..29b3bfa8a 100644
--- a/page/5/index.html
+++ b/page/5/index.html
@@ -292,20 +292,20 @@
         <div id="js-content" class="content-ll">
           
   
-    <article id="post-2299强密码检验器II_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-2293_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/7ded25bb.html">One question daily 2299. Code inspection device II</a>
+      <a class="article-title_code_ant" href="/post/9df6242c.html">One question daily 2293. Great mini game</a>
     </h2>
   
 
 
                 
-                    <a href="/post/7ded25bb.html" class="archive-article-date">
+                    <a href="/post/9df6242c.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -337,7 +337,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">283字</span>
+        <span class="post-count">331字</span>
       </span>
     </span>
 
@@ -346,7 +346,7 @@ <h2 itemprop="name">
       <span class="post-meta-item-icon">
 	    <i class="fa fa-pagelines" aria-hidden="true"></i>
         <span class="post-meta-item-text">阅读时长: </span>
-        <span class="post-count">1min</span>
+        <span class="post-count">2min</span>
       </span>
     </span>
 	
@@ -361,16 +361,13 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <p><img src="../assets/img/2023-01-20.png" alt="2023-01-20.png"></p>
-<p>Excess when executing100%User，What can I say about this question，But one<strong>Bit operation</strong>Knowledge point</p>
-<h1 id="My-code："><a href="#My-code：" class="headerlink" title="My code："></a>My code：</h1><figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">strongPasswordCheckerII</span>(<span class="params">self, password: <span class="built_in">str</span></span>) -&gt; <span class="built_in">bool</span>:</span><br><span class="line">        flag1 = flag2 = flag3 = flag4 = <span class="number">1</span></span><br><span class="line">        ret = <span class="literal">None</span></span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> password:</span><br><span class="line">            <span class="keyword">if</span> ret == i:</span><br><span class="line">                <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line">            <span class="keyword">if</span> i.isdigit():</span><br><span class="line">                flag1 = <span class="number">0</span></span><br><span class="line">            <span class="keyword">elif</span> i.isupper():</span><br><span class="line">                flag2 = <span class="number">0</span></span><br><span class="line">            <span class="keyword">elif</span> i.islower():</span><br><span class="line">                flag3 = <span class="number">0</span></span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                flag4 = <span class="number">0</span></span><br><span class="line">            ret = i</span><br><span class="line">        <span class="keyword">if</span> <span class="built_in">sum</span>([flag1, flag2, flag3, flag4]) == <span class="number">0</span> <span class="keyword">and</span> <span class="built_in">len</span>(password) &gt;= <span class="number">8</span>:</span><br><span class="line">            <span class="keyword">return</span> <span class="literal">True</span></span><br><span class="line">        <span class="keyword">return</span> <span class="literal">False</span></span><br></pre></td></tr></table></figure>
-<h1 id="Bit-operation代码："><a href="#Bit-operation代码：" class="headerlink" title="Bit operation代码："></a>Bit operation代码：</h1><p>method one：simulation + Bit operation</p>
-<p>According to the description of the topic，我们可以simulation检查密码是否满足题目要求的过程。</p>
-<p>first，We check whether the length of the password is less than 8，in the case of，Then return false。</p>
-<p>Next，We use a mask mask To record whether the password contains a lowercase letter、uppercase letter、Numbers and special characters。We traverse the password，Like a character every time，First determine whether it is the same as the previous character，in the case of，Then return false。Then，Update mask according to the type of character mask。at last，We check the mask mask Whether it is 15，in the case of，Then return true，否Then return false。</p>
-<figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">strongPasswordCheckerII</span>(<span class="params">self, password: <span class="built_in">str</span></span>) -&gt; <span class="built_in">bool</span>:</span><br><span class="line">        <span class="keyword">if</span> <span class="built_in">len</span>(password) &lt; <span class="number">8</span>:</span><br><span class="line">            <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line">        mask = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> i, c <span class="keyword">in</span> <span class="built_in">enumerate</span>(password):</span><br><span class="line">            <span class="keyword">if</span> i <span class="keyword">and</span> c == password[i - <span class="number">1</span>]:</span><br><span class="line">                <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line">            <span class="keyword">if</span> c.islower():</span><br><span class="line">                mask |= <span class="number">1</span></span><br><span class="line">            <span class="keyword">elif</span> c.isupper():</span><br><span class="line">                mask |= <span class="number">2</span></span><br><span class="line">            <span class="keyword">elif</span> c.isdigit():</span><br><span class="line">                mask |= <span class="number">4</span></span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                mask |= <span class="number">8</span></span><br><span class="line">        <span class="keyword">return</span> mask == <span class="number">15</span></span><br></pre></td></tr></table></figure>
+                    <p>Although it is a simple question，But there are recursive ideas。      </p>
+<p>Constantly convert the one -dimensional list into a two -dimensional list for operation（This can be avoidedindexChaos caused by changes）</p>
+<p>Then useflagCount，Comparison of maximum and minimum values。    </p>
+<p>Just return to the end，Although it must be returned to a number，Still‘nums[0]’To avoid warning。</p>
+<figure class="highlight html"><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></pre></td><td class="code"><pre><span class="line">2293. Great mini game</span><br><span class="line">Simple</span><br><span class="line">39</span><br><span class="line">company</span><br><span class="line">Google Google</span><br><span class="line">Give you a bidding 0 Started integer array nums ，Its length is 2 Power。</span><br><span class="line"></span><br><span class="line">right nums Execute the following algorithm：</span><br><span class="line"></span><br><span class="line">set up n equal nums length，if n == 1 ，termination Algorithm。otherwise，create A new integer array newNums ，The length of the new array is n / 2 ，Bidding from 0 start。</span><br><span class="line">right于满足 0 &lt;= i &lt; n / 2 Every even Bidding i ，Will newNums[i] Assignment for min(nums[2 * i], nums[2 * i + 1]) 。</span><br><span class="line">right于满足 0 &lt;= i &lt; n / 2 Every odd number Bidding i ，Will newNums[i] Assignment for max(nums[2 * i], nums[2 * i + 1]) 。</span><br><span class="line">use newNums replace nums 。</span><br><span class="line">From steps 1 start repeat the whole process。</span><br><span class="line">After executing the algorithm，return nums The remaining numbers。</span><br><span class="line"></span><br><span class="line"> </span><br><span class="line"></span><br><span class="line">Exemplary example 1：</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"></span><br><span class="line">enter：nums = [1,3,5,2,4,8,2,2]</span><br><span class="line">Output：1</span><br><span class="line">explain：repeat执行算法会得到下述数组。</span><br><span class="line">first round：nums = [1,5,4,2]</span><br><span class="line">second round：nums = [1,4]</span><br><span class="line">Third round：nums = [1]</span><br><span class="line">1 Is the last number left，return 1 。</span><br><span class="line">Exemplary example 2：</span><br><span class="line"></span><br><span class="line">enter：nums = [3]</span><br><span class="line">Output：3</span><br><span class="line">explain：3 Is the last number left，return 3 。</span><br><span class="line"> </span><br><span class="line"></span><br><span class="line">hint：</span><br><span class="line"></span><br><span class="line">1 &lt;= nums.length &lt;= 1024</span><br><span class="line">1 &lt;= nums[i] &lt;= 109</span><br><span class="line">nums.length yes 2 Power</span><br><span class="line"></span><br></pre></td></tr></table></figure>
 
-<p>author：ylb<br>Link：<a target="_blank" rel="noopener" href="https://leetcode.cn/problems/strong-password-checker-ii/solutions/2068878/by-lcbin-hk2a/">https://leetcode.cn/problems/strong-password-checker-ii/solutions/2068878/by-lcbin-hk2a/</a></p>
+<figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">minMaxGame</span>(<span class="params">self, nums: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        flag = <span class="number">0</span></span><br><span class="line">        <span class="keyword">while</span> <span class="built_in">len</span>(nums) &gt; <span class="number">1</span>:</span><br><span class="line">            nums = [nums[i:i + <span class="number">2</span>] <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="number">0</span>, <span class="built_in">len</span>(nums), <span class="number">2</span>)]</span><br><span class="line">            <span class="comment"># Divide2dimension</span></span><br><span class="line">            <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(nums)):</span><br><span class="line">                <span class="keyword">if</span> flag % <span class="number">2</span> == <span class="number">0</span>:</span><br><span class="line">                    nums[i] = <span class="built_in">min</span>(nums[i])</span><br><span class="line">                    flag += <span class="number">1</span></span><br><span class="line">                <span class="keyword">else</span>:</span><br><span class="line">                    nums[i] = <span class="built_in">max</span>(nums[i])</span><br><span class="line">                    flag += <span class="number">1</span></span><br><span class="line">        <span class="keyword">return</span> nums[<span class="number">0</span>]</span><br><span class="line"></span><br></pre></td></tr></table></figure>
 
                 
             
@@ -398,11 +395,7 @@ <h1 id="Bit-operation代码："><a href="#Bit-operation代码：" class="headerl
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">Bit operation</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -413,7 +406,7 @@ <h1 id="Bit-operation代码："><a href="#Bit-operation代码：" class="headerl
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/7ded25bb.html">show all >></a>
+                    <a class="article-more-a" href="/post/9df6242c.html">show all >></a>
                 </p>
             
 
@@ -451,20 +444,20 @@ <h1 id="Bit-operation代码："><a href="#Bit-operation代码：" class="headerl
 
 <!-- 文章页添加mathjax公式 -->
   
-    <article id="post-2293_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
+    <article id="post-2299强密码检验器II_translated" class="article article-type-post  article-index" itemscope itemprop="blogPost">
     <div class="article-inner">
         
             <header class="article-header">
                 
   
     <h2 itemprop="name">
-      <a class="article-title_code_ant" href="/post/9df6242c.html">One question daily 2293. Great mini game</a>
+      <a class="article-title_code_ant" href="/post/7ded25bb.html">One question daily 2299. Code inspection device II</a>
     </h2>
   
 
 
                 
-                    <a href="/post/9df6242c.html" class="archive-article-date">
+                    <a href="/post/7ded25bb.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -496,7 +489,7 @@ <h2 itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">331字</span>
+        <span class="post-count">283字</span>
       </span>
     </span>
 
@@ -505,7 +498,7 @@ <h2 itemprop="name">
       <span class="post-meta-item-icon">
 	    <i class="fa fa-pagelines" aria-hidden="true"></i>
         <span class="post-meta-item-text">阅读时长: </span>
-        <span class="post-count">2min</span>
+        <span class="post-count">1min</span>
       </span>
     </span>
 	
@@ -520,13 +513,16 @@ <h2 itemprop="name">
             <!-- 添加分类与标签 -->
             
                 
-                    <p>Although it is a simple question，But there are recursive ideas。      </p>
-<p>Constantly convert the one -dimensional list into a two -dimensional list for operation（This can be avoidedindexChaos caused by changes）</p>
-<p>Then useflagCount，Comparison of maximum and minimum values。    </p>
-<p>Just return to the end，Although it must be returned to a number，Still‘nums[0]’To avoid warning。</p>
-<figure class="highlight html"><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></pre></td><td class="code"><pre><span class="line">2293. Great mini game</span><br><span class="line">Simple</span><br><span class="line">39</span><br><span class="line">company</span><br><span class="line">Google Google</span><br><span class="line">Give you a bidding 0 Started integer array nums ，Its length is 2 Power。</span><br><span class="line"></span><br><span class="line">right nums Execute the following algorithm：</span><br><span class="line"></span><br><span class="line">set up n equal nums length，if n == 1 ，termination Algorithm。otherwise，create A new integer array newNums ，The length of the new array is n / 2 ，Bidding from 0 start。</span><br><span class="line">right于满足 0 &lt;= i &lt; n / 2 Every even Bidding i ，Will newNums[i] Assignment for min(nums[2 * i], nums[2 * i + 1]) 。</span><br><span class="line">right于满足 0 &lt;= i &lt; n / 2 Every odd number Bidding i ，Will newNums[i] Assignment for max(nums[2 * i], nums[2 * i + 1]) 。</span><br><span class="line">use newNums replace nums 。</span><br><span class="line">From steps 1 start repeat the whole process。</span><br><span class="line">After executing the algorithm，return nums The remaining numbers。</span><br><span class="line"></span><br><span class="line"> </span><br><span class="line"></span><br><span class="line">Exemplary example 1：</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"></span><br><span class="line">enter：nums = [1,3,5,2,4,8,2,2]</span><br><span class="line">Output：1</span><br><span class="line">explain：repeat执行算法会得到下述数组。</span><br><span class="line">first round：nums = [1,5,4,2]</span><br><span class="line">second round：nums = [1,4]</span><br><span class="line">Third round：nums = [1]</span><br><span class="line">1 Is the last number left，return 1 。</span><br><span class="line">Exemplary example 2：</span><br><span class="line"></span><br><span class="line">enter：nums = [3]</span><br><span class="line">Output：3</span><br><span class="line">explain：3 Is the last number left，return 3 。</span><br><span class="line"> </span><br><span class="line"></span><br><span class="line">hint：</span><br><span class="line"></span><br><span class="line">1 &lt;= nums.length &lt;= 1024</span><br><span class="line">1 &lt;= nums[i] &lt;= 109</span><br><span class="line">nums.length yes 2 Power</span><br><span class="line"></span><br></pre></td></tr></table></figure>
+                    <p><img src="../assets/img/2023-01-20.png" alt="2023-01-20.png"></p>
+<p>Excess when executing100%User，What can I say about this question，But one<strong>Bit operation</strong>Knowledge point</p>
+<h1 id="My-code："><a href="#My-code：" class="headerlink" title="My code："></a>My code：</h1><figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">strongPasswordCheckerII</span>(<span class="params">self, password: <span class="built_in">str</span></span>) -&gt; <span class="built_in">bool</span>:</span><br><span class="line">        flag1 = flag2 = flag3 = flag4 = <span class="number">1</span></span><br><span class="line">        ret = <span class="literal">None</span></span><br><span class="line">        <span class="keyword">for</span> i <span class="keyword">in</span> password:</span><br><span class="line">            <span class="keyword">if</span> ret == i:</span><br><span class="line">                <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line">            <span class="keyword">if</span> i.isdigit():</span><br><span class="line">                flag1 = <span class="number">0</span></span><br><span class="line">            <span class="keyword">elif</span> i.isupper():</span><br><span class="line">                flag2 = <span class="number">0</span></span><br><span class="line">            <span class="keyword">elif</span> i.islower():</span><br><span class="line">                flag3 = <span class="number">0</span></span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                flag4 = <span class="number">0</span></span><br><span class="line">            ret = i</span><br><span class="line">        <span class="keyword">if</span> <span class="built_in">sum</span>([flag1, flag2, flag3, flag4]) == <span class="number">0</span> <span class="keyword">and</span> <span class="built_in">len</span>(password) &gt;= <span class="number">8</span>:</span><br><span class="line">            <span class="keyword">return</span> <span class="literal">True</span></span><br><span class="line">        <span class="keyword">return</span> <span class="literal">False</span></span><br></pre></td></tr></table></figure>
+<h1 id="Bit-operation代码："><a href="#Bit-operation代码：" class="headerlink" title="Bit operation代码："></a>Bit operation代码：</h1><p>method one：simulation + Bit operation</p>
+<p>According to the description of the topic，我们可以simulation检查密码是否满足题目要求的过程。</p>
+<p>first，We check whether the length of the password is less than 8，in the case of，Then return false。</p>
+<p>Next，We use a mask mask To record whether the password contains a lowercase letter、uppercase letter、Numbers and special characters。We traverse the password，Like a character every time，First determine whether it is the same as the previous character，in the case of，Then return false。Then，Update mask according to the type of character mask。at last，We check the mask mask Whether it is 15，in the case of，Then return true，否Then return false。</p>
+<figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">strongPasswordCheckerII</span>(<span class="params">self, password: <span class="built_in">str</span></span>) -&gt; <span class="built_in">bool</span>:</span><br><span class="line">        <span class="keyword">if</span> <span class="built_in">len</span>(password) &lt; <span class="number">8</span>:</span><br><span class="line">            <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line">        mask = <span class="number">0</span></span><br><span class="line">        <span class="keyword">for</span> i, c <span class="keyword">in</span> <span class="built_in">enumerate</span>(password):</span><br><span class="line">            <span class="keyword">if</span> i <span class="keyword">and</span> c == password[i - <span class="number">1</span>]:</span><br><span class="line">                <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line">            <span class="keyword">if</span> c.islower():</span><br><span class="line">                mask |= <span class="number">1</span></span><br><span class="line">            <span class="keyword">elif</span> c.isupper():</span><br><span class="line">                mask |= <span class="number">2</span></span><br><span class="line">            <span class="keyword">elif</span> c.isdigit():</span><br><span class="line">                mask |= <span class="number">4</span></span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                mask |= <span class="number">8</span></span><br><span class="line">        <span class="keyword">return</span> mask == <span class="number">15</span></span><br></pre></td></tr></table></figure>
 
-<figure class="highlight python"><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"><span class="keyword">class</span> <span class="title class_">Solution</span>:</span><br><span class="line">    <span class="keyword">def</span> <span class="title function_">minMaxGame</span>(<span class="params">self, nums: <span class="type">List</span>[<span class="built_in">int</span>]</span>) -&gt; <span class="built_in">int</span>:</span><br><span class="line">        flag = <span class="number">0</span></span><br><span class="line">        <span class="keyword">while</span> <span class="built_in">len</span>(nums) &gt; <span class="number">1</span>:</span><br><span class="line">            nums = [nums[i:i + <span class="number">2</span>] <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="number">0</span>, <span class="built_in">len</span>(nums), <span class="number">2</span>)]</span><br><span class="line">            <span class="comment"># Divide2dimension</span></span><br><span class="line">            <span class="keyword">for</span> i <span class="keyword">in</span> <span class="built_in">range</span>(<span class="built_in">len</span>(nums)):</span><br><span class="line">                <span class="keyword">if</span> flag % <span class="number">2</span> == <span class="number">0</span>:</span><br><span class="line">                    nums[i] = <span class="built_in">min</span>(nums[i])</span><br><span class="line">                    flag += <span class="number">1</span></span><br><span class="line">                <span class="keyword">else</span>:</span><br><span class="line">                    nums[i] = <span class="built_in">max</span>(nums[i])</span><br><span class="line">                    flag += <span class="number">1</span></span><br><span class="line">        <span class="keyword">return</span> nums[<span class="number">0</span>]</span><br><span class="line"></span><br></pre></td></tr></table></figure>
+<p>author：ylb<br>Link：<a target="_blank" rel="noopener" href="https://leetcode.cn/problems/strong-password-checker-ii/solutions/2068878/by-lcbin-hk2a/">https://leetcode.cn/problems/strong-password-checker-ii/solutions/2068878/by-lcbin-hk2a/</a></p>
 
                 
             
@@ -554,7 +550,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">Bit operation</a>
         		</li>
       		
 		</ul>
@@ -565,7 +565,7 @@ <h2 itemprop="name">
             <!-- 添加展开全文 -->
             
                 <p class="article-more-link">
-                    <a class="article-more-a" href="/post/9df6242c.html">show all >></a>
+                    <a class="article-more-a" href="/post/7ded25bb.html">show all >></a>
                 </p>
             
 
@@ -1922,7 +1922,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/page/6/index.html b/page/6/index.html
index 9c38b2545..0d22b7fc7 100644
--- a/page/6/index.html
+++ b/page/6/index.html
@@ -2042,7 +2042,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/page/7/index.html b/page/7/index.html
index a44720e69..91eea9baf 100644
--- a/page/7/index.html
+++ b/page/7/index.html
@@ -1998,7 +1998,7 @@ <h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought：">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/page/8/index.html b/page/8/index.html
index 3a63476fb..7954bbb6f 100644
--- a/page/8/index.html
+++ b/page/8/index.html
@@ -1970,7 +1970,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/page/9/index.html b/page/9/index.html
index d25b33733..c9c9543bf 100644
--- a/page/9/index.html
+++ b/page/9/index.html
@@ -1962,7 +1962,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/photos/index.html b/photos/index.html
index c763f86ed..0a7e42de8 100644
--- a/photos/index.html
+++ b/photos/index.html
@@ -528,7 +528,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/photos/video.html b/photos/video.html
index 0fbc1b1e9..d9a435f4e 100644
--- a/photos/video.html
+++ b/photos/video.html
@@ -523,7 +523,7 @@ <h1>(强推)李宏毅2021/2022春机器学习课程</h1>
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/11597f8b.html b/post/11597f8b.html
index 6a9e23c0b..b2f080c8d 100644
--- a/post/11597f8b.html
+++ b/post/11597f8b.html
@@ -495,11 +495,11 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     
 <nav id="article-nav">
   
-    <a href="/post/9df6242c.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/7ded25bb.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          One question daily 2293. Great mini game
+          One question daily 2299. Code inspection device II
         
       </div>
     </a>
@@ -632,7 +632,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/14b94db7.html b/post/14b94db7.html
index 06daa9265..5d4b5d773 100644
--- a/post/14b94db7.html
+++ b/post/14b94db7.html
@@ -625,7 +625,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/14d9382b.html b/post/14d9382b.html
index cc6720e01..0617f8c32 100644
--- a/post/14d9382b.html
+++ b/post/14d9382b.html
@@ -632,7 +632,7 @@ <h1 id="Thought"><a href="#Thought" class="headerlink" title="Thought"></a>Thoug
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/16b0e9f1.html b/post/16b0e9f1.html
index e8d284107..297c0f3ff 100644
--- a/post/16b0e9f1.html
+++ b/post/16b0e9f1.html
@@ -485,18 +485,18 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     
 <nav id="article-nav">
   
-    <a href="/post/c3f7f59f.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/717042a6.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          One question daily 2283
+          217. Existing duplicate elements C++/Python3
         
       </div>
     </a>
   
   
-    <a href="/post/7ded25bb.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">One question daily 2299. Code inspection device II</div>
+    <a href="/post/e03edda.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">221Maximum square</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -622,7 +622,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/1978f474.html b/post/1978f474.html
index a01af395e..dddaafa4d 100644
--- a/post/1978f474.html
+++ b/post/1978f474.html
@@ -514,18 +514,18 @@ <h1 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h1><figu
     
 <nav id="article-nav">
   
-    <a href="/post/2f3e8e26.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/4d7252f8.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          1801-1803 Liech buckle novice！
+          1663. The smallest string with a given value One question daily
         
       </div>
     </a>
   
   
-    <a href="/post/69c2a1dd.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">1813. Sentence similarity III</div>
+    <a href="/post/d482ac75.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">1669. Merge two linked watches One question daily</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -651,7 +651,7 @@ <h1 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h1><figu
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/1c57c22c.html b/post/1c57c22c.html
index 04f90d95f..fd67465f4 100644
--- a/post/1c57c22c.html
+++ b/post/1c57c22c.html
@@ -623,7 +623,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/1e6b72b8.html b/post/1e6b72b8.html
index ef2da9913..e5c8dbfce 100644
--- a/post/1e6b72b8.html
+++ b/post/1e6b72b8.html
@@ -626,7 +626,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/20116270.html b/post/20116270.html
index 64697aa38..7160da395 100644
--- a/post/20116270.html
+++ b/post/20116270.html
@@ -628,7 +628,7 @@ <h1 id="topic："><a href="#topic：" class="headerlink" title="topic："></a>to
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/20ffa67a.html b/post/20ffa67a.html
index 548dd5655..9420ebaf4 100644
--- a/post/20ffa67a.html
+++ b/post/20ffa67a.html
@@ -626,7 +626,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/2280b647.html b/post/2280b647.html
index 3379851da..bc9003c44 100644
--- a/post/2280b647.html
+++ b/post/2280b647.html
@@ -629,7 +629,7 @@ <h1 id="Code"><a href="#Code" class="headerlink" title="Code:"></a>Code:</h1><fi
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/2660e935.html b/post/2660e935.html
index 60d6c540a..99d045cba 100644
--- a/post/2660e935.html
+++ b/post/2660e935.html
@@ -635,7 +635,7 @@ <h1 id="What-is-the-Internal-Union-Extension"><a href="#What-is-the-Internal-Uni
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/29546b92.html b/post/29546b92.html
index e890cbc46..387fbd6e3 100644
--- a/post/29546b92.html
+++ b/post/29546b92.html
@@ -650,7 +650,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/2aa720ec.html b/post/2aa720ec.html
index feb7a9643..b88d6b27b 100644
--- a/post/2aa720ec.html
+++ b/post/2aa720ec.html
@@ -640,7 +640,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/2c4cc46c.html b/post/2c4cc46c.html
index 271e863c7..377bec966 100644
--- a/post/2c4cc46c.html
+++ b/post/2c4cc46c.html
@@ -642,7 +642,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/2f3e8e26.html b/post/2f3e8e26.html
index 25b259613..6da67e9b5 100644
--- a/post/2f3e8e26.html
+++ b/post/2f3e8e26.html
@@ -498,8 +498,8 @@ <h1 class="article-title_code_ant" itemprop="name">
     </a>
   
   
-    <a href="/post/1978f474.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">1664. Number of schemes to generate balance numbers One question daily</div>
+    <a href="/post/69c2a1dd.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">1813. Sentence similarity III</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -625,7 +625,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/3109a910.html b/post/3109a910.html
index 39a21efb9..a2f485664 100644
--- a/post/3109a910.html
+++ b/post/3109a910.html
@@ -639,7 +639,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/32401b69.html b/post/32401b69.html
index 3ea07dd61..2448ed499 100644
--- a/post/32401b69.html
+++ b/post/32401b69.html
@@ -732,7 +732,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/3277549c.html b/post/3277549c.html
index 781c5c5f8..8e36db311 100644
--- a/post/3277549c.html
+++ b/post/3277549c.html
@@ -507,8 +507,8 @@ <h1 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h1><figu
     </a>
   
   
-    <a href="/post/6be57ef7.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">1825. Seek out MK average value</div>
+    <a href="/post/c916b663.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">19.Delete the countdown of the linked listNNode</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -634,7 +634,7 @@ <h1 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h1><figu
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/3667cd44.html b/post/3667cd44.html
index b95e1462a..0d193a73c 100644
--- a/post/3667cd44.html
+++ b/post/3667cd44.html
@@ -636,7 +636,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/36f314aa.html b/post/36f314aa.html
index 3151c0d8c..51e479043 100644
--- a/post/36f314aa.html
+++ b/post/36f314aa.html
@@ -634,7 +634,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/3a21fe32.html b/post/3a21fe32.html
index d1b2014ca..4336be7ff 100644
--- a/post/3a21fe32.html
+++ b/post/3a21fe32.html
@@ -656,7 +656,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/3ed2f01c.html b/post/3ed2f01c.html
index 37de7c820..b4b2bd154 100644
--- a/post/3ed2f01c.html
+++ b/post/3ed2f01c.html
@@ -626,7 +626,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/41f30363.html b/post/41f30363.html
index 84c93b709..5a38d6be5 100644
--- a/post/41f30363.html
+++ b/post/41f30363.html
@@ -622,7 +622,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/435a9a0d.html b/post/435a9a0d.html
index 4a9ce8354..f29b1f81e 100644
--- a/post/435a9a0d.html
+++ b/post/435a9a0d.html
@@ -510,8 +510,8 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     </a>
   
   
-    <a href="/post/e2c9cca9.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">142.Ring linkedII</div>
+    <a href="/post/b2a927d5.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">1551. Make all the minimum operations of all elements in the array</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -637,7 +637,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/4400daa1.html b/post/4400daa1.html
index 7cd13f46b..c6f6340da 100644
--- a/post/4400daa1.html
+++ b/post/4400daa1.html
@@ -641,7 +641,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/48a38683.html b/post/48a38683.html
index 0915e543b..c812bde17 100644
--- a/post/48a38683.html
+++ b/post/48a38683.html
@@ -714,7 +714,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/4d7252f8.html b/post/4d7252f8.html
index 9f69692fc..1cc90434c 100644
--- a/post/4d7252f8.html
+++ b/post/4d7252f8.html
@@ -505,8 +505,8 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     </a>
   
   
-    <a href="/post/d482ac75.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">1669. Merge two linked watches One question daily</div>
+    <a href="/post/1978f474.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">1664. Number of schemes to generate balance numbers One question daily</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -632,7 +632,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/4e14482b.html b/post/4e14482b.html
index fc0710339..6283e03aa 100644
--- a/post/4e14482b.html
+++ b/post/4e14482b.html
@@ -631,7 +631,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/50818339.html b/post/50818339.html
index 52b8d3512..6f165c4eb 100644
--- a/post/50818339.html
+++ b/post/50818339.html
@@ -627,7 +627,7 @@ <h1 id="代码："><a href="#代码：" class="headerlink" title="代码："></a
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/5277100.html b/post/5277100.html
index 8607d97ec..91d126a85 100644
--- a/post/5277100.html
+++ b/post/5277100.html
@@ -654,7 +654,7 @@ <h3 id="The-role-and-the-rolezip-explain"><a href="#The-role-and-the-rolezip-exp
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/52923acb.html b/post/52923acb.html
index c01308344..acb76da2a 100644
--- a/post/52923acb.html
+++ b/post/52923acb.html
@@ -628,7 +628,7 @@ <h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought：">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/56d97dcf.html b/post/56d97dcf.html
index 39dc236e4..99a9b526e 100644
--- a/post/56d97dcf.html
+++ b/post/56d97dcf.html
@@ -491,11 +491,11 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     
 <nav id="article-nav">
   
-    <a href="/post/eb193c1f.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/6610c769.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          1139. The greatest 1 Formation of the border  One question daily
+          1233Delete the subfolder folder One question daily
         
       </div>
     </a>
@@ -628,7 +628,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/56e64fdd.html b/post/56e64fdd.html
index dbf274ab8..55d5aa336 100644
--- a/post/56e64fdd.html
+++ b/post/56e64fdd.html
@@ -685,7 +685,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/59825e1f.html b/post/59825e1f.html
index 4543d60f3..05257d886 100644
--- a/post/59825e1f.html
+++ b/post/59825e1f.html
@@ -496,11 +496,11 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     
 <nav id="article-nav">
   
-    <a href="/post/b2a927d5.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/e2c9cca9.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          1551. Make all the minimum operations of all elements in the array
+          142.Ring linkedII
         
       </div>
     </a>
@@ -633,7 +633,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/5992f238.html b/post/5992f238.html
index a397b30fd..78bcb8baf 100644
--- a/post/5992f238.html
+++ b/post/5992f238.html
@@ -645,7 +645,7 @@ <h1 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h1><figu
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/5a764983.html b/post/5a764983.html
index 8a79cd0b9..310f06e48 100644
--- a/post/5a764983.html
+++ b/post/5a764983.html
@@ -621,7 +621,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/5c07686c.html b/post/5c07686c.html
index 2a2e03ec7..ddfdeb060 100644
--- a/post/5c07686c.html
+++ b/post/5c07686c.html
@@ -627,7 +627,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/5c98e66b.html b/post/5c98e66b.html
index d6bed9980..bfd7e77a8 100644
--- a/post/5c98e66b.html
+++ b/post/5c98e66b.html
@@ -643,7 +643,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/5ee4164.html b/post/5ee4164.html
index 4e4e57bcd..2c3d36efa 100644
--- a/post/5ee4164.html
+++ b/post/5ee4164.html
@@ -632,7 +632,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/616577aa.html b/post/616577aa.html
index 851882a9d..2af9e63e3 100644
--- a/post/616577aa.html
+++ b/post/616577aa.html
@@ -636,7 +636,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/66079b7b.html b/post/66079b7b.html
index 548f56371..d546010f7 100644
--- a/post/66079b7b.html
+++ b/post/66079b7b.html
@@ -632,7 +632,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/6610c769.html b/post/6610c769.html
index c9e5ce84c..f513361b2 100644
--- a/post/6610c769.html
+++ b/post/6610c769.html
@@ -497,18 +497,18 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     
 <nav id="article-nav">
   
-    <a href="/post/fd471847.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/eb193c1f.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          1138. The path on the letter board One question daily
+          1139. The greatest 1 Formation of the border  One question daily
         
       </div>
     </a>
   
   
-    <a href="/post/eb193c1f.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">1139. The greatest 1 Formation of the border  One question daily</div>
+    <a href="/post/56d97dcf.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">1234. Replace the sub -string to get a balanced string One question daily</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -634,7 +634,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/67fc8613.html b/post/67fc8613.html
index ad4c982b7..dddd39dd3 100644
--- a/post/67fc8613.html
+++ b/post/67fc8613.html
@@ -630,7 +630,7 @@ <h1 id="错误type"><a href="#错误type" class="headerlink" title="错误type">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/69c2a1dd.html b/post/69c2a1dd.html
index 8e35d9329..1acb720df 100644
--- a/post/69c2a1dd.html
+++ b/post/69c2a1dd.html
@@ -492,11 +492,11 @@ <h1 id="Official-solution："><a href="#Official-solution：" class="headerlink"
     
 <nav id="article-nav">
   
-    <a href="/post/1978f474.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/2f3e8e26.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          1664. Number of schemes to generate balance numbers One question daily
+          1801-1803 Liech buckle novice！
         
       </div>
     </a>
@@ -629,7 +629,7 @@ <h1 id="Official-solution："><a href="#Official-solution：" class="headerlink"
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/6a9ab144.html b/post/6a9ab144.html
index b3b009be2..6a8a7bccc 100644
--- a/post/6a9ab144.html
+++ b/post/6a9ab144.html
@@ -631,7 +631,7 @@ <h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought：">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/6be57ef7.html b/post/6be57ef7.html
index 7d10cea2b..cb14e585c 100644
--- a/post/6be57ef7.html
+++ b/post/6be57ef7.html
@@ -501,18 +501,18 @@ <h1 id="average-value操作"><a href="#average-value操作" class="headerlink" t
     
 <nav id="article-nav">
   
-    <a href="/post/3277549c.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/6be57ef7.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          1828. Statistics the number of a circle mid -point One question daily
+          1825. Seek out MK average value
         
       </div>
     </a>
   
   
-    <a href="/post/c916b663.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">19.Delete the countdown of the linked listNNode</div>
+    <a href="/post/3277549c.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">1828. Statistics the number of a circle mid -point One question daily</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -638,7 +638,7 @@ <h1 id="average-value操作"><a href="#average-value操作" class="headerlink" t
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/717042a6.html b/post/717042a6.html
index baaf8ba16..1c4eb7483 100644
--- a/post/717042a6.html
+++ b/post/717042a6.html
@@ -514,8 +514,8 @@ <h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought：">
     </a>
   
   
-    <a href="/post/e03edda.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">221Maximum square</div>
+    <a href="/post/16b0e9f1.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">219.Existing duplicate elements II Hash table graphics</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -641,7 +641,7 @@ <h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought：">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/73b5ce9c.html b/post/73b5ce9c.html
index 5f6e09d2f..a5630d433 100644
--- a/post/73b5ce9c.html
+++ b/post/73b5ce9c.html
@@ -629,7 +629,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/762ca698.html b/post/762ca698.html
index 16c8a9d90..6d335012e 100644
--- a/post/762ca698.html
+++ b/post/762ca698.html
@@ -632,7 +632,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/7ded25bb.html b/post/7ded25bb.html
index 1f0a5378e..7454a1535 100644
--- a/post/7ded25bb.html
+++ b/post/7ded25bb.html
@@ -498,18 +498,18 @@ <h1 id="Bit-operation代码："><a href="#Bit-operation代码：" class="headerl
     
 <nav id="article-nav">
   
-    <a href="/post/16b0e9f1.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/9df6242c.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          219.Existing duplicate elements II Hash table graphics
+          One question daily 2293. Great mini game
         
       </div>
     </a>
   
   
-    <a href="/post/9df6242c.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">One question daily 2293. Great mini game</div>
+    <a href="/post/11597f8b.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">2303. Calculate the total taxable amount</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -635,7 +635,7 @@ <h1 id="Bit-operation代码："><a href="#Bit-operation代码：" class="headerl
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/7f1331bc.html b/post/7f1331bc.html
index d672fd4f2..837d75fd5 100644
--- a/post/7f1331bc.html
+++ b/post/7f1331bc.html
@@ -636,7 +636,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/80cafdc8.html b/post/80cafdc8.html
index 75fbca6db..60a8f6e10 100644
--- a/post/80cafdc8.html
+++ b/post/80cafdc8.html
@@ -523,18 +523,18 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     
 <nav id="article-nav">
   
-    <a href="/post/a5d1dfda.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/dce95dce.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          1124. The longest period of performance One question daily
+          1017. Negative binary conversion
         
       </div>
     </a>
   
   
-    <a href="/post/fd471847.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">1138. The path on the letter board One question daily</div>
+    <a href="/post/a5d1dfda.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">1124. The longest period of performance One question daily</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -660,7 +660,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/81004405.html b/post/81004405.html
index 69eb8d728..8e34bc868 100644
--- a/post/81004405.html
+++ b/post/81004405.html
@@ -621,7 +621,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/82e09f92.html b/post/82e09f92.html
index 9c629d3ec..904431582 100644
--- a/post/82e09f92.html
+++ b/post/82e09f92.html
@@ -635,7 +635,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/85beb0bf.html b/post/85beb0bf.html
index c93b839b6..2647e557c 100644
--- a/post/85beb0bf.html
+++ b/post/85beb0bf.html
@@ -632,7 +632,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/86590614.html b/post/86590614.html
index 32833effd..6badf21a1 100644
--- a/post/86590614.html
+++ b/post/86590614.html
@@ -642,7 +642,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/941aeb72.html b/post/941aeb72.html
index 580169d7a..eadca1c2e 100644
--- a/post/941aeb72.html
+++ b/post/941aeb72.html
@@ -644,7 +644,7 @@ <h1 id="3-Programming-preference："><a href="#3-Programming-preference：" clas
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/9df6242c.html b/post/9df6242c.html
index 81e9dff5d..fa78ef3a8 100644
--- a/post/9df6242c.html
+++ b/post/9df6242c.html
@@ -488,18 +488,18 @@ <h1 class="article-title_code_ant" itemprop="name">
     
 <nav id="article-nav">
   
-    <a href="/post/7ded25bb.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/c3f7f59f.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          One question daily 2299. Code inspection device II
+          One question daily 2283
         
       </div>
     </a>
   
   
-    <a href="/post/11597f8b.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">2303. Calculate the total taxable amount</div>
+    <a href="/post/7ded25bb.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">One question daily 2299. Code inspection device II</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -625,7 +625,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/a1d26db4.html b/post/a1d26db4.html
index db7bc7e79..d3c0a5728 100644
--- a/post/a1d26db4.html
+++ b/post/a1d26db4.html
@@ -624,7 +624,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/a386fcdc.html b/post/a386fcdc.html
index 4d189227c..5914bf2af 100644
--- a/post/a386fcdc.html
+++ b/post/a386fcdc.html
@@ -662,7 +662,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/a564ea0e.html b/post/a564ea0e.html
index ba74851dc..d8a55dc84 100644
--- a/post/a564ea0e.html
+++ b/post/a564ea0e.html
@@ -628,7 +628,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/a5d1dfda.html b/post/a5d1dfda.html
index 5744b7e46..48ed84b17 100644
--- a/post/a5d1dfda.html
+++ b/post/a5d1dfda.html
@@ -495,18 +495,18 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     
 <nav id="article-nav">
   
-    <a href="/post/dce95dce.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/80cafdc8.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          1017. Negative binary conversion
+          1017.Negative binary conversion
         
       </div>
     </a>
   
   
-    <a href="/post/80cafdc8.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">1017.Negative binary conversion</div>
+    <a href="/post/fd471847.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">1138. The path on the letter board One question daily</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -632,7 +632,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/a6577367.html b/post/a6577367.html
index fcdb36577..a915c1fa4 100644
--- a/post/a6577367.html
+++ b/post/a6577367.html
@@ -640,7 +640,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/a75da5a.html b/post/a75da5a.html
index d2687fe48..c48d18d2b 100644
--- a/post/a75da5a.html
+++ b/post/a75da5a.html
@@ -638,7 +638,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/a927044d.html b/post/a927044d.html
index 75a836e93..5c3390c85 100644
--- a/post/a927044d.html
+++ b/post/a927044d.html
@@ -670,7 +670,7 @@ <h2 id="Biological-formula"><a href="#Biological-formula" class="headerlink" tit
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/ac786f6f.html b/post/ac786f6f.html
index 2f8c703bd..a0f8a2342 100644
--- a/post/ac786f6f.html
+++ b/post/ac786f6f.html
@@ -667,7 +667,7 @@ <h1 id="Slide-7-Function-6-f6-filename"><a href="#Slide-7-Function-6-f6-filename
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/ae10d3c1.html b/post/ae10d3c1.html
index 14d734bb1..88ab62c85 100644
--- a/post/ae10d3c1.html
+++ b/post/ae10d3c1.html
@@ -642,7 +642,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/b2a927d5.html b/post/b2a927d5.html
index 088e29cb6..10a9cbb84 100644
--- a/post/b2a927d5.html
+++ b/post/b2a927d5.html
@@ -505,18 +505,18 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     
 <nav id="article-nav">
   
-    <a href="/post/e2c9cca9.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/435a9a0d.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          142.Ring linkedII
+          1250. examine「Good array」 One question daily
         
       </div>
     </a>
   
   
-    <a href="/post/59825e1f.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">1590.Make the array and energyPDivide</div>
+    <a href="/post/e2c9cca9.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">142.Ring linkedII</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -642,7 +642,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/b4953d62.html b/post/b4953d62.html
index 7d493c39f..69ea353be 100644
--- a/post/b4953d62.html
+++ b/post/b4953d62.html
@@ -655,7 +655,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/b625a0e1.html b/post/b625a0e1.html
index b934eec94..4ac4bed05 100644
--- a/post/b625a0e1.html
+++ b/post/b625a0e1.html
@@ -637,7 +637,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/b9130c0e.html b/post/b9130c0e.html
index d707f72bf..ae0f24be9 100644
--- a/post/b9130c0e.html
+++ b/post/b9130c0e.html
@@ -647,7 +647,7 @@ <h1 id="Second-solution"><a href="#Second-solution" class="headerlink" title="Se
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/bb7bcf54.html b/post/bb7bcf54.html
index 9716e1ad0..d8d283626 100644
--- a/post/bb7bcf54.html
+++ b/post/bb7bcf54.html
@@ -628,7 +628,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/bbe4bff6.html b/post/bbe4bff6.html
index 6a733d6a3..7e632194e 100644
--- a/post/bbe4bff6.html
+++ b/post/bbe4bff6.html
@@ -633,7 +633,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/becdc081.html b/post/becdc081.html
index 07d8e5ffc..9c368acaa 100644
--- a/post/becdc081.html
+++ b/post/becdc081.html
@@ -18,7 +18,7 @@
 <meta property="og:description" content="Exercise 1:This exercise focuses on input validation and formatting floating-point numbers. The goal is to prompt the user to enter a floating-point number between -1 and 1 (exclusive). If the input i">
 <meta property="og:locale" content="en_US">
 <meta property="article:published_time" content="2024-09-18T01:00:36.787Z">
-<meta property="article:modified_time" content="2024-09-18T01:00:36.787Z">
+<meta property="article:modified_time" content="2024-09-18T05:45:56.001Z">
 <meta property="article:author" content="loong loong">
 <meta property="article:tag" content="Python">
 <meta property="article:tag" content="Tutorial">
@@ -355,7 +355,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 	    <i class="fa fa-bar-chart" aria-hidden="true"></i>
         <!-- <i class="fa fa-keyboard-o" aria-hidden="true"></i> -->
         <span class="post-meta-item-text">字数统计: </span>
-        <span class="post-count">2.5k字</span>
+        <span class="post-count">2.8k字</span>
       </span>
     </span>
 
@@ -364,7 +364,7 @@ <h1 class="article-title_code_ant" itemprop="name">
       <span class="post-meta-item-icon">
 	    <i class="fa fa-pagelines" aria-hidden="true"></i>
         <span class="post-meta-item-text">阅读时长: </span>
-        <span class="post-count">15min</span>
+        <span class="post-count">17min</span>
       </span>
     </span>
 	
@@ -487,6 +487,16 @@ <h1 id="Exercise-6"><a href="#Exercise-6" class="headerlink" title="Exercise 6:"
 </ol>
 <figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="comment"># Assume that the argument n is an integer.</span></span><br><span class="line"><span class="comment">#</span></span><br><span class="line"><span class="comment"># The output is printed out, not returned.</span></span><br><span class="line"><span class="comment">#</span></span><br><span class="line"><span class="comment"># You might find the abs() function useful.</span></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">f6</span>(<span class="params">n</span>):</span><br><span class="line">    <span class="keyword">if</span> n == <span class="number">0</span>:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;0 = 2^k * 0 for all integers k!&quot;</span>)</span><br><span class="line">    <span class="keyword">else</span>:</span><br><span class="line">        k = <span class="number">0</span></span><br><span class="line">        ori = n</span><br><span class="line">        <span class="keyword">if</span> n &lt; <span class="number">0</span>:</span><br><span class="line">            sign = <span class="string">&#x27;-&#x27;</span></span><br><span class="line">            n = -n</span><br><span class="line">        <span class="keyword">else</span>:</span><br><span class="line">            sign = <span class="string">&#x27;&#x27;</span></span><br><span class="line">        <span class="keyword">while</span> n % <span class="number">2</span> == <span class="number">0</span>:</span><br><span class="line">            n //= <span class="number">2</span></span><br><span class="line">            k += <span class="number">1</span></span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;<span class="subst">&#123;ori&#125;</span> = <span class="subst">&#123;sign&#125;</span>2^<span class="subst">&#123;k&#125;</span> * <span class="subst">&#123;n&#125;</span>&quot;</span>)</span><br><span class="line">    <span class="keyword">return</span></span><br></pre></td></tr></table></figure>
 
+<p><strong>FOR VERY VERY VERY VERY VERY BIG NUMBER:</strong></p>
+<p>When dealing with very large integers, the method of continuously dividing the number by 2 to factor out powers of 2 (2^k) can become inefficient. This is because each division can be costly in terms of computational time, especially for very large numbers with millions or billions of digits. Each division involves recalculating the entire integer, which is slow for large integers.<br>Using Bit Manipulation:</p>
+<p>A much more efficient approach is to use <strong>bit manipulation</strong> to determine how many times a number can be divided by 2 (i.e., how many factors of 2 it has). This method avoids division altogether and instead directly analyzes the binary representation of the number to count the number of trailing zeros, which correspond to the powers of 2 in the factorization.</p>
+<h3 id="Why"><a href="#Why" class="headerlink" title="Why?"></a>Why?</h3><ol>
+<li><p>Bitwise operations are much faster than arithmetic operations like division, especially for large integers. Counting the trailing zeros in a number’s binary representation can be done in constant time.</p>
+</li>
+<li><p>Extracting the lowest set bit of a number allows us to quickly find how many times a number can be divided by 2 without having to repeatedly divide the number. This provides the power of 2 (k) directly.</p>
+</li>
+</ol>
+<figure class="highlight python"><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></pre></td><td class="code"><pre><span class="line"><span class="keyword">def</span> <span class="title function_">f6</span>(<span class="params">n</span>):</span><br><span class="line">    <span class="keyword">if</span> n == <span class="number">0</span>:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;0 = 2^k * 0 for all integers k!&quot;</span>)</span><br><span class="line">        <span class="keyword">return</span></span><br><span class="line">    </span><br><span class="line">    <span class="comment"># Handle negative sign</span></span><br><span class="line">    sign = <span class="string">&#x27;-&#x27;</span> <span class="keyword">if</span> n &lt; <span class="number">0</span> <span class="keyword">else</span> <span class="string">&#x27;&#x27;</span></span><br><span class="line">    n = <span class="built_in">abs</span>(n)</span><br><span class="line">    </span><br><span class="line">    <span class="comment"># Using bit manipulation to count how many trailing zeros (powers of 2)</span></span><br><span class="line">    k = (n &amp; -n).bit_length() - <span class="number">1</span>  <span class="comment"># Count trailing zeros by isolating the lowest set bit</span></span><br><span class="line">    </span><br><span class="line">    <span class="comment"># Remove 2^k factor from n</span></span><br><span class="line">    m = n &gt;&gt; k  <span class="comment"># Equivalent to n // 2^k, shifting right by k bits</span></span><br><span class="line">    </span><br><span class="line">    <span class="comment"># Print the result</span></span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;<span class="subst">&#123;sign&#125;</span><span class="subst">&#123;n&#125;</span> = <span class="subst">&#123;sign&#125;</span>2^<span class="subst">&#123;k&#125;</span> * <span class="subst">&#123;m&#125;</span>&quot;</span>)</span><br></pre></td></tr></table></figure>
                 
             
 
@@ -616,7 +626,7 @@ <h1 id="Exercise-6"><a href="#Exercise-6" class="headerlink" title="Exercise 6:"
           <span class="tooltip-content">
 			<span style="font-size: 20px;font-weight: bold;">目录</span>
             <div class="toc-article">
-              <ol class="toc"><li class="toc-item toc-level-1"><a class="toc-link" href="#Exercise-1"><span class="toc-number">1.</span> <span class="toc-text">Exercise 1:</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#Exercise-2"><span class="toc-number">2.</span> <span class="toc-text">Exercise 2:</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#Why-use-re-in-Exercise-2-and-what-is-re"><span class="toc-number">2.0.1.</span> <span class="toc-text">Why use re in Exercise 2, and what is re?</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#What-is-re"><span class="toc-number">2.0.2.</span> <span class="toc-text">What is re?</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#Why-use-re-in-Exercise-2"><span class="toc-number">2.0.3.</span> <span class="toc-text">Why use re in Exercise 2?</span></a></li></ol></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#Exercise-3"><span class="toc-number">3.</span> <span class="toc-text">Exercise 3:</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#Why-is-deque-more-efficient-than-list-in-Exercise-3"><span class="toc-number">3.0.1.</span> <span class="toc-text">Why is deque more efficient than list in Exercise 3?</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#What-is-a-deque"><span class="toc-number">3.0.2.</span> <span class="toc-text">What is a deque?</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#Key-Features-of-deque"><span class="toc-number">3.0.3.</span> <span class="toc-text">Key Features of deque:</span></a></li></ol></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#Exercise-4"><span class="toc-number">4.</span> <span class="toc-text">Exercise 4:</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#Exercise-5"><span class="toc-number">5.</span> <span class="toc-text">Exercise 5:</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#Exercise-6"><span class="toc-number">6.</span> <span class="toc-text">Exercise 6:</span></a></li></ol>
+              <ol class="toc"><li class="toc-item toc-level-1"><a class="toc-link" href="#Exercise-1"><span class="toc-number">1.</span> <span class="toc-text">Exercise 1:</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#Exercise-2"><span class="toc-number">2.</span> <span class="toc-text">Exercise 2:</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#Why-use-re-in-Exercise-2-and-what-is-re"><span class="toc-number">2.0.1.</span> <span class="toc-text">Why use re in Exercise 2, and what is re?</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#What-is-re"><span class="toc-number">2.0.2.</span> <span class="toc-text">What is re?</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#Why-use-re-in-Exercise-2"><span class="toc-number">2.0.3.</span> <span class="toc-text">Why use re in Exercise 2?</span></a></li></ol></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#Exercise-3"><span class="toc-number">3.</span> <span class="toc-text">Exercise 3:</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#Why-is-deque-more-efficient-than-list-in-Exercise-3"><span class="toc-number">3.0.1.</span> <span class="toc-text">Why is deque more efficient than list in Exercise 3?</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#What-is-a-deque"><span class="toc-number">3.0.2.</span> <span class="toc-text">What is a deque?</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#Key-Features-of-deque"><span class="toc-number">3.0.3.</span> <span class="toc-text">Key Features of deque:</span></a></li></ol></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#Exercise-4"><span class="toc-number">4.</span> <span class="toc-text">Exercise 4:</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#Exercise-5"><span class="toc-number">5.</span> <span class="toc-text">Exercise 5:</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#Exercise-6"><span class="toc-number">6.</span> <span class="toc-text">Exercise 6:</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#Why"><span class="toc-number">6.0.1.</span> <span class="toc-text">Why?</span></a></li></ol></li></ol></li></ol>
             </div>
           </span>
         </div>
@@ -716,7 +726,7 @@ <h1 id="Exercise-6"><a href="#Exercise-6" class="headerlink" title="Exercise 6:"
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/c3f7f59f.html b/post/c3f7f59f.html
index 1de1f39c7..15b242cfd 100644
--- a/post/c3f7f59f.html
+++ b/post/c3f7f59f.html
@@ -496,8 +496,8 @@ <h1 class="article-title_code_ant" itemprop="name">
     </a>
   
   
-    <a href="/post/16b0e9f1.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">219.Existing duplicate elements II Hash table graphics</div>
+    <a href="/post/9df6242c.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">One question daily 2293. Great mini game</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -623,7 +623,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/c916b663.html b/post/c916b663.html
index bf6e077b7..7a204cdf4 100644
--- a/post/c916b663.html
+++ b/post/c916b663.html
@@ -530,11 +530,11 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     
 <nav id="article-nav">
   
-    <a href="/post/6be57ef7.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/3277549c.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          1825. Seek out MK average value
+          1828. Statistics the number of a circle mid -point One question daily
         
       </div>
     </a>
@@ -667,7 +667,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/cac21f27.html b/post/cac21f27.html
index 66ed90fa0..4f0994501 100644
--- a/post/cac21f27.html
+++ b/post/cac21f27.html
@@ -626,7 +626,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/ceb1e67f.html b/post/ceb1e67f.html
index f92ef5109..7eb21f1f0 100644
--- a/post/ceb1e67f.html
+++ b/post/ceb1e67f.html
@@ -642,7 +642,7 @@ <h1 id="code-show-as-below："><a href="#code-show-as-below：" class="headerlin
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/d030a5a0.html b/post/d030a5a0.html
index 72991daa2..ceb426af6 100644
--- a/post/d030a5a0.html
+++ b/post/d030a5a0.html
@@ -662,7 +662,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/d0a9337b.html b/post/d0a9337b.html
index a291e3fb6..7cb029e9d 100644
--- a/post/d0a9337b.html
+++ b/post/d0a9337b.html
@@ -630,7 +630,7 @@ <h1 id="我的answer："><a href="#我的answer：" class="headerlink" title="
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/d482ac75.html b/post/d482ac75.html
index cde247257..0024173f2 100644
--- a/post/d482ac75.html
+++ b/post/d482ac75.html
@@ -497,11 +497,11 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     
 <nav id="article-nav">
   
-    <a href="/post/4d7252f8.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/1978f474.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          1663. The smallest string with a given value One question daily
+          1664. Number of schemes to generate balance numbers One question daily
         
       </div>
     </a>
@@ -634,7 +634,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/d8b8a149.html b/post/d8b8a149.html
index b8a53fe51..46dcbb389 100644
--- a/post/d8b8a149.html
+++ b/post/d8b8a149.html
@@ -645,7 +645,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/dbbd7d58.html b/post/dbbd7d58.html
index 783dc5244..ed4c5310c 100644
--- a/post/dbbd7d58.html
+++ b/post/dbbd7d58.html
@@ -631,7 +631,7 @@ <h1 id="Thought："><a href="#Thought：" class="headerlink" title="Thought：">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/dc8d7590.html b/post/dc8d7590.html
index 7f43d6512..84b790c02 100644
--- a/post/dc8d7590.html
+++ b/post/dc8d7590.html
@@ -628,7 +628,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/dce95dce.html b/post/dce95dce.html
index 45272f681..f978c6417 100644
--- a/post/dce95dce.html
+++ b/post/dce95dce.html
@@ -494,8 +494,8 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     </a>
   
   
-    <a href="/post/a5d1dfda.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">1124. The longest period of performance One question daily</div>
+    <a href="/post/80cafdc8.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">1017.Negative binary conversion</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -621,7 +621,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/de522cea.html b/post/de522cea.html
index f6b8e398d..d3ae707e9 100644
--- a/post/de522cea.html
+++ b/post/de522cea.html
@@ -640,7 +640,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/e03edda.html b/post/e03edda.html
index 33560282c..624223745 100644
--- a/post/e03edda.html
+++ b/post/e03edda.html
@@ -24,8 +24,8 @@
 <meta property="article:author" content="loong loong">
 <meta property="article:tag" content="Python">
 <meta property="article:tag" content="answer">
-<meta property="article:tag" content="golang">
 <meta property="article:tag" content="Dynamic planning">
+<meta property="article:tag" content="golang">
 <meta name="twitter:card" content="summary">
 <meta name="twitter:image" content="https://longsizhuo.github.io/assets/img/2023-02-01.png">
 
@@ -422,11 +422,11 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -501,11 +501,11 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     
 <nav id="article-nav">
   
-    <a href="/post/717042a6.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/16b0e9f1.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          217. Existing duplicate elements C++/Python3
+          219.Existing duplicate elements II Hash table graphics
         
       </div>
     </a>
@@ -638,7 +638,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/e14241e.html b/post/e14241e.html
index 4e9e7d1da..3e1e205af 100644
--- a/post/e14241e.html
+++ b/post/e14241e.html
@@ -654,7 +654,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/e2c9cca9.html b/post/e2c9cca9.html
index 758668309..303dd6c77 100644
--- a/post/e2c9cca9.html
+++ b/post/e2c9cca9.html
@@ -519,18 +519,18 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     
 <nav id="article-nav">
   
-    <a href="/post/435a9a0d.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/b2a927d5.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          1250. examine「Good array」 One question daily
+          1551. Make all the minimum operations of all elements in the array
         
       </div>
     </a>
   
   
-    <a href="/post/b2a927d5.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">1551. Make all the minimum operations of all elements in the array</div>
+    <a href="/post/59825e1f.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">1590.Make the array and energyPDivide</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -656,7 +656,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/e6227611.html b/post/e6227611.html
index aa68ae344..80d88745b 100644
--- a/post/e6227611.html
+++ b/post/e6227611.html
@@ -668,7 +668,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/eb193c1f.html b/post/eb193c1f.html
index 1ed102e0e..29d8da9a9 100644
--- a/post/eb193c1f.html
+++ b/post/eb193c1f.html
@@ -493,18 +493,18 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     
 <nav id="article-nav">
   
-    <a href="/post/6610c769.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/fd471847.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          1233Delete the subfolder folder One question daily
+          1138. The path on the letter board One question daily
         
       </div>
     </a>
   
   
-    <a href="/post/56d97dcf.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">1234. Replace the sub -string to get a balanced string One question daily</div>
+    <a href="/post/6610c769.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">1233Delete the subfolder folder One question daily</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -630,7 +630,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/ed19b576.html b/post/ed19b576.html
index 50bf20296..2a80fb9a5 100644
--- a/post/ed19b576.html
+++ b/post/ed19b576.html
@@ -619,7 +619,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/edc2b94.html b/post/edc2b94.html
index 47eac2c2b..1f05d11b3 100644
--- a/post/edc2b94.html
+++ b/post/edc2b94.html
@@ -394,7 +394,7 @@ <h3 id="Why-you-should-follow-me"><a href="#Why-you-should-follow-me" class="hea
 <li>I’m open to collaboration and feedback.</li>
 </ul>
 <h3 id="How-to-contact-me"><a href="#How-to-contact-me" class="headerlink" title="How to contact me"></a>How to contact me</h3><ul>
-<li>Email: <a href="mailto:&#x6c;&#111;&#110;&#103;&#115;&#105;&#x7a;&#104;&#x75;&#111;&#64;&#x67;&#x6d;&#x61;&#105;&#108;&#x2e;&#99;&#111;&#109;">&#x6c;&#111;&#110;&#103;&#115;&#105;&#x7a;&#104;&#x75;&#111;&#64;&#x67;&#x6d;&#x61;&#105;&#108;&#x2e;&#99;&#111;&#109;</a></li>
+<li>Email: <a href="mailto:&#x6c;&#111;&#x6e;&#103;&#x73;&#x69;&#x7a;&#104;&#117;&#x6f;&#64;&#103;&#x6d;&#97;&#x69;&#x6c;&#46;&#99;&#x6f;&#x6d;">&#x6c;&#111;&#x6e;&#103;&#x73;&#x69;&#x7a;&#104;&#117;&#x6f;&#64;&#103;&#x6d;&#97;&#x69;&#x6c;&#46;&#99;&#x6f;&#x6d;</a></li>
 <li>LinkedIn: <a target="_blank" rel="noopener" href="https://www.linkedin.com/in/longsizhuo/">Sizhuo Long</a></li>
 <li>XiaoHongShu(Small RedBook): <a target="_blank" rel="noopener" href="https://www.xiaohongshu.com/user/profile/5c0b8cc2000000000601e809">@sizhuo_long</a></li>
 </ul>
@@ -650,7 +650,7 @@ <h3 id="How-to-contact-me"><a href="#How-to-contact-me" class="headerlink" title
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/f0d96a1f.html b/post/f0d96a1f.html
index 29509b625..c377bc8d8 100644
--- a/post/f0d96a1f.html
+++ b/post/f0d96a1f.html
@@ -639,7 +639,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/f4b99a74.html b/post/f4b99a74.html
index 7ce40a4bc..ae2542da7 100644
--- a/post/f4b99a74.html
+++ b/post/f4b99a74.html
@@ -643,7 +643,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/f7c5db77.html b/post/f7c5db77.html
index a7e0898fd..b3de026e4 100644
--- a/post/f7c5db77.html
+++ b/post/f7c5db77.html
@@ -625,7 +625,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/f953c753.html b/post/f953c753.html
index fef35330a..ba83d0621 100644
--- a/post/f953c753.html
+++ b/post/f953c753.html
@@ -624,7 +624,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/fa9db6b8.html b/post/fa9db6b8.html
index 2dfb1d2fe..15fd87761 100644
--- a/post/fa9db6b8.html
+++ b/post/fa9db6b8.html
@@ -641,7 +641,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/fd471847.html b/post/fd471847.html
index db3769bee..36780469b 100644
--- a/post/fd471847.html
+++ b/post/fd471847.html
@@ -489,18 +489,18 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
     
 <nav id="article-nav">
   
-    <a href="/post/80cafdc8.html" id="article-nav-newer" class="article-nav-link-wrap">
+    <a href="/post/a5d1dfda.html" id="article-nav-newer" class="article-nav-link-wrap">
       <i class="icon-circle-left"></i>
       <div class="article-nav-title">
         
-          1017.Negative binary conversion
+          1124. The longest period of performance One question daily
         
       </div>
     </a>
   
   
-    <a href="/post/6610c769.html" id="article-nav-older" class="article-nav-link-wrap">
-      <div class="article-nav-title">1233Delete the subfolder folder One question daily</div>
+    <a href="/post/eb193c1f.html" id="article-nav-older" class="article-nav-link-wrap">
+      <div class="article-nav-title">1139. The greatest 1 Formation of the border  One question daily</div>
       <i class="icon-circle-right"></i>
     </a>
   
@@ -626,7 +626,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/post/fefe18d8.html b/post/fefe18d8.html
index c10347ea0..3dc96c936 100644
--- a/post/fefe18d8.html
+++ b/post/fefe18d8.html
@@ -622,7 +622,7 @@ <h1 id="Code："><a href="#Code：" class="headerlink" title="Code："></a>Code
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/sitemap.xml b/sitemap.xml
index 8e1855602..74d5a7efe 100644
--- a/sitemap.xml
+++ b/sitemap.xml
@@ -2,7 +2,7 @@
 <urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
   
   <url>
-    <loc>https://longsizhuo.github.io/post/ac786f6f.html</loc>
+    <loc>https://longsizhuo.github.io/post/becdc081.html</loc>
     
     <lastmod>2024-09-18</lastmod>
     
@@ -11,7 +11,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/becdc081.html</loc>
+    <loc>https://longsizhuo.github.io/post/ac786f6f.html</loc>
     
     <lastmod>2024-09-18</lastmod>
     
@@ -281,7 +281,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/a386fcdc.html</loc>
+    <loc>https://longsizhuo.github.io/post/2280b647.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -290,7 +290,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/2280b647.html</loc>
+    <loc>https://longsizhuo.github.io/post/a386fcdc.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -641,7 +641,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/e03edda.html</loc>
+    <loc>https://longsizhuo.github.io/post/16b0e9f1.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -650,7 +650,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/c3f7f59f.html</loc>
+    <loc>https://longsizhuo.github.io/post/e03edda.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -659,7 +659,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/16b0e9f1.html</loc>
+    <loc>https://longsizhuo.github.io/post/c3f7f59f.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -686,7 +686,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/3277549c.html</loc>
+    <loc>https://longsizhuo.github.io/post/6be57ef7.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -695,7 +695,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/6be57ef7.html</loc>
+    <loc>https://longsizhuo.github.io/post/3277549c.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -740,7 +740,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/d482ac75.html</loc>
+    <loc>https://longsizhuo.github.io/post/1978f474.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -749,7 +749,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/3667cd44.html</loc>
+    <loc>https://longsizhuo.github.io/post/d482ac75.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -758,7 +758,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/2f3e8e26.html</loc>
+    <loc>https://longsizhuo.github.io/post/3667cd44.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -767,7 +767,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/1978f474.html</loc>
+    <loc>https://longsizhuo.github.io/post/2f3e8e26.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -812,7 +812,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/e2c9cca9.html</loc>
+    <loc>https://longsizhuo.github.io/post/b2a927d5.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -821,7 +821,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/b2a927d5.html</loc>
+    <loc>https://longsizhuo.github.io/post/e2c9cca9.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -875,7 +875,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/a5d1dfda.html</loc>
+    <loc>https://longsizhuo.github.io/post/80cafdc8.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -884,7 +884,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/80cafdc8.html</loc>
+    <loc>https://longsizhuo.github.io/post/a5d1dfda.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -902,7 +902,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/6610c769.html</loc>
+    <loc>https://longsizhuo.github.io/post/eb193c1f.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -911,7 +911,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/post/eb193c1f.html</loc>
+    <loc>https://longsizhuo.github.io/post/6610c769.html</loc>
     
     <lastmod>2024-09-10</lastmod>
     
@@ -1046,7 +1046,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/html/Sichuan_Traveler/tj.html</loc>
+    <loc>https://longsizhuo.github.io/html/Sichuan_Traveler/system.html</loc>
     
     <lastmod>2023-07-27</lastmod>
     
@@ -1055,7 +1055,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/html/Sichuan_Traveler/system.html</loc>
+    <loc>https://longsizhuo.github.io/html/Sichuan_Traveler/tj.html</loc>
     
     <lastmod>2023-07-27</lastmod>
     
@@ -1064,7 +1064,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/html/Sichuan_Traveler/404.html</loc>
+    <loc>https://longsizhuo.github.io/html/Sichuan_Traveler/Mark_down_.html</loc>
     
     <lastmod>2023-07-27</lastmod>
     
@@ -1073,7 +1073,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/html/Sichuan_Traveler/Mark_down_.html</loc>
+    <loc>https://longsizhuo.github.io/html/Sichuan_Traveler/ad.html</loc>
     
     <lastmod>2023-07-27</lastmod>
     
@@ -1082,7 +1082,7 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/html/Sichuan_Traveler/ad.html</loc>
+    <loc>https://longsizhuo.github.io/html/Sichuan_Traveler/404.html</loc>
     
     <lastmod>2023-07-27</lastmod>
     
@@ -1192,21 +1192,21 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/tags/Linked/</loc>
+    <loc>https://longsizhuo.github.io/tags/Dynamic-planning/</loc>
     <lastmod>2024-09-18</lastmod>
     <changefreq>weekly</changefreq>
     <priority>0.2</priority>
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/tags/golang/</loc>
+    <loc>https://longsizhuo.github.io/tags/Linked/</loc>
     <lastmod>2024-09-18</lastmod>
     <changefreq>weekly</changefreq>
     <priority>0.2</priority>
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/tags/Dynamic-planning/</loc>
+    <loc>https://longsizhuo.github.io/tags/golang/</loc>
     <lastmod>2024-09-18</lastmod>
     <changefreq>weekly</changefreq>
     <priority>0.2</priority>
@@ -1514,21 +1514,21 @@
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/tags/front-end/</loc>
+    <loc>https://longsizhuo.github.io/tags/Composition-principle/</loc>
     <lastmod>2024-09-18</lastmod>
     <changefreq>weekly</changefreq>
     <priority>0.2</priority>
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/tags/Composition-principle/</loc>
+    <loc>https://longsizhuo.github.io/tags/encryption/</loc>
     <lastmod>2024-09-18</lastmod>
     <changefreq>weekly</changefreq>
     <priority>0.2</priority>
   </url>
   
   <url>
-    <loc>https://longsizhuo.github.io/tags/encryption/</loc>
+    <loc>https://longsizhuo.github.io/tags/front-end/</loc>
     <lastmod>2024-09-18</lastmod>
     <changefreq>weekly</changefreq>
     <priority>0.2</priority>
diff --git a/tags/Array/index.html b/tags/Array/index.html
index 5efc8382e..07c36b251 100644
--- a/tags/Array/index.html
+++ b/tags/Array/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Array/page/10/index.html b/tags/Array/page/10/index.html
index 550f8a667..d3b032ccd 100644
--- a/tags/Array/page/10/index.html
+++ b/tags/Array/page/10/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Array/page/11/index.html b/tags/Array/page/11/index.html
index 3b43f9af4..974f8e928 100644
--- a/tags/Array/page/11/index.html
+++ b/tags/Array/page/11/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Array/page/12/index.html b/tags/Array/page/12/index.html
index 23ab9cf00..f4f1fa047 100644
--- a/tags/Array/page/12/index.html
+++ b/tags/Array/page/12/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Array/page/13/index.html b/tags/Array/page/13/index.html
index cbd4bf5b2..9d7d3ea39 100644
--- a/tags/Array/page/13/index.html
+++ b/tags/Array/page/13/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Array/page/14/index.html b/tags/Array/page/14/index.html
index f187dca31..9dcdc8d9d 100644
--- a/tags/Array/page/14/index.html
+++ b/tags/Array/page/14/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Array/page/2/index.html b/tags/Array/page/2/index.html
index fe714bd44..69389b695 100644
--- a/tags/Array/page/2/index.html
+++ b/tags/Array/page/2/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Array/page/3/index.html b/tags/Array/page/3/index.html
index 87c3dcd41..14b496b35 100644
--- a/tags/Array/page/3/index.html
+++ b/tags/Array/page/3/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Array/page/4/index.html b/tags/Array/page/4/index.html
index 4dde4281b..04ea7e567 100644
--- a/tags/Array/page/4/index.html
+++ b/tags/Array/page/4/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Array/page/5/index.html b/tags/Array/page/5/index.html
index 22861dce0..6d97fc914 100644
--- a/tags/Array/page/5/index.html
+++ b/tags/Array/page/5/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Array/page/6/index.html b/tags/Array/page/6/index.html
index 2e2daa97e..ead1d655f 100644
--- a/tags/Array/page/6/index.html
+++ b/tags/Array/page/6/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Array/page/7/index.html b/tags/Array/page/7/index.html
index 9016a7a64..f009a0973 100644
--- a/tags/Array/page/7/index.html
+++ b/tags/Array/page/7/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Array/page/8/index.html b/tags/Array/page/8/index.html
index 520c2b4f8..537e9da95 100644
--- a/tags/Array/page/8/index.html
+++ b/tags/Array/page/8/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Array/page/9/index.html b/tags/Array/page/9/index.html
index 8a721979b..5f01be231 100644
--- a/tags/Array/page/9/index.html
+++ b/tags/Array/page/9/index.html
@@ -442,7 +442,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/BFS/index.html b/tags/BFS/index.html
index 78ea97e9d..45db3b14a 100644
--- a/tags/BFS/index.html
+++ b/tags/BFS/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Bilateral-queue/index.html b/tags/Bilateral-queue/index.html
index 14b856d70..a0b7d5427 100644
--- a/tags/Bilateral-queue/index.html
+++ b/tags/Bilateral-queue/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Binary-tree/index.html b/tags/Binary-tree/index.html
index f88ee33dd..8a3c3b418 100644
--- a/tags/Binary-tree/index.html
+++ b/tags/Binary-tree/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Binary-tree/page/2/index.html b/tags/Binary-tree/page/2/index.html
index 76ed3bd20..4a0e0e38f 100644
--- a/tags/Binary-tree/page/2/index.html
+++ b/tags/Binary-tree/page/2/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Binary-tree/page/3/index.html b/tags/Binary-tree/page/3/index.html
index 5efe483bc..69a669ab2 100644
--- a/tags/Binary-tree/page/3/index.html
+++ b/tags/Binary-tree/page/3/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Bit-operation/index.html b/tags/Bit-operation/index.html
index fb624103d..7d852c7f4 100644
--- a/tags/Bit-operation/index.html
+++ b/tags/Bit-operation/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Bit-operation/page/2/index.html b/tags/Bit-operation/page/2/index.html
index a3caff9cc..453497900 100644
--- a/tags/Bit-operation/page/2/index.html
+++ b/tags/Bit-operation/page/2/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Bit-operation/page/3/index.html b/tags/Bit-operation/page/3/index.html
index 18a79799d..01bae7a2f 100644
--- a/tags/Bit-operation/page/3/index.html
+++ b/tags/Bit-operation/page/3/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/C/index.html b/tags/C/index.html
index 90a26cb6a..9e70e831d 100644
--- a/tags/C/index.html
+++ b/tags/C/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/C/page/2/index.html b/tags/C/page/2/index.html
index dfedcff69..92373b7a7 100644
--- a/tags/C/page/2/index.html
+++ b/tags/C/page/2/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/C/page/3/index.html b/tags/C/page/3/index.html
index 45741af8d..d4c7836c3 100644
--- a/tags/C/page/3/index.html
+++ b/tags/C/page/3/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Composition-principle/index.html b/tags/Composition-principle/index.html
index eb1e4b5bd..78ae68171 100644
--- a/tags/Composition-principle/index.html
+++ b/tags/Composition-principle/index.html
@@ -410,7 +410,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Dictionary-tree/index.html b/tags/Dictionary-tree/index.html
index 868067aaf..e9d795732 100644
--- a/tags/Dictionary-tree/index.html
+++ b/tags/Dictionary-tree/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Double-pointer/index.html b/tags/Double-pointer/index.html
index 1af354a61..49a0cdd27 100644
--- a/tags/Double-pointer/index.html
+++ b/tags/Double-pointer/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Double-pointer/page/2/index.html b/tags/Double-pointer/page/2/index.html
index 83cf2885a..e4e617bb4 100644
--- a/tags/Double-pointer/page/2/index.html
+++ b/tags/Double-pointer/page/2/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Double-pointer/page/3/index.html b/tags/Double-pointer/page/3/index.html
index 86cdcf6b0..4a9f5febd 100644
--- a/tags/Double-pointer/page/3/index.html
+++ b/tags/Double-pointer/page/3/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Double-pointer/page/4/index.html b/tags/Double-pointer/page/4/index.html
index dc255f55b..10d25c299 100644
--- a/tags/Double-pointer/page/4/index.html
+++ b/tags/Double-pointer/page/4/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Dynamic-planning/index.html b/tags/Dynamic-planning/index.html
index 88b0c590a..956881b63 100644
--- a/tags/Dynamic-planning/index.html
+++ b/tags/Dynamic-planning/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Dynamic-planning/page/2/index.html b/tags/Dynamic-planning/page/2/index.html
index 665380904..2ee21ec34 100644
--- a/tags/Dynamic-planning/page/2/index.html
+++ b/tags/Dynamic-planning/page/2/index.html
@@ -348,11 +348,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Dynamic-planning/page/3/index.html b/tags/Dynamic-planning/page/3/index.html
index 9ec35d35a..c2db45ac0 100644
--- a/tags/Dynamic-planning/page/3/index.html
+++ b/tags/Dynamic-planning/page/3/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Dynamic-planning/page/4/index.html b/tags/Dynamic-planning/page/4/index.html
index 6c4d707be..0d433efa9 100644
--- a/tags/Dynamic-planning/page/4/index.html
+++ b/tags/Dynamic-planning/page/4/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Dynamic-planning/page/5/index.html b/tags/Dynamic-planning/page/5/index.html
index b652fdee0..bfc579a50 100644
--- a/tags/Dynamic-planning/page/5/index.html
+++ b/tags/Dynamic-planning/page/5/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Dynamic-planning/page/6/index.html b/tags/Dynamic-planning/page/6/index.html
index 76ffa3888..ca6189ce0 100644
--- a/tags/Dynamic-planning/page/6/index.html
+++ b/tags/Dynamic-planning/page/6/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Dynamic-planning/page/7/index.html b/tags/Dynamic-planning/page/7/index.html
index 4147b4d76..b50424526 100644
--- a/tags/Dynamic-planning/page/7/index.html
+++ b/tags/Dynamic-planning/page/7/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Fast-power/index.html b/tags/Fast-power/index.html
index c40a5a83b..c2fd1d8f8 100644
--- a/tags/Fast-power/index.html
+++ b/tags/Fast-power/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Graph-Theory/index.html b/tags/Graph-Theory/index.html
index f40c33a02..f98dd6460 100644
--- a/tags/Graph-Theory/index.html
+++ b/tags/Graph-Theory/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Hash-table/index.html b/tags/Hash-table/index.html
index b4a8a6cc3..17dc6c50f 100644
--- a/tags/Hash-table/index.html
+++ b/tags/Hash-table/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Hash-table/page/10/index.html b/tags/Hash-table/page/10/index.html
index fc87f6267..a2990ddb7 100644
--- a/tags/Hash-table/page/10/index.html
+++ b/tags/Hash-table/page/10/index.html
@@ -442,7 +442,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Hash-table/page/11/index.html b/tags/Hash-table/page/11/index.html
index bb68998f3..e7fba0605 100644
--- a/tags/Hash-table/page/11/index.html
+++ b/tags/Hash-table/page/11/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Hash-table/page/2/index.html b/tags/Hash-table/page/2/index.html
index 0a42a1798..ef2c123e7 100644
--- a/tags/Hash-table/page/2/index.html
+++ b/tags/Hash-table/page/2/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Hash-table/page/3/index.html b/tags/Hash-table/page/3/index.html
index ac39c87a5..c3b570429 100644
--- a/tags/Hash-table/page/3/index.html
+++ b/tags/Hash-table/page/3/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Hash-table/page/4/index.html b/tags/Hash-table/page/4/index.html
index 91d90bf70..323b14e96 100644
--- a/tags/Hash-table/page/4/index.html
+++ b/tags/Hash-table/page/4/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Hash-table/page/5/index.html b/tags/Hash-table/page/5/index.html
index 792746510..33400d207 100644
--- a/tags/Hash-table/page/5/index.html
+++ b/tags/Hash-table/page/5/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Hash-table/page/6/index.html b/tags/Hash-table/page/6/index.html
index 5266b1a41..d70e35d4b 100644
--- a/tags/Hash-table/page/6/index.html
+++ b/tags/Hash-table/page/6/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Hash-table/page/7/index.html b/tags/Hash-table/page/7/index.html
index 2c04acf7e..296041632 100644
--- a/tags/Hash-table/page/7/index.html
+++ b/tags/Hash-table/page/7/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Hash-table/page/8/index.html b/tags/Hash-table/page/8/index.html
index 3347a8f93..7d2914de0 100644
--- a/tags/Hash-table/page/8/index.html
+++ b/tags/Hash-table/page/8/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Hash-table/page/9/index.html b/tags/Hash-table/page/9/index.html
index 83fa26b5d..e5ebe0cd0 100644
--- a/tags/Hash-table/page/9/index.html
+++ b/tags/Hash-table/page/9/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/In-depth-priority-search/index.html b/tags/In-depth-priority-search/index.html
index b859e7525..e8d25fb68 100644
--- a/tags/In-depth-priority-search/index.html
+++ b/tags/In-depth-priority-search/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/In-depth-priority-search/page/2/index.html b/tags/In-depth-priority-search/page/2/index.html
index 000519f76..99688439e 100644
--- a/tags/In-depth-priority-search/page/2/index.html
+++ b/tags/In-depth-priority-search/page/2/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/In-depth-priority-search/page/3/index.html b/tags/In-depth-priority-search/page/3/index.html
index cfab21d3c..92163cf3f 100644
--- a/tags/In-depth-priority-search/page/3/index.html
+++ b/tags/In-depth-priority-search/page/3/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Linked/index.html b/tags/Linked/index.html
index 06cbff988..74d87023c 100644
--- a/tags/Linked/index.html
+++ b/tags/Linked/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Linked/page/2/index.html b/tags/Linked/page/2/index.html
index a4c6ac572..38a7e5f17 100644
--- a/tags/Linked/page/2/index.html
+++ b/tags/Linked/page/2/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Linked/page/3/index.html b/tags/Linked/page/3/index.html
index 6c188f2d0..16bc30a9c 100644
--- a/tags/Linked/page/3/index.html
+++ b/tags/Linked/page/3/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Linked/page/4/index.html b/tags/Linked/page/4/index.html
index 7daf956b4..e62ead5d5 100644
--- a/tags/Linked/page/4/index.html
+++ b/tags/Linked/page/4/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Memory-search/index.html b/tags/Memory-search/index.html
index 67fe10592..0f697490d 100644
--- a/tags/Memory-search/index.html
+++ b/tags/Memory-search/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Multiple-set/index.html b/tags/Multiple-set/index.html
index 822503298..7e93ae2ef 100644
--- a/tags/Multiple-set/index.html
+++ b/tags/Multiple-set/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/One-question-daily/index.html b/tags/One-question-daily/index.html
index 38c4bef20..da34cf5fe 100644
--- a/tags/One-question-daily/index.html
+++ b/tags/One-question-daily/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/One-question-daily/page/2/index.html b/tags/One-question-daily/page/2/index.html
index 4049fceaf..58195a705 100644
--- a/tags/One-question-daily/page/2/index.html
+++ b/tags/One-question-daily/page/2/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/d482ac75.html" class="archive-article-date">
+	      	<a href="/post/1978f474.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/d482ac75.html">1669. Merge two linked watches One question daily</a>
+      <a class="archive-article-title" href="/post/1978f474.html">1664. Number of schemes to generate balance numbers One question daily</a>
     </h2>
   
 
@@ -352,7 +352,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Linked</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
         		</li>
       		
 		</ul>
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/One-question-daily/page/3/index.html b/tags/One-question-daily/page/3/index.html
index 4086d12b1..1ac08b085 100644
--- a/tags/One-question-daily/page/3/index.html
+++ b/tags/One-question-daily/page/3/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/1978f474.html" class="archive-article-date">
+	      	<a href="/post/d482ac75.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/1978f474.html">1664. Number of schemes to generate balance numbers One question daily</a>
+      <a class="archive-article-title" href="/post/d482ac75.html">1669. Merge two linked watches One question daily</a>
     </h2>
   
 
@@ -352,7 +352,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Linked</a>
         		</li>
       		
 		</ul>
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/One-question-daily/page/4/index.html b/tags/One-question-daily/page/4/index.html
index 20cb846f9..f07d0b5ae 100644
--- a/tags/One-question-daily/page/4/index.html
+++ b/tags/One-question-daily/page/4/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/One-question-daily/page/5/index.html b/tags/One-question-daily/page/5/index.html
index e8ce7fe3c..225a5e64b 100644
--- a/tags/One-question-daily/page/5/index.html
+++ b/tags/One-question-daily/page/5/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/One-question-daily/page/6/index.html b/tags/One-question-daily/page/6/index.html
index 008637653..4d63bd98c 100644
--- a/tags/One-question-daily/page/6/index.html
+++ b/tags/One-question-daily/page/6/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/One-question-daily/page/7/index.html b/tags/One-question-daily/page/7/index.html
index 4018049ee..b5c0736bf 100644
--- a/tags/One-question-daily/page/7/index.html
+++ b/tags/One-question-daily/page/7/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Orderly-collection/index.html b/tags/Orderly-collection/index.html
index 5a929f577..3994cebb2 100644
--- a/tags/Orderly-collection/index.html
+++ b/tags/Orderly-collection/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Prefix-and/index.html b/tags/Prefix-and/index.html
index 056fd650f..64110d7e0 100644
--- a/tags/Prefix-and/index.html
+++ b/tags/Prefix-and/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Prefix-and/page/2/index.html b/tags/Prefix-and/page/2/index.html
index 064e20f2c..a672763a9 100644
--- a/tags/Prefix-and/page/2/index.html
+++ b/tags/Prefix-and/page/2/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Prefix-and/page/3/index.html b/tags/Prefix-and/page/3/index.html
index a401debb0..d4ed4691f 100644
--- a/tags/Prefix-and/page/3/index.html
+++ b/tags/Prefix-and/page/3/index.html
@@ -442,7 +442,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Priority-queue/index.html b/tags/Priority-queue/index.html
index 684b507ac..5bf496f95 100644
--- a/tags/Priority-queue/index.html
+++ b/tags/Priority-queue/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Priority-search/index.html b/tags/Priority-search/index.html
index be8e4acb5..02866e905 100644
--- a/tags/Priority-search/index.html
+++ b/tags/Priority-search/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Priority-search/page/2/index.html b/tags/Priority-search/page/2/index.html
index 760dc191d..f233bdfbd 100644
--- a/tags/Priority-search/page/2/index.html
+++ b/tags/Priority-search/page/2/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Priority-search/page/3/index.html b/tags/Priority-search/page/3/index.html
index 6282715ac..8586d4e65 100644
--- a/tags/Priority-search/page/3/index.html
+++ b/tags/Priority-search/page/3/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/index.html b/tags/Python/index.html
index 3dc284ff0..cce4d7977 100644
--- a/tags/Python/index.html
+++ b/tags/Python/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/10/index.html b/tags/Python/page/10/index.html
index 4841f955b..ff01d4122 100644
--- a/tags/Python/page/10/index.html
+++ b/tags/Python/page/10/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/6610c769.html" class="archive-article-date">
+	      	<a href="/post/eb193c1f.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/6610c769.html">1233Delete the subfolder folder One question daily</a>
+      <a class="archive-article-title" href="/post/eb193c1f.html">1139. The greatest 1 Formation of the border  One question daily</a>
     </h2>
   
 
@@ -348,7 +348,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Dictionary tree</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
         		</li>
       		
 		</ul>
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/100/index.html b/tags/Python/page/100/index.html
index 92e2fc80f..feeea1e54 100644
--- a/tags/Python/page/100/index.html
+++ b/tags/Python/page/100/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/11/index.html b/tags/Python/page/11/index.html
index 3cf821573..54c86a389 100644
--- a/tags/Python/page/11/index.html
+++ b/tags/Python/page/11/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/eb193c1f.html" class="archive-article-date">
+	      	<a href="/post/6610c769.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/eb193c1f.html">1139. The greatest 1 Formation of the border  One question daily</a>
+      <a class="archive-article-title" href="/post/6610c769.html">1233Delete the subfolder folder One question daily</a>
     </h2>
   
 
@@ -348,7 +348,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Dictionary tree</a>
         		</li>
       		
 		</ul>
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/12/index.html b/tags/Python/page/12/index.html
index 1186a62f8..17ceb327e 100644
--- a/tags/Python/page/12/index.html
+++ b/tags/Python/page/12/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/13/index.html b/tags/Python/page/13/index.html
index 4d96795b8..1dedcb896 100644
--- a/tags/Python/page/13/index.html
+++ b/tags/Python/page/13/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/14/index.html b/tags/Python/page/14/index.html
index 69cbeb46c..3822f4290 100644
--- a/tags/Python/page/14/index.html
+++ b/tags/Python/page/14/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/15/index.html b/tags/Python/page/15/index.html
index dc3c20fbb..2f3a44504 100644
--- a/tags/Python/page/15/index.html
+++ b/tags/Python/page/15/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/e2c9cca9.html" class="archive-article-date">
+	      	<a href="/post/b2a927d5.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/e2c9cca9.html">142.Ring linkedII</a>
+      <a class="archive-article-title" href="/post/b2a927d5.html">1551. Make all the minimum operations of all elements in the array</a>
     </h2>
   
 
@@ -346,6 +346,10 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
+        		</li>
       		
 		</ul>
 	</div>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/16/index.html b/tags/Python/page/16/index.html
index 09b16796c..127d8f6aa 100644
--- a/tags/Python/page/16/index.html
+++ b/tags/Python/page/16/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/b2a927d5.html" class="archive-article-date">
+	      	<a href="/post/e2c9cca9.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/b2a927d5.html">1551. Make all the minimum operations of all elements in the array</a>
+      <a class="archive-article-title" href="/post/e2c9cca9.html">142.Ring linkedII</a>
     </h2>
   
 
@@ -346,10 +346,6 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
-        		</li>
       		
 		</ul>
 	</div>
@@ -422,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/17/index.html b/tags/Python/page/17/index.html
index 05cba7028..86f793872 100644
--- a/tags/Python/page/17/index.html
+++ b/tags/Python/page/17/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/18/index.html b/tags/Python/page/18/index.html
index aa24c2955..575d9c553 100644
--- a/tags/Python/page/18/index.html
+++ b/tags/Python/page/18/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/19/index.html b/tags/Python/page/19/index.html
index a61e804fe..5ce80d17d 100644
--- a/tags/Python/page/19/index.html
+++ b/tags/Python/page/19/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/2/index.html b/tags/Python/page/2/index.html
index 38914a032..41544ec25 100644
--- a/tags/Python/page/2/index.html
+++ b/tags/Python/page/2/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/20/index.html b/tags/Python/page/20/index.html
index 7cce51acc..15afd2d74 100644
--- a/tags/Python/page/20/index.html
+++ b/tags/Python/page/20/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/21/index.html b/tags/Python/page/21/index.html
index 36814d463..2c39b174d 100644
--- a/tags/Python/page/21/index.html
+++ b/tags/Python/page/21/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/d482ac75.html" class="archive-article-date">
+	      	<a href="/post/1978f474.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/d482ac75.html">1669. Merge two linked watches One question daily</a>
+      <a class="archive-article-title" href="/post/1978f474.html">1664. Number of schemes to generate balance numbers One question daily</a>
     </h2>
   
 
@@ -352,7 +352,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Linked</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
         		</li>
       		
 		</ul>
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/22/index.html b/tags/Python/page/22/index.html
index 47028290c..2d56b6e62 100644
--- a/tags/Python/page/22/index.html
+++ b/tags/Python/page/22/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/3667cd44.html" class="archive-article-date">
+	      	<a href="/post/d482ac75.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/3667cd44.html">1798You can construct the maximum number of continuity One question daily</a>
+      <a class="archive-article-title" href="/post/d482ac75.html">1669. Merge two linked watches One question daily</a>
     </h2>
   
 
@@ -348,7 +348,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">One question daily</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Linked</a>
         		</li>
       		
 		</ul>
@@ -422,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/23/index.html b/tags/Python/page/23/index.html
index 956dd90fa..e50a6d7c4 100644
--- a/tags/Python/page/23/index.html
+++ b/tags/Python/page/23/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/2f3e8e26.html" class="archive-article-date">
+	      	<a href="/post/3667cd44.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/2f3e8e26.html">1801-1803 Liech buckle novice！</a>
+      <a class="archive-article-title" href="/post/3667cd44.html">1798You can construct the maximum number of continuity One question daily</a>
     </h2>
   
 
@@ -344,7 +344,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/24/index.html b/tags/Python/page/24/index.html
index c33e41b9c..887fa4860 100644
--- a/tags/Python/page/24/index.html
+++ b/tags/Python/page/24/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/1978f474.html" class="archive-article-date">
+	      	<a href="/post/2f3e8e26.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/1978f474.html">1664. Number of schemes to generate balance numbers One question daily</a>
+      <a class="archive-article-title" href="/post/2f3e8e26.html">1801-1803 Liech buckle novice！</a>
     </h2>
   
 
@@ -344,15 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">One question daily</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -426,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/25/index.html b/tags/Python/page/25/index.html
index b925ec7ea..adcc473ec 100644
--- a/tags/Python/page/25/index.html
+++ b/tags/Python/page/25/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/26/index.html b/tags/Python/page/26/index.html
index 13d2ac805..9e5ca28ca 100644
--- a/tags/Python/page/26/index.html
+++ b/tags/Python/page/26/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/27/index.html b/tags/Python/page/27/index.html
index c5e333a23..1cc3eb64a 100644
--- a/tags/Python/page/27/index.html
+++ b/tags/Python/page/27/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/28/index.html b/tags/Python/page/28/index.html
index b30cf39ef..f0cba8dbe 100644
--- a/tags/Python/page/28/index.html
+++ b/tags/Python/page/28/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/29/index.html b/tags/Python/page/29/index.html
index 9d8c19843..eb5bd5727 100644
--- a/tags/Python/page/29/index.html
+++ b/tags/Python/page/29/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/3/index.html b/tags/Python/page/3/index.html
index 6d7e8e2e7..19c719f13 100644
--- a/tags/Python/page/3/index.html
+++ b/tags/Python/page/3/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/30/index.html b/tags/Python/page/30/index.html
index 0ae6716b5..ffb5cdd7e 100644
--- a/tags/Python/page/30/index.html
+++ b/tags/Python/page/30/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/3277549c.html" class="archive-article-date">
+	      	<a href="/post/6be57ef7.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/3277549c.html">1828. Statistics the number of a circle mid -point One question daily</a>
+      <a class="archive-article-title" href="/post/6be57ef7.html">1825. Seek out MK average value</a>
     </h2>
   
 
@@ -344,11 +344,15 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">unsolved</a>
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">difficulty</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color3">Multiple set</a>
         		</li>
       		
 		</ul>
@@ -422,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/31/index.html b/tags/Python/page/31/index.html
index 74251c052..07c7564be 100644
--- a/tags/Python/page/31/index.html
+++ b/tags/Python/page/31/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/6be57ef7.html" class="archive-article-date">
+	      	<a href="/post/3277549c.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/6be57ef7.html">1825. Seek out MK average value</a>
+      <a class="archive-article-title" href="/post/3277549c.html">1828. Statistics the number of a circle mid -point One question daily</a>
     </h2>
   
 
@@ -344,15 +344,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">unsolved</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">difficulty</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color3">Multiple set</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
         		</li>
       		
 		</ul>
@@ -426,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/32/index.html b/tags/Python/page/32/index.html
index a99cbb8ed..581c1b8b0 100644
--- a/tags/Python/page/32/index.html
+++ b/tags/Python/page/32/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/33/index.html b/tags/Python/page/33/index.html
index 3e66c457a..d072dcf80 100644
--- a/tags/Python/page/33/index.html
+++ b/tags/Python/page/33/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/34/index.html b/tags/Python/page/34/index.html
index a2ee9d845..2453d37f8 100644
--- a/tags/Python/page/34/index.html
+++ b/tags/Python/page/34/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/35/index.html b/tags/Python/page/35/index.html
index 070dfd1cc..29b7a1b02 100644
--- a/tags/Python/page/35/index.html
+++ b/tags/Python/page/35/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/36/index.html b/tags/Python/page/36/index.html
index d61b78f55..3f6d160d9 100644
--- a/tags/Python/page/36/index.html
+++ b/tags/Python/page/36/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/37/index.html b/tags/Python/page/37/index.html
index b341a67fb..a1dc50a05 100644
--- a/tags/Python/page/37/index.html
+++ b/tags/Python/page/37/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/e03edda.html" class="archive-article-date">
+	      	<a href="/post/16b0e9f1.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/e03edda.html">221Maximum square</a>
+      <a class="archive-article-title" href="/post/16b0e9f1.html">219.Existing duplicate elements II Hash table graphics</a>
     </h2>
   
 
@@ -344,15 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">solved</a>
         		</li>
       		
 		</ul>
@@ -426,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/38/index.html b/tags/Python/page/38/index.html
index c63d76ab9..d71945ed3 100644
--- a/tags/Python/page/38/index.html
+++ b/tags/Python/page/38/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/c3f7f59f.html" class="archive-article-date">
+	      	<a href="/post/e03edda.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/c3f7f59f.html">One question daily 2283</a>
+      <a class="archive-article-title" href="/post/e03edda.html">221Maximum square</a>
     </h2>
   
 
@@ -344,7 +344,15 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -418,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/39/index.html b/tags/Python/page/39/index.html
index 1cd6a3f79..9dd721025 100644
--- a/tags/Python/page/39/index.html
+++ b/tags/Python/page/39/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/16b0e9f1.html" class="archive-article-date">
+	      	<a href="/post/c3f7f59f.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/16b0e9f1.html">219.Existing duplicate elements II Hash table graphics</a>
+      <a class="archive-article-title" href="/post/c3f7f59f.html">One question daily 2283</a>
     </h2>
   
 
@@ -344,7 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">solved</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/4/index.html b/tags/Python/page/4/index.html
index 0f58f462b..954c79bde 100644
--- a/tags/Python/page/4/index.html
+++ b/tags/Python/page/4/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/40/index.html b/tags/Python/page/40/index.html
index 3a8e6d9d5..e7616b47b 100644
--- a/tags/Python/page/40/index.html
+++ b/tags/Python/page/40/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/7ded25bb.html" class="archive-article-date">
+	      	<a href="/post/9df6242c.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/7ded25bb.html">One question daily 2299. Code inspection device II</a>
+      <a class="archive-article-title" href="/post/9df6242c.html">One question daily 2293. Great mini game</a>
     </h2>
   
 
@@ -344,11 +344,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">Bit operation</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
         		</li>
       		
 		</ul>
@@ -422,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/41/index.html b/tags/Python/page/41/index.html
index 10a21687b..5ae629a76 100644
--- a/tags/Python/page/41/index.html
+++ b/tags/Python/page/41/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/9df6242c.html" class="archive-article-date">
+	      	<a href="/post/7ded25bb.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/9df6242c.html">One question daily 2293. Great mini game</a>
+      <a class="archive-article-title" href="/post/7ded25bb.html">One question daily 2299. Code inspection device II</a>
     </h2>
   
 
@@ -344,7 +344,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">solved,answer</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">Bit operation</a>
         		</li>
       		
 		</ul>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/42/index.html b/tags/Python/page/42/index.html
index ed2830a21..c1931af77 100644
--- a/tags/Python/page/42/index.html
+++ b/tags/Python/page/42/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/43/index.html b/tags/Python/page/43/index.html
index 88d302d9e..5d867a19c 100644
--- a/tags/Python/page/43/index.html
+++ b/tags/Python/page/43/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/44/index.html b/tags/Python/page/44/index.html
index fd47d6ea3..58731906c 100644
--- a/tags/Python/page/44/index.html
+++ b/tags/Python/page/44/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/45/index.html b/tags/Python/page/45/index.html
index 69686e8ac..91763242b 100644
--- a/tags/Python/page/45/index.html
+++ b/tags/Python/page/45/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/46/index.html b/tags/Python/page/46/index.html
index a8c3b77c2..8bead6d86 100644
--- a/tags/Python/page/46/index.html
+++ b/tags/Python/page/46/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/47/index.html b/tags/Python/page/47/index.html
index e3d089ac8..c423ceb2a 100644
--- a/tags/Python/page/47/index.html
+++ b/tags/Python/page/47/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/48/index.html b/tags/Python/page/48/index.html
index e448d478a..04e6811c9 100644
--- a/tags/Python/page/48/index.html
+++ b/tags/Python/page/48/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/49/index.html b/tags/Python/page/49/index.html
index 0c1045f2d..ba4e678e3 100644
--- a/tags/Python/page/49/index.html
+++ b/tags/Python/page/49/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/5/index.html b/tags/Python/page/5/index.html
index 2dfde2ad3..91e74d49c 100644
--- a/tags/Python/page/5/index.html
+++ b/tags/Python/page/5/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/50/index.html b/tags/Python/page/50/index.html
index f44259138..6f564c77b 100644
--- a/tags/Python/page/50/index.html
+++ b/tags/Python/page/50/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/51/index.html b/tags/Python/page/51/index.html
index 5c4b07a77..e02258429 100644
--- a/tags/Python/page/51/index.html
+++ b/tags/Python/page/51/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/52/index.html b/tags/Python/page/52/index.html
index f34df235b..569f4076e 100644
--- a/tags/Python/page/52/index.html
+++ b/tags/Python/page/52/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/53/index.html b/tags/Python/page/53/index.html
index 2809b2f25..91469faa1 100644
--- a/tags/Python/page/53/index.html
+++ b/tags/Python/page/53/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/54/index.html b/tags/Python/page/54/index.html
index e252ad310..3928f013a 100644
--- a/tags/Python/page/54/index.html
+++ b/tags/Python/page/54/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/55/index.html b/tags/Python/page/55/index.html
index 174d8d1a2..f38fb0caa 100644
--- a/tags/Python/page/55/index.html
+++ b/tags/Python/page/55/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/56/index.html b/tags/Python/page/56/index.html
index fd6395081..49a5d3075 100644
--- a/tags/Python/page/56/index.html
+++ b/tags/Python/page/56/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/57/index.html b/tags/Python/page/57/index.html
index bd5c64fdf..e6fdba35a 100644
--- a/tags/Python/page/57/index.html
+++ b/tags/Python/page/57/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/58/index.html b/tags/Python/page/58/index.html
index c07ab871a..e0e88607d 100644
--- a/tags/Python/page/58/index.html
+++ b/tags/Python/page/58/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/59/index.html b/tags/Python/page/59/index.html
index 0dafbd985..9158ad182 100644
--- a/tags/Python/page/59/index.html
+++ b/tags/Python/page/59/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/6/index.html b/tags/Python/page/6/index.html
index edda9c0eb..e922ef7f0 100644
--- a/tags/Python/page/6/index.html
+++ b/tags/Python/page/6/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/60/index.html b/tags/Python/page/60/index.html
index 88cfdc60b..fe9c3ef46 100644
--- a/tags/Python/page/60/index.html
+++ b/tags/Python/page/60/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/61/index.html b/tags/Python/page/61/index.html
index 8f1f6c934..3aa2c10b9 100644
--- a/tags/Python/page/61/index.html
+++ b/tags/Python/page/61/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/62/index.html b/tags/Python/page/62/index.html
index d3f95fc7f..b19c51e53 100644
--- a/tags/Python/page/62/index.html
+++ b/tags/Python/page/62/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/63/index.html b/tags/Python/page/63/index.html
index a54fdbbc9..7206aae4d 100644
--- a/tags/Python/page/63/index.html
+++ b/tags/Python/page/63/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/64/index.html b/tags/Python/page/64/index.html
index b2e024676..4a841cc6d 100644
--- a/tags/Python/page/64/index.html
+++ b/tags/Python/page/64/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/65/index.html b/tags/Python/page/65/index.html
index 06ead5b23..9ed792eb2 100644
--- a/tags/Python/page/65/index.html
+++ b/tags/Python/page/65/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/66/index.html b/tags/Python/page/66/index.html
index e296d9ef1..22f36caef 100644
--- a/tags/Python/page/66/index.html
+++ b/tags/Python/page/66/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/67/index.html b/tags/Python/page/67/index.html
index ccb2ec7f6..ec68b542a 100644
--- a/tags/Python/page/67/index.html
+++ b/tags/Python/page/67/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/68/index.html b/tags/Python/page/68/index.html
index 405a750b6..31b779f3f 100644
--- a/tags/Python/page/68/index.html
+++ b/tags/Python/page/68/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/69/index.html b/tags/Python/page/69/index.html
index 88de6913d..e8793d93c 100644
--- a/tags/Python/page/69/index.html
+++ b/tags/Python/page/69/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/7/index.html b/tags/Python/page/7/index.html
index 4ebc01d78..0985e7355 100644
--- a/tags/Python/page/7/index.html
+++ b/tags/Python/page/7/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/a5d1dfda.html" class="archive-article-date">
+	      	<a href="/post/80cafdc8.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/a5d1dfda.html">1124. The longest period of performance One question daily</a>
+      <a class="archive-article-title" href="/post/80cafdc8.html">1017.Negative binary conversion</a>
     </h2>
   
 
@@ -346,10 +346,6 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
-        		</li>
       		
 		</ul>
 	</div>
@@ -422,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/70/index.html b/tags/Python/page/70/index.html
index 433e607b5..35e85f431 100644
--- a/tags/Python/page/70/index.html
+++ b/tags/Python/page/70/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/71/index.html b/tags/Python/page/71/index.html
index eddc918ec..3e2e24f0b 100644
--- a/tags/Python/page/71/index.html
+++ b/tags/Python/page/71/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/72/index.html b/tags/Python/page/72/index.html
index 828f39452..c403c6780 100644
--- a/tags/Python/page/72/index.html
+++ b/tags/Python/page/72/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/73/index.html b/tags/Python/page/73/index.html
index b276aca07..940644def 100644
--- a/tags/Python/page/73/index.html
+++ b/tags/Python/page/73/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/74/index.html b/tags/Python/page/74/index.html
index 7ea5a586f..df95c5b64 100644
--- a/tags/Python/page/74/index.html
+++ b/tags/Python/page/74/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/75/index.html b/tags/Python/page/75/index.html
index 4bcf3048a..f71008456 100644
--- a/tags/Python/page/75/index.html
+++ b/tags/Python/page/75/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/76/index.html b/tags/Python/page/76/index.html
index 74fe4b0bc..b4fe45bcb 100644
--- a/tags/Python/page/76/index.html
+++ b/tags/Python/page/76/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/77/index.html b/tags/Python/page/77/index.html
index 0eef93ad8..e5fb58305 100644
--- a/tags/Python/page/77/index.html
+++ b/tags/Python/page/77/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/78/index.html b/tags/Python/page/78/index.html
index 176e50309..b684915cf 100644
--- a/tags/Python/page/78/index.html
+++ b/tags/Python/page/78/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/79/index.html b/tags/Python/page/79/index.html
index 17450ac8d..8dd0b7b26 100644
--- a/tags/Python/page/79/index.html
+++ b/tags/Python/page/79/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/8/index.html b/tags/Python/page/8/index.html
index 4d7333e12..ab804afc2 100644
--- a/tags/Python/page/8/index.html
+++ b/tags/Python/page/8/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/80cafdc8.html" class="archive-article-date">
+	      	<a href="/post/a5d1dfda.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/80cafdc8.html">1017.Negative binary conversion</a>
+      <a class="archive-article-title" href="/post/a5d1dfda.html">1124. The longest period of performance One question daily</a>
     </h2>
   
 
@@ -346,6 +346,10 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
+        		</li>
       		
 		</ul>
 	</div>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/80/index.html b/tags/Python/page/80/index.html
index fa4978413..84eafef8a 100644
--- a/tags/Python/page/80/index.html
+++ b/tags/Python/page/80/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/81/index.html b/tags/Python/page/81/index.html
index 7890d1d49..45f329b35 100644
--- a/tags/Python/page/81/index.html
+++ b/tags/Python/page/81/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/82/index.html b/tags/Python/page/82/index.html
index e885927a4..6631ac6bf 100644
--- a/tags/Python/page/82/index.html
+++ b/tags/Python/page/82/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/83/index.html b/tags/Python/page/83/index.html
index 3908ce709..a6f7e9e4e 100644
--- a/tags/Python/page/83/index.html
+++ b/tags/Python/page/83/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/84/index.html b/tags/Python/page/84/index.html
index 06efe9e03..ab02e6046 100644
--- a/tags/Python/page/84/index.html
+++ b/tags/Python/page/84/index.html
@@ -442,7 +442,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/85/index.html b/tags/Python/page/85/index.html
index 61dc62693..5311359f7 100644
--- a/tags/Python/page/85/index.html
+++ b/tags/Python/page/85/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/86/index.html b/tags/Python/page/86/index.html
index ee79126a8..8dd424932 100644
--- a/tags/Python/page/86/index.html
+++ b/tags/Python/page/86/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/87/index.html b/tags/Python/page/87/index.html
index 7b3f448ea..48669ff8c 100644
--- a/tags/Python/page/87/index.html
+++ b/tags/Python/page/87/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/88/index.html b/tags/Python/page/88/index.html
index b0eee6107..1557c302f 100644
--- a/tags/Python/page/88/index.html
+++ b/tags/Python/page/88/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/89/index.html b/tags/Python/page/89/index.html
index 16758cb0f..c603139dc 100644
--- a/tags/Python/page/89/index.html
+++ b/tags/Python/page/89/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/9/index.html b/tags/Python/page/9/index.html
index f67bb07b0..1c7ab1909 100644
--- a/tags/Python/page/9/index.html
+++ b/tags/Python/page/9/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/90/index.html b/tags/Python/page/90/index.html
index 73fd040ff..eb585a1f9 100644
--- a/tags/Python/page/90/index.html
+++ b/tags/Python/page/90/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/91/index.html b/tags/Python/page/91/index.html
index 8c47771d1..bf7cd013b 100644
--- a/tags/Python/page/91/index.html
+++ b/tags/Python/page/91/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/92/index.html b/tags/Python/page/92/index.html
index 334699b30..a96b9e465 100644
--- a/tags/Python/page/92/index.html
+++ b/tags/Python/page/92/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/93/index.html b/tags/Python/page/93/index.html
index 3980aabc4..4c4343660 100644
--- a/tags/Python/page/93/index.html
+++ b/tags/Python/page/93/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/94/index.html b/tags/Python/page/94/index.html
index a25f4b795..07c0c05ef 100644
--- a/tags/Python/page/94/index.html
+++ b/tags/Python/page/94/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/95/index.html b/tags/Python/page/95/index.html
index d59203a7e..43c452362 100644
--- a/tags/Python/page/95/index.html
+++ b/tags/Python/page/95/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/96/index.html b/tags/Python/page/96/index.html
index bdc0f68e9..4173a4e5c 100644
--- a/tags/Python/page/96/index.html
+++ b/tags/Python/page/96/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/97/index.html b/tags/Python/page/97/index.html
index b6ffcff36..8e2920363 100644
--- a/tags/Python/page/97/index.html
+++ b/tags/Python/page/97/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/98/index.html b/tags/Python/page/98/index.html
index a8ab5284e..7c933b27b 100644
--- a/tags/Python/page/98/index.html
+++ b/tags/Python/page/98/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Python/page/99/index.html b/tags/Python/page/99/index.html
index 4a69ca8bb..8fc676ddb 100644
--- a/tags/Python/page/99/index.html
+++ b/tags/Python/page/99/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Sort/index.html b/tags/Sort/index.html
index 8698935ee..698e12676 100644
--- a/tags/Sort/index.html
+++ b/tags/Sort/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Sort/page/2/index.html b/tags/Sort/page/2/index.html
index 82e1153f4..f7df4992a 100644
--- a/tags/Sort/page/2/index.html
+++ b/tags/Sort/page/2/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Sort/page/3/index.html b/tags/Sort/page/3/index.html
index 5a6872b0e..43e448964 100644
--- a/tags/Sort/page/3/index.html
+++ b/tags/Sort/page/3/index.html
@@ -442,7 +442,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Stack/index.html b/tags/Stack/index.html
index 26555ed52..648bc5f26 100644
--- a/tags/Stack/index.html
+++ b/tags/Stack/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/String/index.html b/tags/String/index.html
index e2af2960b..eea93ed93 100644
--- a/tags/String/index.html
+++ b/tags/String/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/String/page/2/index.html b/tags/String/page/2/index.html
index ae2bf91b8..fd87ef437 100644
--- a/tags/String/page/2/index.html
+++ b/tags/String/page/2/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Thread-tree/index.html b/tags/Thread-tree/index.html
index 11ad3b114..b8e9ab831 100644
--- a/tags/Thread-tree/index.html
+++ b/tags/Thread-tree/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Topology/index.html b/tags/Topology/index.html
index 4b1423aef..6f12492fb 100644
--- a/tags/Topology/index.html
+++ b/tags/Topology/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Tree-array/index.html b/tags/Tree-array/index.html
index 62d433e63..1a94bddae 100644
--- a/tags/Tree-array/index.html
+++ b/tags/Tree-array/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Tree/index.html b/tags/Tree/index.html
index dce9448c8..3d3600881 100644
--- a/tags/Tree/index.html
+++ b/tags/Tree/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Tutorial/index.html b/tags/Tutorial/index.html
index 707ef5dbd..b837fefea 100644
--- a/tags/Tutorial/index.html
+++ b/tags/Tutorial/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Tutorial/page/2/index.html b/tags/Tutorial/page/2/index.html
index 00dbccad3..270925d93 100644
--- a/tags/Tutorial/page/2/index.html
+++ b/tags/Tutorial/page/2/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Two-point-search/index.html b/tags/Two-point-search/index.html
index 02930d22e..c516de84e 100644
--- a/tags/Two-point-search/index.html
+++ b/tags/Two-point-search/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/Weekly/index.html b/tags/Weekly/index.html
index 974f51f1c..2e2a507c9 100644
--- a/tags/Weekly/index.html
+++ b/tags/Weekly/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/index.html b/tags/answer/index.html
index 25dcfc8a4..fd8414618 100644
--- a/tags/answer/index.html
+++ b/tags/answer/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/10/index.html b/tags/answer/page/10/index.html
index 3e2b5cbc5..4eb2ef5cb 100644
--- a/tags/answer/page/10/index.html
+++ b/tags/answer/page/10/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/e2c9cca9.html" class="archive-article-date">
+	      	<a href="/post/b2a927d5.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/e2c9cca9.html">142.Ring linkedII</a>
+      <a class="archive-article-title" href="/post/b2a927d5.html">1551. Make all the minimum operations of all elements in the array</a>
     </h2>
   
 
@@ -346,6 +346,10 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
+        		</li>
       		
 		</ul>
 	</div>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/11/index.html b/tags/answer/page/11/index.html
index 216b45c6b..6ccda0276 100644
--- a/tags/answer/page/11/index.html
+++ b/tags/answer/page/11/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/b2a927d5.html" class="archive-article-date">
+	      	<a href="/post/e2c9cca9.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/b2a927d5.html">1551. Make all the minimum operations of all elements in the array</a>
+      <a class="archive-article-title" href="/post/e2c9cca9.html">142.Ring linkedII</a>
     </h2>
   
 
@@ -346,10 +346,6 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color5">math</a>
-        		</li>
       		
 		</ul>
 	</div>
@@ -422,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/12/index.html b/tags/answer/page/12/index.html
index 9bc7290ee..14fc5b7da 100644
--- a/tags/answer/page/12/index.html
+++ b/tags/answer/page/12/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/13/index.html b/tags/answer/page/13/index.html
index f728c9279..9499c35ac 100644
--- a/tags/answer/page/13/index.html
+++ b/tags/answer/page/13/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/14/index.html b/tags/answer/page/14/index.html
index 3a3f1dab6..8f25a912d 100644
--- a/tags/answer/page/14/index.html
+++ b/tags/answer/page/14/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/15/index.html b/tags/answer/page/15/index.html
index d5d7206fc..3aa71c6c3 100644
--- a/tags/answer/page/15/index.html
+++ b/tags/answer/page/15/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/16/index.html b/tags/answer/page/16/index.html
index e4620d78a..0f3b1ab18 100644
--- a/tags/answer/page/16/index.html
+++ b/tags/answer/page/16/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/d482ac75.html" class="archive-article-date">
+	      	<a href="/post/1978f474.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/d482ac75.html">1669. Merge two linked watches One question daily</a>
+      <a class="archive-article-title" href="/post/1978f474.html">1664. Number of schemes to generate balance numbers One question daily</a>
     </h2>
   
 
@@ -352,7 +352,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Linked</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
         		</li>
       		
 		</ul>
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/17/index.html b/tags/answer/page/17/index.html
index 4356567e2..a6f3d32b5 100644
--- a/tags/answer/page/17/index.html
+++ b/tags/answer/page/17/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/3667cd44.html" class="archive-article-date">
+	      	<a href="/post/d482ac75.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/3667cd44.html">1798You can construct the maximum number of continuity One question daily</a>
+      <a class="archive-article-title" href="/post/d482ac75.html">1669. Merge two linked watches One question daily</a>
     </h2>
   
 
@@ -348,7 +348,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">One question daily</a>
+        		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Linked</a>
         		</li>
       		
 		</ul>
@@ -422,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/18/index.html b/tags/answer/page/18/index.html
index 115607059..0fc867e9a 100644
--- a/tags/answer/page/18/index.html
+++ b/tags/answer/page/18/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/1978f474.html" class="archive-article-date">
+	      	<a href="/post/3667cd44.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/1978f474.html">1664. Number of schemes to generate balance numbers One question daily</a>
+      <a class="archive-article-title" href="/post/3667cd44.html">1798You can construct the maximum number of continuity One question daily</a>
     </h2>
   
 
@@ -348,11 +348,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color4">One question daily</a>
-        		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -426,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/19/index.html b/tags/answer/page/19/index.html
index 2f9b07629..b56671274 100644
--- a/tags/answer/page/19/index.html
+++ b/tags/answer/page/19/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/2/index.html b/tags/answer/page/2/index.html
index 37955e45f..f0de3b2be 100644
--- a/tags/answer/page/2/index.html
+++ b/tags/answer/page/2/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/a5d1dfda.html" class="archive-article-date">
+	      	<a href="/post/80cafdc8.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/a5d1dfda.html">1124. The longest period of performance One question daily</a>
+      <a class="archive-article-title" href="/post/80cafdc8.html">1017.Negative binary conversion</a>
     </h2>
   
 
@@ -346,10 +346,6 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
-      		 
-        		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
-        		</li>
       		
 		</ul>
 	</div>
@@ -422,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/20/index.html b/tags/answer/page/20/index.html
index 48fda1303..5781df074 100644
--- a/tags/answer/page/20/index.html
+++ b/tags/answer/page/20/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/21/index.html b/tags/answer/page/21/index.html
index bf851cb68..1b3220b40 100644
--- a/tags/answer/page/21/index.html
+++ b/tags/answer/page/21/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/22/index.html b/tags/answer/page/22/index.html
index 1d74e3d00..5438cd20e 100644
--- a/tags/answer/page/22/index.html
+++ b/tags/answer/page/22/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/23/index.html b/tags/answer/page/23/index.html
index 920a194b3..25c8913d7 100644
--- a/tags/answer/page/23/index.html
+++ b/tags/answer/page/23/index.html
@@ -348,11 +348,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/24/index.html b/tags/answer/page/24/index.html
index ae56cd3fa..31fdf2c7b 100644
--- a/tags/answer/page/24/index.html
+++ b/tags/answer/page/24/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/25/index.html b/tags/answer/page/25/index.html
index a884b38a6..4cc4e27a2 100644
--- a/tags/answer/page/25/index.html
+++ b/tags/answer/page/25/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/26/index.html b/tags/answer/page/26/index.html
index 0bc323ca6..cc8aec244 100644
--- a/tags/answer/page/26/index.html
+++ b/tags/answer/page/26/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/27/index.html b/tags/answer/page/27/index.html
index 3df1b28a2..7c6b39b4a 100644
--- a/tags/answer/page/27/index.html
+++ b/tags/answer/page/27/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/28/index.html b/tags/answer/page/28/index.html
index 8b3b08674..a729a0d5e 100644
--- a/tags/answer/page/28/index.html
+++ b/tags/answer/page/28/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/29/index.html b/tags/answer/page/29/index.html
index 3a3642b45..c5912d5b4 100644
--- a/tags/answer/page/29/index.html
+++ b/tags/answer/page/29/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/3/index.html b/tags/answer/page/3/index.html
index 11f0f1f9a..57063be17 100644
--- a/tags/answer/page/3/index.html
+++ b/tags/answer/page/3/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/80cafdc8.html" class="archive-article-date">
+	      	<a href="/post/a5d1dfda.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/80cafdc8.html">1017.Negative binary conversion</a>
+      <a class="archive-article-title" href="/post/a5d1dfda.html">1124. The longest period of performance One question daily</a>
     </h2>
   
 
@@ -346,6 +346,10 @@ <h2 itemprop="name">
         		<li class="article-tag-list-item">
         			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">answer</a>
         		</li>
+      		 
+        		<li class="article-tag-list-item">
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
+        		</li>
       		
 		</ul>
 	</div>
@@ -418,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/30/index.html b/tags/answer/page/30/index.html
index b4a00096b..a6cf10b41 100644
--- a/tags/answer/page/30/index.html
+++ b/tags/answer/page/30/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/31/index.html b/tags/answer/page/31/index.html
index e1e2dbf3e..61a0231d2 100644
--- a/tags/answer/page/31/index.html
+++ b/tags/answer/page/31/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/32/index.html b/tags/answer/page/32/index.html
index 09f4f1229..44d3dd48d 100644
--- a/tags/answer/page/32/index.html
+++ b/tags/answer/page/32/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/33/index.html b/tags/answer/page/33/index.html
index 573caf4c6..22a154fa7 100644
--- a/tags/answer/page/33/index.html
+++ b/tags/answer/page/33/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/34/index.html b/tags/answer/page/34/index.html
index d323b87a5..dac5e399d 100644
--- a/tags/answer/page/34/index.html
+++ b/tags/answer/page/34/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/35/index.html b/tags/answer/page/35/index.html
index 4c5694d4a..1c4132ba1 100644
--- a/tags/answer/page/35/index.html
+++ b/tags/answer/page/35/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/36/index.html b/tags/answer/page/36/index.html
index 039000416..f17c8da5f 100644
--- a/tags/answer/page/36/index.html
+++ b/tags/answer/page/36/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/37/index.html b/tags/answer/page/37/index.html
index e845ca551..e1142420c 100644
--- a/tags/answer/page/37/index.html
+++ b/tags/answer/page/37/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/38/index.html b/tags/answer/page/38/index.html
index 64db1a35a..fafe15eb8 100644
--- a/tags/answer/page/38/index.html
+++ b/tags/answer/page/38/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/39/index.html b/tags/answer/page/39/index.html
index b07d76972..4e1773fd6 100644
--- a/tags/answer/page/39/index.html
+++ b/tags/answer/page/39/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/4/index.html b/tags/answer/page/4/index.html
index 6b203a3f8..1a9f73961 100644
--- a/tags/answer/page/4/index.html
+++ b/tags/answer/page/4/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/40/index.html b/tags/answer/page/40/index.html
index 8fea68d29..e98a916c5 100644
--- a/tags/answer/page/40/index.html
+++ b/tags/answer/page/40/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/41/index.html b/tags/answer/page/41/index.html
index 812ba9636..46bbf0a09 100644
--- a/tags/answer/page/41/index.html
+++ b/tags/answer/page/41/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/42/index.html b/tags/answer/page/42/index.html
index d5dd6bd44..5c4d297f7 100644
--- a/tags/answer/page/42/index.html
+++ b/tags/answer/page/42/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/43/index.html b/tags/answer/page/43/index.html
index 9a4956f04..80e49d14b 100644
--- a/tags/answer/page/43/index.html
+++ b/tags/answer/page/43/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/44/index.html b/tags/answer/page/44/index.html
index 4d67c929b..525935598 100644
--- a/tags/answer/page/44/index.html
+++ b/tags/answer/page/44/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/45/index.html b/tags/answer/page/45/index.html
index 712ceae24..0b1dd4e0c 100644
--- a/tags/answer/page/45/index.html
+++ b/tags/answer/page/45/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/46/index.html b/tags/answer/page/46/index.html
index 842f18096..e6e709da3 100644
--- a/tags/answer/page/46/index.html
+++ b/tags/answer/page/46/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/47/index.html b/tags/answer/page/47/index.html
index 15eb8c155..3353ae597 100644
--- a/tags/answer/page/47/index.html
+++ b/tags/answer/page/47/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/48/index.html b/tags/answer/page/48/index.html
index f64e62db1..f0b36e14b 100644
--- a/tags/answer/page/48/index.html
+++ b/tags/answer/page/48/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/49/index.html b/tags/answer/page/49/index.html
index 49990150b..dc515ff36 100644
--- a/tags/answer/page/49/index.html
+++ b/tags/answer/page/49/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/5/index.html b/tags/answer/page/5/index.html
index 0d48d7302..23dd5d455 100644
--- a/tags/answer/page/5/index.html
+++ b/tags/answer/page/5/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/6610c769.html" class="archive-article-date">
+	      	<a href="/post/eb193c1f.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/6610c769.html">1233Delete the subfolder folder One question daily</a>
+      <a class="archive-article-title" href="/post/eb193c1f.html">1139. The greatest 1 Formation of the border  One question daily</a>
     </h2>
   
 
@@ -348,7 +348,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Dictionary tree</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
         		</li>
       		
 		</ul>
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/50/index.html b/tags/answer/page/50/index.html
index bc72bbf94..5aff05265 100644
--- a/tags/answer/page/50/index.html
+++ b/tags/answer/page/50/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/51/index.html b/tags/answer/page/51/index.html
index b1248bb51..8d2819c51 100644
--- a/tags/answer/page/51/index.html
+++ b/tags/answer/page/51/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/52/index.html b/tags/answer/page/52/index.html
index 153c51cf7..965041657 100644
--- a/tags/answer/page/52/index.html
+++ b/tags/answer/page/52/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/53/index.html b/tags/answer/page/53/index.html
index 6e005ea26..364bfb1b3 100644
--- a/tags/answer/page/53/index.html
+++ b/tags/answer/page/53/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/54/index.html b/tags/answer/page/54/index.html
index 23862319a..35bf6764f 100644
--- a/tags/answer/page/54/index.html
+++ b/tags/answer/page/54/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/55/index.html b/tags/answer/page/55/index.html
index b66688152..37175f661 100644
--- a/tags/answer/page/55/index.html
+++ b/tags/answer/page/55/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/56/index.html b/tags/answer/page/56/index.html
index 909a5b54c..43e52f062 100644
--- a/tags/answer/page/56/index.html
+++ b/tags/answer/page/56/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/57/index.html b/tags/answer/page/57/index.html
index d0ab7c83e..837eb25d1 100644
--- a/tags/answer/page/57/index.html
+++ b/tags/answer/page/57/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/58/index.html b/tags/answer/page/58/index.html
index 00628a152..7d03504f3 100644
--- a/tags/answer/page/58/index.html
+++ b/tags/answer/page/58/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/59/index.html b/tags/answer/page/59/index.html
index ce3823b18..0b460052b 100644
--- a/tags/answer/page/59/index.html
+++ b/tags/answer/page/59/index.html
@@ -442,7 +442,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/6/index.html b/tags/answer/page/6/index.html
index 170c6611a..cbdd8e015 100644
--- a/tags/answer/page/6/index.html
+++ b/tags/answer/page/6/index.html
@@ -307,7 +307,7 @@
   <div class="archive-article-inner">
     <header class="archive-article-header">
       	<div class="article-meta">
-	      	<a href="/post/eb193c1f.html" class="archive-article-date">
+	      	<a href="/post/6610c769.html" class="archive-article-date">
   	<time datetime="2023-12-31T13:00:00.000Z" itemprop="datePublished">
 	<!-- <i class="icon-calendar icon"></i> -->
 
@@ -329,7 +329,7 @@
     	 
   
     <h2 itemprop="name">
-      <a class="archive-article-title" href="/post/eb193c1f.html">1139. The greatest 1 Formation of the border  One question daily</a>
+      <a class="archive-article-title" href="/post/6610c769.html">1233Delete the subfolder folder One question daily</a>
     </h2>
   
 
@@ -348,7 +348,7 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Prefix and</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color1">Dictionary tree</a>
         		</li>
       		
 		</ul>
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/60/index.html b/tags/answer/page/60/index.html
index 21d552855..ba33aa386 100644
--- a/tags/answer/page/60/index.html
+++ b/tags/answer/page/60/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/61/index.html b/tags/answer/page/61/index.html
index d8f31152b..a636f64c4 100644
--- a/tags/answer/page/61/index.html
+++ b/tags/answer/page/61/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/62/index.html b/tags/answer/page/62/index.html
index 08130b2c9..7c41d48c2 100644
--- a/tags/answer/page/62/index.html
+++ b/tags/answer/page/62/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/63/index.html b/tags/answer/page/63/index.html
index a8212ca69..1285a17ca 100644
--- a/tags/answer/page/63/index.html
+++ b/tags/answer/page/63/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/64/index.html b/tags/answer/page/64/index.html
index e05ab853a..69dda2c13 100644
--- a/tags/answer/page/64/index.html
+++ b/tags/answer/page/64/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/65/index.html b/tags/answer/page/65/index.html
index c61d8f334..4b464d577 100644
--- a/tags/answer/page/65/index.html
+++ b/tags/answer/page/65/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/66/index.html b/tags/answer/page/66/index.html
index 936bcb2c1..42467986c 100644
--- a/tags/answer/page/66/index.html
+++ b/tags/answer/page/66/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/67/index.html b/tags/answer/page/67/index.html
index dff099d8b..8cfd7ad1f 100644
--- a/tags/answer/page/67/index.html
+++ b/tags/answer/page/67/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/68/index.html b/tags/answer/page/68/index.html
index ee8ac204d..b88a81137 100644
--- a/tags/answer/page/68/index.html
+++ b/tags/answer/page/68/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/69/index.html b/tags/answer/page/69/index.html
index e87c84132..c2c75e1ee 100644
--- a/tags/answer/page/69/index.html
+++ b/tags/answer/page/69/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/7/index.html b/tags/answer/page/7/index.html
index 1ce84efc6..d6852b650 100644
--- a/tags/answer/page/7/index.html
+++ b/tags/answer/page/7/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/70/index.html b/tags/answer/page/70/index.html
index d2effe9d6..81577e9ff 100644
--- a/tags/answer/page/70/index.html
+++ b/tags/answer/page/70/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/71/index.html b/tags/answer/page/71/index.html
index 7aca5cb50..7aa4f5ad4 100644
--- a/tags/answer/page/71/index.html
+++ b/tags/answer/page/71/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/72/index.html b/tags/answer/page/72/index.html
index e8cd4db85..083273c33 100644
--- a/tags/answer/page/72/index.html
+++ b/tags/answer/page/72/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/8/index.html b/tags/answer/page/8/index.html
index bcb1aa55c..500cd6e30 100644
--- a/tags/answer/page/8/index.html
+++ b/tags/answer/page/8/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/answer/page/9/index.html b/tags/answer/page/9/index.html
index 4ddb6bf17..e13d1c788 100644
--- a/tags/answer/page/9/index.html
+++ b/tags/answer/page/9/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/count/index.html b/tags/count/index.html
index 708a65829..9198dba95 100644
--- a/tags/count/index.html
+++ b/tags/count/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/design/index.html b/tags/design/index.html
index 863879115..5e83bb866 100644
--- a/tags/design/index.html
+++ b/tags/design/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/difficulty/index.html b/tags/difficulty/index.html
index f36f2c913..588b383ce 100644
--- a/tags/difficulty/index.html
+++ b/tags/difficulty/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/difficulty/page/2/index.html b/tags/difficulty/page/2/index.html
index b9c56079d..305bf0315 100644
--- a/tags/difficulty/page/2/index.html
+++ b/tags/difficulty/page/2/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/difficulty/page/3/index.html b/tags/difficulty/page/3/index.html
index 397fb722a..aeafc7ea2 100644
--- a/tags/difficulty/page/3/index.html
+++ b/tags/difficulty/page/3/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/difficulty/page/4/index.html b/tags/difficulty/page/4/index.html
index 6247d441e..b686af10e 100644
--- a/tags/difficulty/page/4/index.html
+++ b/tags/difficulty/page/4/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/difficulty/page/5/index.html b/tags/difficulty/page/5/index.html
index 901ed5ba3..b8e96c15e 100644
--- a/tags/difficulty/page/5/index.html
+++ b/tags/difficulty/page/5/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/dp/index.html b/tags/dp/index.html
index ede76ec08..78341f83e 100644
--- a/tags/dp/index.html
+++ b/tags/dp/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/encryption/index.html b/tags/encryption/index.html
index 9c9fef8a9..773a0f2c6 100644
--- a/tags/encryption/index.html
+++ b/tags/encryption/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/front-end/index.html b/tags/front-end/index.html
index d9f200900..1d839e6f0 100644
--- a/tags/front-end/index.html
+++ b/tags/front-end/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/golang/index.html b/tags/golang/index.html
index fc2dfc60a..dcaffe51d 100644
--- a/tags/golang/index.html
+++ b/tags/golang/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/golang/page/2/index.html b/tags/golang/page/2/index.html
index f2115e52c..15f471566 100644
--- a/tags/golang/page/2/index.html
+++ b/tags/golang/page/2/index.html
@@ -348,11 +348,11 @@ <h2 itemprop="name">
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
         		</li>
       		 
         		<li class="article-tag-list-item">
-        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">Dynamic planning</a>
+        			<a href="javascript:void(0)" class="js-tag article-tag-list-link color2">golang</a>
         		</li>
       		
 		</ul>
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/golang/page/3/index.html b/tags/golang/page/3/index.html
index f3acffc19..9be41c237 100644
--- a/tags/golang/page/3/index.html
+++ b/tags/golang/page/3/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/golang/page/4/index.html b/tags/golang/page/4/index.html
index 85d9375cd..ebd0ffc43 100644
--- a/tags/golang/page/4/index.html
+++ b/tags/golang/page/4/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/golang/page/5/index.html b/tags/golang/page/5/index.html
index 5e9ada16d..4f67b147f 100644
--- a/tags/golang/page/5/index.html
+++ b/tags/golang/page/5/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/greedy/index.html b/tags/greedy/index.html
index 4795a6e55..9f7972e86 100644
--- a/tags/greedy/index.html
+++ b/tags/greedy/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/greedy/page/2/index.html b/tags/greedy/page/2/index.html
index 763831bff..b6333e48f 100644
--- a/tags/greedy/page/2/index.html
+++ b/tags/greedy/page/2/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/greedy/page/3/index.html b/tags/greedy/page/3/index.html
index 61dbb0e7f..5f09b3594 100644
--- a/tags/greedy/page/3/index.html
+++ b/tags/greedy/page/3/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/greedy/page/4/index.html b/tags/greedy/page/4/index.html
index cd795b692..2da6a226f 100644
--- a/tags/greedy/page/4/index.html
+++ b/tags/greedy/page/4/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/greedy/page/5/index.html b/tags/greedy/page/5/index.html
index 228fe8787..6037b9dc3 100644
--- a/tags/greedy/page/5/index.html
+++ b/tags/greedy/page/5/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git "a/tags/heap\357\274\210Priority-queue\357\274\211/index.html" "b/tags/heap\357\274\210Priority-queue\357\274\211/index.html"
index 1e0786095..b23ba9234 100644
--- "a/tags/heap\357\274\210Priority-queue\357\274\211/index.html"
+++ "b/tags/heap\357\274\210Priority-queue\357\274\211/index.html"
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/index.html b/tags/index.html
index fd3501dd6..9d177fef2 100644
--- a/tags/index.html
+++ b/tags/index.html
@@ -580,7 +580,7 @@ <h1 class="article-title_code_ant" itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/math/index.html b/tags/math/index.html
index 1ec95776b..91c32a5df 100644
--- a/tags/math/index.html
+++ b/tags/math/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/math/page/10/index.html b/tags/math/page/10/index.html
index 20aff7468..62d803553 100644
--- a/tags/math/page/10/index.html
+++ b/tags/math/page/10/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/math/page/11/index.html b/tags/math/page/11/index.html
index c122373b2..8cbe5b7d9 100644
--- a/tags/math/page/11/index.html
+++ b/tags/math/page/11/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/math/page/2/index.html b/tags/math/page/2/index.html
index e002cf4f0..2496282ba 100644
--- a/tags/math/page/2/index.html
+++ b/tags/math/page/2/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/math/page/3/index.html b/tags/math/page/3/index.html
index 98268c2d2..f2592c87d 100644
--- a/tags/math/page/3/index.html
+++ b/tags/math/page/3/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/math/page/4/index.html b/tags/math/page/4/index.html
index a42bf4200..3289d2113 100644
--- a/tags/math/page/4/index.html
+++ b/tags/math/page/4/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/math/page/5/index.html b/tags/math/page/5/index.html
index 4a666a20d..c6b14aaa3 100644
--- a/tags/math/page/5/index.html
+++ b/tags/math/page/5/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/math/page/6/index.html b/tags/math/page/6/index.html
index 31a5eedac..dab68dbbd 100644
--- a/tags/math/page/6/index.html
+++ b/tags/math/page/6/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/math/page/7/index.html b/tags/math/page/7/index.html
index 6612e25f2..5ccc93d84 100644
--- a/tags/math/page/7/index.html
+++ b/tags/math/page/7/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/math/page/8/index.html b/tags/math/page/8/index.html
index 1abd634a9..1b48cddd3 100644
--- a/tags/math/page/8/index.html
+++ b/tags/math/page/8/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/math/page/9/index.html b/tags/math/page/9/index.html
index 4e5a9f1f7..420b6063a 100644
--- a/tags/math/page/9/index.html
+++ b/tags/math/page/9/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/matrix/index.html b/tags/matrix/index.html
index 5361edbde..5aef37d0e 100644
--- a/tags/matrix/index.html
+++ b/tags/matrix/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/matrix/page/2/index.html b/tags/matrix/page/2/index.html
index 92bdc7001..98bfa2851 100644
--- a/tags/matrix/page/2/index.html
+++ b/tags/matrix/page/2/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/matrix/page/3/index.html b/tags/matrix/page/3/index.html
index 4fc54f429..1f5a83f45 100644
--- a/tags/matrix/page/3/index.html
+++ b/tags/matrix/page/3/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/matrix/page/4/index.html b/tags/matrix/page/4/index.html
index c1e6b4f11..9f460966f 100644
--- a/tags/matrix/page/4/index.html
+++ b/tags/matrix/page/4/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/medium/index.html b/tags/medium/index.html
index 41b009830..de26d73ee 100644
--- a/tags/medium/index.html
+++ b/tags/medium/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/pandas/index.html b/tags/pandas/index.html
index e158570cc..e48f2277a 100644
--- a/tags/pandas/index.html
+++ b/tags/pandas/index.html
@@ -414,7 +414,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/picture/index.html b/tags/picture/index.html
index cef853c53..84fe404c0 100644
--- a/tags/picture/index.html
+++ b/tags/picture/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/recursion/index.html b/tags/recursion/index.html
index 85c3c8f1e..83c7e9ea4 100644
--- a/tags/recursion/index.html
+++ b/tags/recursion/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/recursion/page/2/index.html b/tags/recursion/page/2/index.html
index a015dad65..39d252e8d 100644
--- a/tags/recursion/page/2/index.html
+++ b/tags/recursion/page/2/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/simulation/index.html b/tags/simulation/index.html
index ef6205aa4..0f7781f1a 100644
--- a/tags/simulation/index.html
+++ b/tags/simulation/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/simulation/page/2/index.html b/tags/simulation/page/2/index.html
index 2a454cb4e..92fddf720 100644
--- a/tags/simulation/page/2/index.html
+++ b/tags/simulation/page/2/index.html
@@ -434,7 +434,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/simulation/page/3/index.html b/tags/simulation/page/3/index.html
index f01e23698..a80fa7f74 100644
--- a/tags/simulation/page/3/index.html
+++ b/tags/simulation/page/3/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/simulation/page/4/index.html b/tags/simulation/page/4/index.html
index c105f348a..fa8f8e8d2 100644
--- a/tags/simulation/page/4/index.html
+++ b/tags/simulation/page/4/index.html
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/simulation/page/5/index.html b/tags/simulation/page/5/index.html
index 336429256..972a820eb 100644
--- a/tags/simulation/page/5/index.html
+++ b/tags/simulation/page/5/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/simulation/page/6/index.html b/tags/simulation/page/6/index.html
index 9b9cdb07c..423d22a02 100644
--- a/tags/simulation/page/6/index.html
+++ b/tags/simulation/page/6/index.html
@@ -438,7 +438,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/simulation/page/7/index.html b/tags/simulation/page/7/index.html
index 649113f8a..66c5706fe 100644
--- a/tags/simulation/page/7/index.html
+++ b/tags/simulation/page/7/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved-answer/index.html b/tags/solved-answer/index.html
index 8eacb1452..b186e9397 100644
--- a/tags/solved-answer/index.html
+++ b/tags/solved-answer/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved-answer/page/10/index.html b/tags/solved-answer/page/10/index.html
index 5b3feb18f..5dafa8086 100644
--- a/tags/solved-answer/page/10/index.html
+++ b/tags/solved-answer/page/10/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved-answer/page/2/index.html b/tags/solved-answer/page/2/index.html
index c8816ca79..1b04803e6 100644
--- a/tags/solved-answer/page/2/index.html
+++ b/tags/solved-answer/page/2/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved-answer/page/3/index.html b/tags/solved-answer/page/3/index.html
index b10496df6..76199841c 100644
--- a/tags/solved-answer/page/3/index.html
+++ b/tags/solved-answer/page/3/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved-answer/page/4/index.html b/tags/solved-answer/page/4/index.html
index db92e8b13..6c5a8cc4a 100644
--- a/tags/solved-answer/page/4/index.html
+++ b/tags/solved-answer/page/4/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved-answer/page/5/index.html b/tags/solved-answer/page/5/index.html
index 6a21f38ae..066238780 100644
--- a/tags/solved-answer/page/5/index.html
+++ b/tags/solved-answer/page/5/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved-answer/page/6/index.html b/tags/solved-answer/page/6/index.html
index d46fed85b..4362325cc 100644
--- a/tags/solved-answer/page/6/index.html
+++ b/tags/solved-answer/page/6/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved-answer/page/7/index.html b/tags/solved-answer/page/7/index.html
index 04cdc68a7..5bb512a95 100644
--- a/tags/solved-answer/page/7/index.html
+++ b/tags/solved-answer/page/7/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved-answer/page/8/index.html b/tags/solved-answer/page/8/index.html
index 8246c6748..fdc78daa7 100644
--- a/tags/solved-answer/page/8/index.html
+++ b/tags/solved-answer/page/8/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved-answer/page/9/index.html b/tags/solved-answer/page/9/index.html
index f26c3ec37..6e42144e9 100644
--- a/tags/solved-answer/page/9/index.html
+++ b/tags/solved-answer/page/9/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved/index.html b/tags/solved/index.html
index 1d0d67d54..c7e92b167 100644
--- a/tags/solved/index.html
+++ b/tags/solved/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved/page/2/index.html b/tags/solved/page/2/index.html
index 273b96fae..55483d019 100644
--- a/tags/solved/page/2/index.html
+++ b/tags/solved/page/2/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved/page/3/index.html b/tags/solved/page/3/index.html
index e5f8560ec..1420791e9 100644
--- a/tags/solved/page/3/index.html
+++ b/tags/solved/page/3/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved/page/4/index.html b/tags/solved/page/4/index.html
index 3b867b800..97f64a2ed 100644
--- a/tags/solved/page/4/index.html
+++ b/tags/solved/page/4/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/solved/page/5/index.html b/tags/solved/page/5/index.html
index a7088492f..5e386fc51 100644
--- a/tags/solved/page/5/index.html
+++ b/tags/solved/page/5/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/unsolved/index.html b/tags/unsolved/index.html
index 7efbfcf46..0b216fa80 100644
--- a/tags/unsolved/index.html
+++ b/tags/unsolved/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/unsolved/page/2/index.html b/tags/unsolved/page/2/index.html
index 91732fcf1..9979297b2 100644
--- a/tags/unsolved/page/2/index.html
+++ b/tags/unsolved/page/2/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/unsolved/page/3/index.html b/tags/unsolved/page/3/index.html
index 6e97d7d71..1ae3d2925 100644
--- a/tags/unsolved/page/3/index.html
+++ b/tags/unsolved/page/3/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/unsolved/page/4/index.html b/tags/unsolved/page/4/index.html
index 07f2e85ad..6c8c1aec7 100644
--- a/tags/unsolved/page/4/index.html
+++ b/tags/unsolved/page/4/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/unsolved/page/5/index.html b/tags/unsolved/page/5/index.html
index e76a7f118..83ca19bf0 100644
--- a/tags/unsolved/page/5/index.html
+++ b/tags/unsolved/page/5/index.html
@@ -426,7 +426,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/unsolved/page/6/index.html b/tags/unsolved/page/6/index.html
index 508fa7363..6930d6049 100644
--- a/tags/unsolved/page/6/index.html
+++ b/tags/unsolved/page/6/index.html
@@ -422,7 +422,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git a/tags/unsolved/page/7/index.html b/tags/unsolved/page/7/index.html
index 67b1a3807..5aa1fc49d 100644
--- a/tags/unsolved/page/7/index.html
+++ b/tags/unsolved/page/7/index.html
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git "a/tags/\345\217\214\345\220\221Linked/index.html" "b/tags/\345\217\214\345\220\221Linked/index.html"
index 87c3194ad..9a078f8b0 100644
--- "a/tags/\345\217\214\345\220\221Linked/index.html"
+++ "b/tags/\345\217\214\345\220\221Linked/index.html"
@@ -430,7 +430,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git "a/tags/\346\216\222\345\272\217/index.html" "b/tags/\346\216\222\345\272\217/index.html"
index af8852f8d..880b9b769 100644
--- "a/tags/\346\216\222\345\272\217/index.html"
+++ "b/tags/\346\216\222\345\272\217/index.html"
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->
diff --git "a/tags/\346\225\260\347\273\204/index.html" "b/tags/\346\225\260\347\273\204/index.html"
index 895ee3cb2..045e6d24f 100644
--- "a/tags/\346\225\260\347\273\204/index.html"
+++ "b/tags/\346\225\260\347\273\204/index.html"
@@ -418,7 +418,7 @@ <h2 itemprop="name">
 		<span> 104 篇</span>
 		<span class="post-meta-divider">|</span>
 		<i class="fa fa-pencil-square-o" aria-hidden="true"></i>
-		<span> <span class="post-count">33.6k</span></span>
+		<span> <span class="post-count">33.9k</span></span>
       </div>
 	  
 	  <!-- 添加不蒜子统计 -->