deploy: a742201

Author: yanglbme

en/lc/1108/index.html

@@ -87115,19 +87115,30 @@ <h2 id="description">Description</h2>
 <p>A <em>defanged&nbsp;IP address</em>&nbsp;replaces every period <code>&quot;.&quot;</code> with <code>&quot;[.]&quot;</code>.</p>
 
 <p>&nbsp;</p>
+
 <p><strong class="example">Example 1:</strong></p>
+
 <pre><strong>Input:</strong> address = "1.1.1.1"
+
 <strong>Output:</strong> "1[.]1[.]1[.]1"
+
 </pre>
 <p><strong class="example">Example 2:</strong></p>
+
 <pre><strong>Input:</strong> address = "255.100.50.0"
+
 <strong>Output:</strong> "255[.]100[.]50[.]0"
+
 </pre>
+
 <p>&nbsp;</p>
+
 <p><strong>Constraints:</strong></p>
 
 <ul>
+
     <li>The given <code>address</code> is a valid IPv4 address.</li>
+
 </ul>
 
 <!-- description:end -->
@@ -87233,14 +87244,14 @@ <h3 id="solution-1-direct-replacement">Solution 1: Direct Replacement</h3>
 
     <nav>
 
-        <a href="https://github.com/acbin" class="md-author" title="@acbin">
+        <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
 
-          <img src="https://avatars.githubusercontent.com/u/44314231?v=4&size=72" alt="acbin">
+          <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
         </a>
 
-        <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
+        <a href="https://github.com/acbin" class="md-author" title="@acbin">
 
-          <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
+          <img src="https://avatars.githubusercontent.com/u/44314231?v=4&size=72" alt="acbin">
         </a>
 
         <a href="https://github.com/zhaocchen" class="md-author" title="@zhaocchen">

en/lc/1111/index.html

@@ -87119,17 +87119,25 @@ <h2 id="description">Description</h2>
 <p>A string is a <em>valid parentheses string</em>&nbsp;(denoted VPS) if and only if it consists of <code>&quot;(&quot;</code> and <code>&quot;)&quot;</code> characters only, and:</p>
 
 <ul>
+
     <li>It is the empty string, or</li>
+
     <li>It can be written as&nbsp;<code>AB</code>&nbsp;(<code>A</code>&nbsp;concatenated with&nbsp;<code>B</code>), where&nbsp;<code>A</code>&nbsp;and&nbsp;<code>B</code>&nbsp;are VPS&#39;s, or</li>
+
     <li>It can be written as&nbsp;<code>(A)</code>, where&nbsp;<code>A</code>&nbsp;is a VPS.</li>
+
 </ul>
 
 <p>We can&nbsp;similarly define the <em>nesting depth</em> <code>depth(S)</code> of any VPS <code>S</code> as follows:</p>
 
 <ul>
+
     <li><code>depth(&quot;&quot;) = 0</code></li>
+
     <li><code>depth(A + B) = max(depth(A), depth(B))</code>, where <code>A</code> and <code>B</code> are VPS&#39;s</li>
+
     <li><code>depth(&quot;(&quot; + A + &quot;)&quot;) = 1 + depth(A)</code>, where <code>A</code> is a VPS.</li>
+
 </ul>
 
 <p>For example,&nbsp; <code>&quot;&quot;</code>,&nbsp;<code>&quot;()()&quot;</code>, and&nbsp;<code>&quot;()(()())&quot;</code>&nbsp;are VPS&#39;s (with nesting depths 0, 1, and 2), and <code>&quot;)(&quot;</code> and <code>&quot;(()&quot;</code> are not VPS&#39;s.</p>
@@ -87352,14 +87360,14 @@ <h3 id="solution-1-greedy">Solution 1: Greedy</h3>
 
     <nav>
 
-        <a href="https://github.com/acbin" class="md-author" title="@acbin">
+        <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
 
-          <img src="https://avatars.githubusercontent.com/u/44314231?v=4&size=72" alt="acbin">
+          <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
         </a>
 
-        <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
+        <a href="https://github.com/acbin" class="md-author" title="@acbin">
 
-          <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
+          <img src="https://avatars.githubusercontent.com/u/44314231?v=4&size=72" alt="acbin">
         </a>
 
 

en/lc/1138/index.html

@@ -87125,32 +87125,50 @@ <h2 id="description">Description</h2>
 <p>We may make the following moves:</p>
 
 <ul>
+
     <li><code>&#39;U&#39;</code> moves our position up one row, if the position exists on the board;</li>
+
     <li><code>&#39;D&#39;</code> moves our position down one row, if the position exists on the board;</li>
+
     <li><code>&#39;L&#39;</code> moves our position left one column, if the position exists on the board;</li>
+
     <li><code>&#39;R&#39;</code> moves our position right one column, if the position exists on the board;</li>
