feat: update lc problems

Author: yanglbme

solution/0300-0399/0314.Binary Tree Vertical Order Traversal/README.md

@@ -28,25 +28,24 @@ tags:
 <p>&nbsp;</p>
 
 <p><strong class="example">示例 1：</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/images/vtree1.jpg" style="width: 282px; height: 301px;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/images/1727276130-UOKFsu-image.png" style="width: 400px; height: 273px;" />
 <pre>
 <strong>输入：</strong>root = [3,9,20,null,null,15,7]
 <strong>输出：</strong>[[9],[3,15],[20],[7]]
 </pre>
 
 <p><strong class="example">示例 2：</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/images/vtree2-1.jpg" style="width: 462px; height: 222px;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/images/1727276212-bzuKab-image.png" style="width: 400px; height: 253px;" />
 <pre>
 <strong>输入：</strong>root = [3,9,8,4,0,1,7]
 <strong>输出：</strong>[[4],[9],[3,0,1],[8],[7]]
 </pre>
 
 <p><strong class="example">示例 3：</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/images/vtree2.jpg" style="width: 462px; height: 302px;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/images/1727276242-EGdtNz-image.png" style="width: 400px; height: 391px;" />
 <pre>
-<strong>输入：</strong>root = [3,9,8,4,0,1,7,null,null,null,2,5]
-<strong>输出：</strong>[[4],[9,5],[3,0,1],[8,2],[7]]
-</pre>
+<strong>输入：</strong>root = [1,2,3,4,10,9,11,null,5,null,null,null,null,null,null,null,6]
+<strong>输出：</strong>[[4],[2,5],[1,10,9,6],[3],[11]]</pre>
 
 <p>&nbsp;</p>
 

solution/0300-0399/0314.Binary Tree Vertical Order Traversal/images/1727276130-UOKFsu-image.png

@@ -54,14 +54,14 @@ tags:
 [null, [0, 0], [], true, false]
 
 <strong>Explanation</strong>
-BookMyShow bms = new BookMyShow(2, 5); // There are 2 rows with 5 seats each
+BookMyShow bms = new BookMyShow(2, 5); // There are 2 rows with 5 seats each 
 bms.gather(4, 0); // return [0, 0]
-                  // The group books seats [0, 3] of row 0.
+                  // The group books seats [0, 3] of row 0. 
 bms.gather(2, 0); // return []
                   // There is only 1 seat left in row 0,
-                  // so it is not possible to book 2 consecutive seats.
+                  // so it is not possible to book 2 consecutive seats. 
 bms.scatter(5, 1); // return True
-                   // The group books seat 4 of row 0 and seats [0, 3] of row 1.
+                   // The group books seat 4 of row 0 and seats [0, 3] of row 1. 
 bms.scatter(5, 1); // return False
                    // There is only one seat left in the hall.
 </pre>

solution/0300-0399/0314.Binary Tree Vertical Order Traversal/images/1727276212-bzuKab-image.png

@@ -23,7 +23,7 @@ tags:
 
 <p>给你一个长度为 <code>n</code> 的数组 <code>words</code> ，该数组由 <strong>非空</strong> 字符串组成。</p>
 
-<p>定义字符串 <code>word</code> 的 <strong>分数</strong> 等于以 <code>word</code> 作为 <strong>前缀</strong> 的 <code>words[i]</code> 的数目。</p>
+<p>定义字符串 <code>term</code> 的 <strong>分数</strong> 等于以 <code>term</code> 作为 <strong>前缀</strong> 的 <code>words[i]</code> 的数目。</p>
 
 <ul>
 	<li>例如，如果 <code>words = ["a", "ab", "abc", "cab"]</code> ，那么 <code>"ab"</code> 的分数是 <code>2</code> ，因为 <code>"ab"</code> 是 <code>"ab"</code> 和 <code>"abc"</code> 的一个前缀。</li>
@@ -37,7 +37,8 @@ tags:
 
 <p><strong>示例 1：</strong></p>
 
-<pre><strong>输入：</strong>words = ["abc","ab","bc","b"]
+<pre>
+<strong>输入：</strong>words = ["abc","ab","bc","b"]
 <strong>输出：</strong>[5,4,3,2]
 <strong>解释：</strong>对应每个字符串的答案如下：
 - "abc" 有 3 个前缀："a"、"ab" 和 "abc" 。
@@ -56,7 +57,8 @@ tags:
 
 <p><strong>示例 2：</strong></p>
 
-<pre><strong>输入：</strong>words = ["abcd"]
+<pre>
+<strong>输入：</strong>words = ["abcd"]
 <strong>输出：</strong>[4]
 <strong>解释：</strong>
 "abcd" 有 4 个前缀 "a"、"ab"、"abc" 和 "abcd"。

solution/0300-0399/0314.Binary Tree Vertical Order Traversal/images/1727276242-EGdtNz-image.png

@@ -23,7 +23,7 @@ tags:
 
 <p>You are given an array <code>words</code> of size <code>n</code> consisting of <strong>non-empty</strong> strings.</p>
 
-<p>We define the <strong>score</strong> of a string <code>word</code> as the <strong>number</strong> of strings <code>words[i]</code> such that <code>word</code> is a <strong>prefix</strong> of <code>words[i]</code>.</p>
+<p>We define the <strong>score</strong> of a string <code>term</code> as the <strong>number</strong> of strings <code>words[i]</code> such that <code>term</code> is a <strong>prefix</strong> of <code>words[i]</code>.</p>
 
 <ul>
 	<li>For example, if <code>words = [&quot;a&quot;, &quot;ab&quot;, &quot;abc&quot;, &quot;cab&quot;]</code>, then the score of <code>&quot;ab&quot;</code> is <code>2</code>, since <code>&quot;ab&quot;</code> is a prefix of both <code>&quot;ab&quot;</code> and <code>&quot;abc&quot;</code>.</li>