deploy: 9d3e84e

Author: yanglbme

en/lc/1683/index.html

@@ -80677,6 +80677,7 @@ <h2 id="description">Description</h2>
 | content        | varchar |
 +----------------+---------+
 tweet_id is the primary key (column with unique values) for this table.
+content consists of characters on an American Keyboard, and no other special characters.
 This table contains all the tweets in a social media app.
 </pre>
 

en/lc/1861/index.html

@@ -80679,102 +80679,69 @@ <h1 id="1861-rotating-the-box"><a href="https://leetcode.com/problems/rotating-t
 <h2 id="description">Description</h2>
 <!-- description:start -->
 
-<p>You are given an <code>m x n</code> matrix of characters <code>box</code> representing a side-view of a box. Each cell of the box is one of the following:</p>
+<p>You are given an <code>m x n</code> matrix of characters <code>boxGrid</code> representing a side-view of a box. Each cell of the box is one of the following:</p>
 
 <ul>
-
     <li>A stone <code>&#39;#&#39;</code></li>
-
     <li>A stationary obstacle <code>&#39;*&#39;</code></li>
-
     <li>Empty <code>&#39;.&#39;</code></li>
-
 </ul>
 
 <p>The box is rotated <strong>90 degrees clockwise</strong>, causing some of the stones to fall due to gravity. Each stone falls down until it lands on an obstacle, another stone, or the bottom of the box. Gravity <strong>does not</strong> affect the obstacles&#39; positions, and the inertia from the box&#39;s rotation <strong>does not </strong>affect the stones&#39; horizontal positions.</p>
 
-<p>It is <strong>guaranteed</strong> that each stone in <code>box</code> rests on an obstacle, another stone, or the bottom of the box.</p>
+<p>It is <strong>guaranteed</strong> that each stone in <code>boxGrid</code> rests on an obstacle, another stone, or the bottom of the box.</p>
 
 <p>Return <em>an </em><code>n x m</code><em> matrix representing the box after the rotation described above</em>.</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/1800-1899/1861.Rotating%20the%20Box/images/rotatingtheboxleetcodewithstones.png" 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/1800-1899/1861.Rotating%20the%20Box/images/rotatingtheboxleetcodewithstones.png" style="width: 300px; height: 150px;" /></a></p>
 
 <pre>