+
     <li><code>&#39;!&#39;</code>&nbsp;adds the character <code>board[r][c]</code> at our current position <code>(r, c)</code>&nbsp;to the&nbsp;answer.</li>
+
 </ul>
 
 <p>(Here, the only positions that exist on the board are positions with letters on them.)</p>
 
 <p>Return a sequence of moves that makes our answer equal to <code>target</code>&nbsp;in the minimum number of moves.&nbsp; You may return any path that does so.</p>
 
 <p>&nbsp;</p>
+
 <p><strong class="example">Example 1:</strong></p>
+
 <pre><strong>Input:</strong> target = "leet"
+
 <strong>Output:</strong> "DDR!UURRR!!DDD!"
+
 </pre>
 <p><strong class="example">Example 2:</strong></p>
+
 <pre><strong>Input:</strong> target = "code"
+
 <strong>Output:</strong> "RR!DDRR!UUL!R!"
+
 </pre>
+
 <p>&nbsp;</p>
+
 <p><strong>Constraints:</strong></p>
 
 <ul>
+
     <li><code>1 &lt;= target.length &lt;= 100</code></li>
+
     <li><code>target</code> consists only of English lowercase letters.</li>
+
 </ul>
 
 <!-- description:end -->
@@ -87412,14 +87430,14 @@ <h3 id="solution-1-simulation">Solution 1: Simulation</h3>
 
     <nav>
 
-        <a href="https://github.com/acbin" class="md-author" title="@acbin">
+        <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
 
-          <img src="https://avatars.githubusercontent.com/u/44314231?v=4&size=72" alt="acbin">
+          <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
         </a>
 
-        <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
+        <a href="https://github.com/acbin" class="md-author" title="@acbin">
 
-          <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
+          <img src="https://avatars.githubusercontent.com/u/44314231?v=4&size=72" alt="acbin">
         </a>
 
 

en/lc/1139/index.html

@@ -87125,27 +87125,39 @@ <h2 id="description">Description</h2>
 <p>Given a 2D <code>grid</code> of <code>0</code>s and <code>1</code>s, return the number of elements in&nbsp;the largest <strong>square</strong>&nbsp;subgrid that has all <code>1</code>s on its <strong>border</strong>, or <code>0</code> if such a subgrid&nbsp;doesn&#39;t exist in the <code>grid</code>.</p>
 
 <p>&nbsp;</p>
+
 <p><strong class="example">Example 1:</strong></p>
 
 <pre>
+
 <strong>Input:</strong> grid = [[1,1,1],[1,0,1],[1,1,1]]
+
 <strong>Output:</strong> 9
+
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
 
 <pre>
+
 <strong>Input:</strong> grid = [[1,1,0,0]]
+
 <strong>Output:</strong> 1
+
 </pre>
 
 <p>&nbsp;</p>
+
 <p><strong>Constraints:</strong></p>
 
 <ul>
+
     <li><code>1 &lt;= grid.length &lt;= 100</code></li>
+
     <li><code>1 &lt;= grid[0].length &lt;= 100</code></li>
+
     <li><code>grid[i][j]</code> is <code>0</code> or <code>1</code></li>
+
 </ul>
 
 <!-- description:end -->
@@ -87416,14 +87428,14 @@ <h3 id="solution-1-prefix-sum-enumeration">Solution 1: Prefix Sum + Enumeration<
 
     <nav>
 
-        <a href="https://github.com/acbin" class="md-author" title="@acbin">
+        <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
 
-          <img src="https://avatars.githubusercontent.com/u/44314231?v=4&size=72" alt="acbin">
+          <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
         </a>
 
-        <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
+        <a href="https://github.com/acbin" class="md-author" title="@acbin">
 
-          <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
+          <img src="https://avatars.githubusercontent.com/u/44314231?v=4&size=72" alt="acbin">
         </a>
 
 

en/lc/1184/index.html

@@ -87117,13 +87117,17 @@ <h2 id="description">Description</h2>
 <p>Return the shortest distance between the given&nbsp;<code>start</code>&nbsp;and <code>destination</code>&nbsp;stops.</p>
 
 <p>&nbsp;</p>
+
 <p><strong class="example">Example 1:</strong></p>
 
 <p><a class="glightbox" href="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/images/untitled-diagram-1.jpg" data-type="image" data-width="auto" data-height="auto" data-desc-position="bottom"><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/images/untitled-diagram-1.jpg" style="width: 388px; height: 240px;" /></a></p>
 
 <pre>
+
 <strong>Input:</strong> distance = [1,2,3,4], start = 0, destination = 1
+
 <strong>Output:</strong> 1
+
 <strong>Explanation:</strong> Distance between 0 and 1 is 1 or 9, minimum is 1.</pre>
 
 <p>&nbsp;</p>
