deploy: 67e5a65

Author: yanglbme

en/lcci/1.5/index.html

@@ -83731,9 +83731,9 @@
       <ul class="md-nav__list">
 
           <li class="md-nav__item">
-  <a href="#solution-1-case-discussion-two-pointers" class="md-nav__link">
+  <a href="#solution-1-case-analysis-two-pointers" class="md-nav__link">
     <span class="md-ellipsis">
-      Solution 1: Case Discussion + Two Pointers
+      Solution 1: Case Analysis + Two Pointers
     </span>
   </a>
 
@@ -86165,13 +86165,13 @@ <h2 id="description">Description</h2>
 <h2 id="solutions">Solutions</h2>
 <!-- solution:start -->
 
-<h3 id="solution-1-case-discussion-two-pointers">Solution 1: Case Discussion + Two Pointers</h3>
-<p>We denote the lengths of strings <span class="arithmatex">\(first\)</span> and <span class="arithmatex">\(second\)</span> as <span class="arithmatex">\(m\)</span> and <span class="arithmatex">\(n\)</span>, respectively, where <span class="arithmatex">\(m \geq n\)</span>.</p>
-<p>Next, we discuss different cases:</p>
+<h3 id="solution-1-case-analysis-two-pointers">Solution 1: Case Analysis + Two Pointers</h3>
+<p>Let the lengths of the strings <span class="arithmatex">\(\textit{first}\)</span> and <span class="arithmatex">\(\textit{second}\)</span> be <span class="arithmatex">\(m\)</span> and <span class="arithmatex">\(n\)</span>, respectively. Assume <span class="arithmatex">\(m \geq n\)</span>.</p>
+<p>Next, we discuss the following cases:</p>
 <ul>
-<li>When <span class="arithmatex">\(m - n &gt; 1\)</span>, <span class="arithmatex">\(first\)</span> and <span class="arithmatex">\(second\)</span> cannot be obtained through a single edit, so we return <code>false</code>.</li>
-<li>When <span class="arithmatex">\(m = n\)</span>, <span class="arithmatex">\(first\)</span> and <span class="arithmatex">\(second\)</span> can only be obtained through a single edit if and only if exactly one character is different.</li>
-<li>When <span class="arithmatex">\(m - n = 1\)</span>, <span class="arithmatex">\(first\)</span> and <span class="arithmatex">\(second\)</span> can only be obtained through a single edit if and only if <span class="arithmatex">\(second\)</span> is obtained by deleting one character from <span class="arithmatex">\(first\)</span>. We can use two pointers to implement this.</li>
+<li>When <span class="arithmatex">\(m - n \gt 1\)</span>, <span class="arithmatex">\(\textit{first}\)</span> and <span class="arithmatex">\(\textit{second}\)</span> cannot be made equal with one edit, so return <code>false</code>;</li>
+<li>When <span class="arithmatex">\(m = n\)</span>, <span class="arithmatex">\(\textit{first}\)</span> and <span class="arithmatex">\(\textit{second}\)</span> can be made equal with one edit only if there is exactly one different character;</li>
+<li>When <span class="arithmatex">\(m - n = 1\)</span>, <span class="arithmatex">\(\textit{first}\)</span> and <span class="arithmatex">\(\textit{second}\)</span> can be made equal with one edit only if <span class="arithmatex">\(\textit{second}\)</span> is obtained by deleting one character from <span class="arithmatex">\(\textit{first}\)</span>. We can use two pointers to achieve this.</li>
 </ul>
 <p>The time complexity is <span class="arithmatex">\(O(n)\)</span>, where <span class="arithmatex">\(n\)</span> is the length of the string. The space complexity is <span class="arithmatex">\(O(1)\)</span>.</p>
 <div class="tabbed-set tabbed-alternate" data-tabs="1:7"><input checked="checked" id="__tabbed_1_1" name="__tabbed_1" type="radio" /><input id="__tabbed_1_2" name="__tabbed_1" type="radio" /><input id="__tabbed_1_3" name="__tabbed_1" type="radio" /><input id="__tabbed_1_4" name="__tabbed_1" type="radio" /><input id="__tabbed_1_5" name="__tabbed_1" type="radio" /><input id="__tabbed_1_6" name="__tabbed_1" type="radio" /><input id="__tabbed_1_7" name="__tabbed_1" type="radio" /><div class="tabbed-labels"><label for="__tabbed_1_1">Python3</label><label for="__tabbed_1_2">Java</label><label for="__tabbed_1_3">C++</label><label for="__tabbed_1_4">Go</label><label for="__tabbed_1_5">TypeScript</label><label for="__tabbed_1_6">Rust</label><label for="__tabbed_1_7">Swift</label></div>

en/lcci/1.6/index.html