-
-<strong>Input:</strong> box = [[&quot;#&quot;,&quot;.&quot;,&quot;#&quot;]]
-
+<strong>Input:</strong> boxGrid = [[&quot;#&quot;,&quot;.&quot;,&quot;#&quot;]]
 <strong>Output:</strong> [[&quot;.&quot;],
-
 &nbsp;        [&quot;#&quot;],
-
 &nbsp;        [&quot;#&quot;]]
-
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
 
 <p><a class="glightbox" href="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1800-1899/1861.Rotating%20the%20Box/images/rotatingtheboxleetcode2withstones.png" 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/1800-1899/1861.Rotating%20the%20Box/images/rotatingtheboxleetcode2withstones.png" style="width: 375px; height: 195px;" /></a></p>
 
 <pre>
-
-<strong>Input:</strong> box = [[&quot;#&quot;,&quot;.&quot;,&quot;*&quot;,&quot;.&quot;],
-
+<strong>Input:</strong> boxGrid = [[&quot;#&quot;,&quot;.&quot;,&quot;*&quot;,&quot;.&quot;],
 &nbsp;             [&quot;#&quot;,&quot;#&quot;,&quot;*&quot;,&quot;.&quot;]]
-
 <strong>Output:</strong> [[&quot;#&quot;,&quot;.&quot;],
-
 &nbsp;        [&quot;#&quot;,&quot;#&quot;],
-
 &nbsp;        [&quot;*&quot;,&quot;*&quot;],
-
 &nbsp;        [&quot;.&quot;,&quot;.&quot;]]
-
 </pre>
 
 <p><strong class="example">Example 3:</strong></p>
 
 <p><a class="glightbox" href="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1800-1899/1861.Rotating%20the%20Box/images/rotatingtheboxleetcode3withstone.png" 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/1800-1899/1861.Rotating%20the%20Box/images/rotatingtheboxleetcode3withstone.png" style="width: 400px; height: 218px;" /></a></p>
 
 <pre>
-
-<strong>Input:</strong> box = [[&quot;#&quot;,&quot;#&quot;,&quot;*&quot;,&quot;.&quot;,&quot;*&quot;,&quot;.&quot;],
-
+<strong>Input:</strong> boxGrid = [[&quot;#&quot;,&quot;#&quot;,&quot;*&quot;,&quot;.&quot;,&quot;*&quot;,&quot;.&quot;],
 &nbsp;             [&quot;#&quot;,&quot;#&quot;,&quot;#&quot;,&quot;*&quot;,&quot;.&quot;,&quot;.&quot;],
-
 &nbsp;             [&quot;#&quot;,&quot;#&quot;,&quot;#&quot;,&quot;.&quot;,&quot;#&quot;,&quot;.&quot;]]
-
 <strong>Output:</strong> [[&quot;.&quot;,&quot;#&quot;,&quot;#&quot;],
-
 &nbsp;        [&quot;.&quot;,&quot;#&quot;,&quot;#&quot;],
-
 &nbsp;        [&quot;#&quot;,&quot;#&quot;,&quot;*&quot;],
-
 &nbsp;        [&quot;#&quot;,&quot;*&quot;,&quot;.&quot;],
-
 &nbsp;        [&quot;#&quot;,&quot;.&quot;,&quot;*&quot;],
-
 &nbsp;        [&quot;#&quot;,&quot;.&quot;,&quot;.&quot;]]
-
 </pre>
 
 <p>&nbsp;</p>
-
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
-    <li><code>m == box.length</code></li>
-
-    <li><code>n == box[i].length</code></li>
-
+    <li><code>m == boxGrid.length</code></li>
+    <li><code>n == boxGrid[i].length</code></li>
     <li><code>1 &lt;= m, n &lt;= 500</code></li>
-
-    <li><code>box[i][j]</code> is either <code>&#39;#&#39;</code>, <code>&#39;*&#39;</code>, or <code>&#39;.&#39;</code>.</li>
-
+    <li><code>boxGrid[i][j]</code> is either <code>&#39;#&#39;</code>, <code>&#39;*&#39;</code>, or <code>&#39;.&#39;</code>.</li>
 </ul>
 
 <!-- description:end -->

en/lc/1891/index.html

@@ -80689,9 +80689,7 @@ <h2 id="description">Description</h2>
 
 </ul>
 
-<p>Your goal is to obtain <code>k</code> ribbons of all the <strong>same positive integer length</strong>. You are allowed to throw away any excess ribbon as a result of cutting.</p>
-
-<p>Return <em>the <strong>maximum</strong> possible positive integer length that you can obtain </em><code>k</code><em> ribbons of</em><em>, or </em><code>0</code><em> if you cannot obtain </em><code>k</code><em> ribbons of the same length</em>.</p>
+<p>Your task is to determine the <strong>maximum</strong> length of ribbon, <code>x</code>, that allows you to cut <em>exactly</em> <code>k</code> ribbons, each of length <code>x</code>. You can discard any leftover ribbon from the cuts. If it is <strong>impossible</strong> to cut <code>k</code> ribbons of the same length, return 0.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

en/lc/2064/index.html

@@ -80636,6 +80636,12 @@
 
 
 
+      <a href="../../tags/#greedy" class="md-tag">Greedy</a>
+    
+  
+    
+    
+    
       <a href="../../tags/#array" class="md-tag">Array</a>
 
 

en/lc/2107/index.html

@@ -80722,7 +80722,7 @@ <h2 id="description">Description</h2>
 <p><strong>Constraints:</strong></p>
 
 <ul>
-    <li><code>1 &lt;= candies.length &lt;= 10<sup>5</sup></code></li>
+    <li><code>0 &lt;= candies.length &lt;= 10<sup>5</sup></code></li>
     <li><code>1 &lt;= candies[i] &lt;= 10<sup>5</sup></code></li>
     <li><code>0 &lt;= k &lt;= candies.length</code></li>
 </ul>

en/lc/2537/index.html

@@ -80681,7 +80681,7 @@ <h2 id="description">Description</h2>
 
 <p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the number of <strong>good</strong> subarrays of</em> <code>nums</code>.</p>
 
-<p>A subarray <code>arr</code> is <strong>good</strong> if it there are <strong>at least </strong><code>k</code> pairs of indices <code>(i, j)</code> such that <code>i &lt; j</code> and <code>arr[i] == arr[j]</code>.</p>
+<p>A subarray <code>arr</code> is <strong>good</strong> if there are <strong>at least </strong><code>k</code> pairs of indices <code>(i, j)</code> such that <code>i &lt; j</code> and <code>arr[i] == arr[j]</code>.</p>
 
 <p>A <strong>subarray</strong> is a contiguous <strong>non-empty</strong> sequence of elements within an array.</p>
 

en/lc/2577/index.html

@@ -80746,7 +80746,7 @@ <h2 id="description">Description</h2>
 </ul>
 
 <p>&nbsp;</p>
-<style type="text/css">.spoilerbutton {display:block; border:dashed; padding: 0px 0px; margin:10px 0px; font-size:150%; font-weight: bold; color:#000000; background-color:cyan; outline:0;
+<style type="text/css">.spoilerbutton {display:block; border:dashed; padding: 0px 0px; margin:10px 0px; font-size:150%; font-weight: bold; color:#000000; background-color:cyan; outline:0; 
 }
 .spoiler {overflow:hidden;}
 .spoiler > div {-webkit-transition: all 0s ease;-moz-transition: margin 0s ease;-o-transition: all 0s ease;transition: margin 0s ease;}
@@ -81212,14 +81212,14 @@ <h3 id="solution-1-shortest-path-priority-queue-min-heap">Solution 1: Shortest P
 
     <nav>
 
-        <a href="https://github.com/rain84" class="md-author" title="@rain84">
+        <a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
 
-          <img src="https://avatars.githubusercontent.com/u/1732547?v=4&size=72" alt="rain84">
+          <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/rain84" class="md-author" title="@rain84">
 
-          <img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
+          <img src="https://avatars.githubusercontent.com/u/1732547?v=4&size=72" alt="rain84">
         </a>
 
 

en/lc/277/index.html

@@ -80683,10 +80683,12 @@ <h2 id="description">Description</h2>
 
 <p>Now you want to find out who the celebrity is or verify that there is not one. You are only allowed to ask questions like: &quot;Hi, A. Do you know B?&quot; to get information about whether A knows B. You need to find out the celebrity (or verify there is not one) by asking as few questions as possible (in the asymptotic sense).</p>
 
-<p>You are given a helper function <code>bool knows(a, b)</code> that tells you whether <code>a</code> knows <code>b</code>. Implement a function <code>int findCelebrity(n)</code>. There will be exactly one celebrity if they are at the party.</p>
+<p>You are given an integer <code>n</code> and a helper function <code>bool knows(a, b)</code> that tells you whether <code>a</code> knows <code>b</code>. Implement a function <code>int findCelebrity(n)</code>. There will be exactly one celebrity if they are at the party.</p>
 
 <p>Return <em>the celebrity&#39;s label if there is a celebrity at the party</em>. If there is no celebrity, return <code>-1</code>.</p>
 
+<p><strong>Note</strong> that the <code>n x n</code> 2D array <code>graph</code> given as input is <strong>not</strong> directly available to you, and instead <strong>only</strong> accessible through the helper function <code>knows</code>. <code>graph[i][j] == 1</code> represents person <code>i</code> knows person <code>j</code>, wherease <code>graph[i][j] == 0</code> represents person <code>j</code> does not know person <code>i</code>.</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/0200-0299/0277.Find%20the%20Celebrity/images/g1.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/0200-0299/0277.Find%20the%20Celebrity/images/g1.jpg" style="width: 224px; height: 145px;" /></a></p>

en/lc/364/index.html

@@ -80713,6 +80713,7 @@ <h2 id="description">Description</h2>
     <li><code>1 &lt;= nestedList.length &lt;= 50</code></li>
     <li>The values of the integers in the nested list is in the range <code>[-100, 100]</code>.</li>
     <li>The maximum <strong>depth</strong> of any integer is less than or equal to <code>50</code>.</li>
+    <li>There are no empty lists.</li>
 </ul>
 
 <!-- description:end -->

en/lc/773/index.html

@@ -80651,12 +80651,30 @@
 
 
 
+      <a href="../../tags/#memoization" class="md-tag">Memoization</a>
+    
+  
+    
+    
+    
       <a href="../../tags/#array" class="md-tag">Array</a>
 
 
 
 
 
+      <a href="../../tags/#dynamic-programming" class="md-tag">Dynamic Programming</a>
+    
+  
+    
+    
+    
+      <a href="../../tags/#backtracking" class="md-tag">Backtracking</a>
+    
+  
+    
+    
+    
       <a href="../../tags/#matrix" class="md-tag">Matrix</a>