@@ -87133,9 +87137,13 @@ <h2 id="description">Description</h2>
 <p><a class="glightbox" href="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/images/untitled-diagram-1-1.jpg" data-type="image" data-width="auto" data-height="auto" data-desc-position="bottom"><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/images/untitled-diagram-1-1.jpg" style="width: 388px; height: 240px;" /></a></p>
 
 <pre>
+
 <strong>Input:</strong> distance = [1,2,3,4], start = 0, destination = 2
+
 <strong>Output:</strong> 3
+
 <strong>Explanation:</strong> Distance between 0 and 2 is 3 or 7, minimum is 3.
+
 </pre>
 
 <p>&nbsp;</p>
@@ -87145,19 +87153,29 @@ <h2 id="description">Description</h2>
 <p><a class="glightbox" href="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/images/untitled-diagram-1-2.jpg" data-type="image" data-width="auto" data-height="auto" data-desc-position="bottom"><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/images/untitled-diagram-1-2.jpg" style="width: 388px; height: 240px;" /></a></p>
 
 <pre>
+
 <strong>Input:</strong> distance = [1,2,3,4], start = 0, destination = 3
+
 <strong>Output:</strong> 4
+
 <strong>Explanation:</strong> Distance between 0 and 3 is 6 or 4, minimum is 4.
+
 </pre>
 
 <p>&nbsp;</p>
+
 <p><strong>Constraints:</strong></p>
 
 <ul>
+
     <li><code>1 &lt;= n&nbsp;&lt;= 10^4</code></li>
+
     <li><code>distance.length == n</code></li>
+
     <li><code>0 &lt;= start, destination &lt; n</code></li>
+
     <li><code>0 &lt;= distance[i] &lt;= 10^4</code></li>
+
 </ul>
 
 <!-- description:end -->
@@ -87389,14 +87407,14 @@ <h3 id="solution-1-simulation">Solution 1: Simulation</h3>
 
     <nav>
 
-        <a href="https://github.com/acbin" class="md-author" title="@acbin">
+        <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
 
-          <img src="https://avatars.githubusercontent.com/u/44314231?v=4&size=72" alt="acbin">
+          <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
         </a>
 
-        <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
+        <a href="https://github.com/acbin" class="md-author" title="@acbin">
 
-          <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
+          <img src="https://avatars.githubusercontent.com/u/44314231?v=4&size=72" alt="acbin">
         </a>
 
         <a href="https://github.com/thinkasany" class="md-author" title="@thinkasany">

en/lc/1238/index.html

@@ -87134,35 +87134,53 @@ <h2 id="description">Description</h2>
 <p>Given 2 integers <code>n</code> and <code>start</code>. Your task is return <strong>any</strong> permutation <code>p</code>&nbsp;of <code>(0,1,2.....,2^n -1) </code>such that :</p>
 
 <ul>
+
     <li><code>p[0] = start</code></li>
+
     <li><code>p[i]</code> and <code>p[i+1]</code>&nbsp;differ by only one bit in their binary representation.</li>
+
     <li><code>p[0]</code> and <code>p[2^n -1]</code>&nbsp;must also differ by only one bit in their binary representation.</li>
+
 </ul>
 
 <p>&nbsp;</p>
+
 <p><strong class="example">Example 1:</strong></p>
 
 <pre>
+
 <strong>Input:</strong> n = 2, start = 3
+
 <strong>Output:</strong> [3,2,0,1]
+
 <strong>Explanation:</strong> The binary representation of the permutation is (11,10,00,01). 
+
 All the adjacent element differ by one bit. Another valid permutation is [3,1,0,2]
+
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
 
 <pre>
+
 <strong>Input:</strong> n = 3, start = 2
+
 <strong>Output:</strong> [2,6,7,5,4,0,1,3]
+
 <strong>Explanation:</strong> The binary representation of the permutation is (010,110,111,101,100,000,001,011).
+
 </pre>
 
 <p>&nbsp;</p>
+
 <p><strong>Constraints:</strong></p>
 
 <ul>
+
     <li><code>1 &lt;= n &lt;= 16</code></li>
+
     <li><code>0 &lt;= start&nbsp;&lt;&nbsp;2 ^ n</code></li>
+
 </ul>
 
 <!-- description:end -->
@@ -87418,14 +87436,14 @@ <h3 id="solution-2-conversion-optimization">Solution 2: Conversion Optimization<
 
     <nav>
 
-        <a href="https://github.com/acbin" class="md-author" title="@acbin">
+        <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
 
-          <img src="https://avatars.githubusercontent.com/u/44314231?v=4&size=72" alt="acbin">
+          <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
         </a>
 
-        <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
+        <a href="https://github.com/acbin" class="md-author" title="@acbin">
 
-          <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
+          <img src="https://avatars.githubusercontent.com/u/44314231?v=4&size=72" alt="acbin">
         </a>