@@ -86170,7 +86170,7 @@ <h3 id="solution-1-two-pointers">Solution 1: Two Pointers</h3>
 <p>We can use two pointers to find the start and end positions of each consecutive character, calculate the length of the consecutive characters, and then append the character and length to the string <span class="arithmatex">\(t\)</span>.</p>
 <p>Finally, we compare the lengths of <span class="arithmatex">\(t\)</span> and <span class="arithmatex">\(S\)</span>. If the length of <span class="arithmatex">\(t\)</span> is less than <span class="arithmatex">\(S\)</span>, we return <span class="arithmatex">\(t\)</span>, otherwise we return <span class="arithmatex">\(S\)</span>.</p>
 <p>The time complexity is <span class="arithmatex">\(O(n)\)</span>, and the space complexity is <span class="arithmatex">\(O(n)\)</span>. Here, <span class="arithmatex">\(n\)</span> is the length of the string.</p>
-<div class="tabbed-set tabbed-alternate" data-tabs="1:8"><input checked="checked" id="__tabbed_1_1" name="__tabbed_1" type="radio" /><input id="__tabbed_1_2" name="__tabbed_1" type="radio" /><input id="__tabbed_1_3" name="__tabbed_1" type="radio" /><input id="__tabbed_1_4" name="__tabbed_1" type="radio" /><input id="__tabbed_1_5" name="__tabbed_1" type="radio" /><input id="__tabbed_1_6" name="__tabbed_1" type="radio" /><input id="__tabbed_1_7" name="__tabbed_1" type="radio" /><input id="__tabbed_1_8" name="__tabbed_1" type="radio" /><div class="tabbed-labels"><label for="__tabbed_1_1">Python3</label><label for="__tabbed_1_2">Python3</label><label for="__tabbed_1_3">Java</label><label for="__tabbed_1_4">C++</label><label for="__tabbed_1_5">Go</label><label for="__tabbed_1_6">Rust</label><label for="__tabbed_1_7">JavaScript</label><label for="__tabbed_1_8">Swift</label></div>
+<div class="tabbed-set tabbed-alternate" data-tabs="1:7"><input checked="checked" id="__tabbed_1_1" name="__tabbed_1" type="radio" /><input id="__tabbed_1_2" name="__tabbed_1" type="radio" /><input id="__tabbed_1_3" name="__tabbed_1" type="radio" /><input id="__tabbed_1_4" name="__tabbed_1" type="radio" /><input id="__tabbed_1_5" name="__tabbed_1" type="radio" /><input id="__tabbed_1_6" name="__tabbed_1" type="radio" /><input id="__tabbed_1_7" name="__tabbed_1" type="radio" /><div class="tabbed-labels"><label for="__tabbed_1_1">Python3</label><label for="__tabbed_1_2">Java</label><label for="__tabbed_1_3">C++</label><label for="__tabbed_1_4">Go</label><label for="__tabbed_1_5">Rust</label><label for="__tabbed_1_6">JavaScript</label><label for="__tabbed_1_7">Swift</label></div>
 <div class="tabbed-content">
 <div class="tabbed-block">
 <div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal">1</span>
@@ -86193,30 +86193,6 @@ <h3 id="solution-1-two-pointers">Solution 1: Two Pointers</h3>
 <span class="normal"> 8</span>
 <span class="normal"> 9</span>
 <span class="normal">10</span>
-<span class="normal">11</span></pre></div></td><td class="code"><div><pre><span></span><code><span class="k">class</span><span class="w"> </span><span class="nc">Solution</span><span class="p">:</span>
-    <span class="k">def</span><span class="w"> </span><span class="nf">compressString</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">S</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="nb">str</span><span class="p">:</span>
-        <span class="n">t</span> <span class="o">=</span> <span class="p">[]</span>
-        <span class="n">i</span><span class="p">,</span> <span class="n">n</span> <span class="o">=</span> <span class="mi">0</span><span class="p">,</span> <span class="nb">len</span><span class="p">(</span><span class="n">S</span><span class="p">)</span>
-        <span class="k">while</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="n">n</span><span class="p">:</span>
-            <span class="n">j</span> <span class="o">=</span> <span class="n">i</span> <span class="o">+</span> <span class="mi">1</span>
-            <span class="k">while</span> <span class="n">j</span> <span class="o">&lt;</span> <span class="n">n</span> <span class="ow">and</span> <span class="n">S</span><span class="p">[</span><span class="n">j</span><span class="p">]</span> <span class="o">==</span> <span class="n">S</span><span class="p">[</span><span class="n">i</span><span class="p">]:</span>
-                <span class="n">j</span> <span class="o">+=</span> <span class="mi">1</span>
-            <span class="n">t</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">S</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">+</span> <span class="nb">str</span><span class="p">(</span><span class="n">j</span> <span class="o">-</span> <span class="n">i</span><span class="p">))</span>
-            <span class="n">i</span> <span class="o">=</span> <span class="n">j</span>
-        <span class="k">return</span> <span class="nb">min</span><span class="p">(</span><span class="n">S</span><span class="p">,</span> <span class="s2">&quot;&quot;</span><span class="o">.</span><span class="n">join</span><span class="p">(</span><span class="n">t</span><span class="p">),</span> <span class="n">key</span><span class="o">=</span><span class="nb">len</span><span class="p">)</span>
-</code></pre></div></td></tr></table></div>
-</div>
-<div class="tabbed-block">
-<div class="highlight"><table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><span></span><span class="normal"> 1</span>
-<span class="normal"> 2</span>
-<span class="normal"> 3</span>
-<span class="normal"> 4</span>
-<span class="normal"> 5</span>
-<span class="normal"> 6</span>
-<span class="normal"> 7</span>
-<span class="normal"> 8</span>
-<span class="normal"> 9</span>
-<span class="normal">10</span>
 <span class="normal">11</span>
 <span class="normal">12</span>
 <span class="normal">13</span>

