deploy: 2e04c0f

Author: yanglbme

en/lc/3258/index.html

@@ -80295,9 +80295,9 @@ <h3 id="solution-1-sliding-window">Solution 1: Sliding Window</h3>
 <span class="w">    </span><span class="kd">const</span><span class="w"> </span><span class="nx">cnt</span><span class="o">:</span><span class="w"> </span><span class="p">[</span><span class="kt">number</span><span class="p">,</span><span class="w"> </span><span class="kt">number</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">[</span><span class="mf">0</span><span class="p">,</span><span class="w"> </span><span class="mf">0</span><span class="p">];</span>
 <span class="w">    </span><span class="kd">let</span><span class="w"> </span><span class="p">[</span><span class="nx">ans</span><span class="p">,</span><span class="w"> </span><span class="nx">l</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">[</span><span class="mf">0</span><span class="p">,</span><span class="w"> </span><span class="mf">0</span><span class="p">];</span>
 <span class="w">    </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kd">let</span><span class="w"> </span><span class="nx">r</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0</span><span class="p">;</span><span class="w"> </span><span class="nx">r</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="nx">s</span><span class="p">.</span><span class="nx">length</span><span class="p">;</span><span class="w"> </span><span class="o">++</span><span class="nx">r</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
-<span class="w">        </span><span class="nx">cnt</span><span class="p">[</span><span class="nx">s</span><span class="p">.</span><span class="nx">charCodeAt</span><span class="p">(</span><span class="nx">r</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mf">48</span><span class="p">]</span><span class="o">++</span><span class="p">;</span>
+<span class="w">        </span><span class="nx">cnt</span><span class="p">[</span><span class="o">+</span><span class="nx">s</span><span class="p">[</span><span class="nx">r</span><span class="p">]]</span><span class="o">++</span><span class="p">;</span>
 <span class="w">        </span><span class="k">while</span><span class="w"> </span><span class="p">(</span><span class="nx">cnt</span><span class="p">[</span><span class="mf">0</span><span class="p">]</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="nx">k</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="nx">cnt</span><span class="p">[</span><span class="mf">1</span><span class="p">]</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="nx">k</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
-<span class="w">            </span><span class="nx">cnt</span><span class="p">[</span><span class="nx">s</span><span class="p">.</span><span class="nx">charCodeAt</span><span class="p">(</span><span class="nx">l</span><span class="o">++</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mf">48</span><span class="p">]</span><span class="o">--</span><span class="p">;</span>
+<span class="w">            </span><span class="nx">cnt</span><span class="p">[</span><span class="o">+</span><span class="nx">s</span><span class="p">[</span><span class="nx">l</span><span class="o">++</span><span class="p">]]</span><span class="o">--</span><span class="p">;</span>
 <span class="w">        </span><span class="p">}</span>
 <span class="w">        </span><span class="nx">ans</span><span class="w"> </span><span class="o">+=</span><span class="w"> </span><span class="nx">r</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="nx">l</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mf">1</span><span class="p">;</span>
 <span class="w">    </span><span class="p">}</span>

en/lc/3261/index.html

@@ -80055,6 +80055,17 @@
               <article class="md-content__inner md-typeset">
 
 
+  
+<nav class="md-tags" >
+  
+    
+    
+    
+      <a href="../../tags/#string" class="md-tag">String</a>
+    
+  
+</nav>
+
 
 
     <a href="https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3340.Check%20Balanced%20String/README_EN.md" title="Edit this page" class="md-content__button md-icon">

en/lc/3340/index.html

@@ -80055,6 +80055,41 @@
               <article class="md-content__inner md-typeset">
 
 
+  
+<nav class="md-tags" >
+  
+    
+    
+    
+      <a href="../../tags/#graph" class="md-tag">Graph</a>
+    
+  
+    
+    
+    
+      <a href="../../tags/#array" class="md-tag">Array</a>
+    
+  
+    
+    
+    
+      <a href="../../tags/#matrix" class="md-tag">Matrix</a>
+    
+  
+    
+    
+    
+      <a href="../../tags/#shortest-path" class="md-tag">Shortest Path</a>
+    
+  
+    
+    
+    
+      <a href="../../tags/#heap-priority-queue" class="md-tag">Heap (Priority Queue)</a>
+    
+  
+</nav>
+
 
 
     <a href="https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3341.Find%20Minimum%20Time%20to%20Reach%20Last%20Room%20I/README_EN.md" title="Edit this page" class="md-content__button md-icon">

en/lc/3341/index.html

@@ -80055,6 +80055,41 @@
               <article class="md-content__inner md-typeset">
 
 
+  
+<nav class="md-tags" >
+  
+    
+    
+    
+      <a href="../../tags/#graph" class="md-tag">Graph</a>
+    
+  
+    
+    
+    
+      <a href="../../tags/#array" class="md-tag">Array</a>
+    
+  
+    
+    
+    
+      <a href="../../tags/#matrix" class="md-tag">Matrix</a>
+    
+  
+    
+    
+    
+      <a href="../../tags/#shortest-path" class="md-tag">Shortest Path</a>
+    
+  
+    
+    
+    
+      <a href="../../tags/#heap-priority-queue" class="md-tag">Heap (Priority Queue)</a>
+    
+  
+</nav>
+
 
 
     <a href="https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3342.Find%20Minimum%20Time%20to%20Reach%20Last%20Room%20II/README_EN.md" title="Edit this page" class="md-content__button md-icon">

en/lc/3342/index.html

@@ -80055,6 +80055,35 @@
               <article class="md-content__inner md-typeset">
 
 
+  
+<nav class="md-tags" >
+  
+    
+    
+    
+      <a href="../../tags/#math" class="md-tag">Math</a>
+    
+  
+    
+    
+    
+      <a href="../../tags/#string" class="md-tag">String</a>
+    
+  
+    
+    
+    
+      <a href="../../tags/#dynamic-programming" class="md-tag">Dynamic Programming</a>
+    
+  
+    
+    
+    
+      <a href="../../tags/#combinatorics" class="md-tag">Combinatorics</a>
+    
+  
+</nav>
+
 
 
     <a href="https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3343.Count%20Number%20of%20Balanced%20Permutations/README_EN.md" title="Edit this page" class="md-content__button md-icon">