en/lcci/1.7/index.html

@@ -83777,7 +83777,7 @@
           <li class="md-nav__item">
   <a href="#solution-1-in-place-rotation" class="md-nav__link">
     <span class="md-ellipsis">
-      Solution 1: In-place Rotation
+      Solution 1: In-Place Rotation
     </span>
   </a>
 
@@ -86207,9 +86207,9 @@ <h2 id="description">Description</h2>
 <h2 id="solutions">Solutions</h2>
 <!-- solution:start -->
 
-<h3 id="solution-1-in-place-rotation">Solution 1: In-place Rotation</h3>
-<p>According to the problem requirements, we actually need to rotate <span class="arithmatex">\(matrix[i][j]\)</span> to <span class="arithmatex">\(matrix[j][n - i - 1]\)</span>.</p>
-<p>We can first flip the matrix upside down, that is, swap <span class="arithmatex">\(matrix[i][j]\)</span> and <span class="arithmatex">\(matrix[n - i - 1][j]\)</span>, and then flip the matrix along the main diagonal, that is, swap <span class="arithmatex">\(matrix[i][j]\)</span> and <span class="arithmatex">\(matrix[j][i]\)</span>. This way, we can rotate <span class="arithmatex">\(matrix[i][j]\)</span> to <span class="arithmatex">\(matrix[j][n - i - 1]\)</span>.</p>
+<h3 id="solution-1-in-place-rotation">Solution 1: In-Place Rotation</h3>
+<p>According to the problem requirements, we need to rotate <span class="arithmatex">\(\text{matrix}[i][j]\)</span> to <span class="arithmatex">\(\text{matrix}[j][n - i - 1]\)</span>.</p>
+<p>We can first flip the matrix upside down, i.e., swap <span class="arithmatex">\(\text{matrix}[i][j]\)</span> with <span class="arithmatex">\(\text{matrix}[n - i - 1][j]\)</span>, and then flip the matrix along the main diagonal, i.e., swap <span class="arithmatex">\(\text{matrix}[i][j]\)</span> with <span class="arithmatex">\(\text{matrix}[j][i]\)</span>. This will rotate <span class="arithmatex">\(\text{matrix}[i][j]\)</span> to <span class="arithmatex">\(\text{matrix}[j][n - i - 1]\)</span>.</p>
 <p>The time complexity is <span class="arithmatex">\(O(n^2)\)</span>, where <span class="arithmatex">\(n\)</span> is the side length of the matrix. The space complexity is <span class="arithmatex">\(O(1)\)</span>.</p>
 <div class="tabbed-set tabbed-alternate" data-tabs="1:9"><input checked="checked" id="__tabbed_1_1" name="__tabbed_1" type="radio" /><input id="__tabbed_1_2" name="__tabbed_1" type="radio" /><input id="__tabbed_1_3" name="__tabbed_1" type="radio" /><input id="__tabbed_1_4" name="__tabbed_1" type="radio" /><input id="__tabbed_1_5" name="__tabbed_1" type="radio" /><input id="__tabbed_1_6" name="__tabbed_1" type="radio" /><input id="__tabbed_1_7" name="__tabbed_1" type="radio" /><input id="__tabbed_1_8" name="__tabbed_1" type="radio" /><input id="__tabbed_1_9" name="__tabbed_1" type="radio" /><div class="tabbed-labels"><label for="__tabbed_1_1">Python3</label><label for="__tabbed_1_2">Java</label><label for="__tabbed_1_3">C++</label><label for="__tabbed_1_4">Go</label><label for="__tabbed_1_5">TypeScript</label><label for="__tabbed_1_6">Rust</label><label for="__tabbed_1_7">JavaScript</label><label for="__tabbed_1_8">C#</label><label for="__tabbed_1_9">Swift</label></div>
 <div class="tabbed-content">