feat: update lc problems (#4002)

Author: yanglbme

solution/0200-0299/0238.Product of Array Except Self/README.md

@@ -46,7 +46,7 @@ tags:
 <ul>
 	<li><code>2 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
 	<li><code>-30 &lt;= nums[i] &lt;= 30</code></li>
-	<li><strong>保证</strong> 数组&nbsp;<code>nums</code>之中任意元素的全部前缀元素和后缀的乘积都在&nbsp; <strong>32 位</strong> 整数范围内</li>
+	<li>输入&nbsp;<strong>保证</strong> 数组&nbsp;<code>answer[i]</code>&nbsp;在&nbsp; <strong>32 位</strong> 整数范围内</li>
 </ul>
 
 <p>&nbsp;</p>

solution/0500-0599/0554.Brick Wall/README.md

@@ -23,10 +23,10 @@ tags:
 
 <p>给你一个二维数组 <code>wall</code> ，该数组包含这堵墙的相关信息。其中，<code>wall[i]</code> 是一个代表从左至右每块砖的宽度的数组。你需要找出怎样画才能使这条线 <strong>穿过的砖块数量最少</strong> ，并且返回 <strong>穿过的砖块数量</strong> 。</p>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0500-0599/0554.Brick%20Wall/images/cutwall-grid.jpg" style="width: 493px; height: 577px;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0500-0599/0554.Brick%20Wall/images/a.png" style="width: 400px; height: 384px;" />
 <pre>
 <strong>输入：</strong>wall = [[1,2,2,1],[3,1,2],[1,3,2],[2,4],[3,1,2],[1,3,1,1]]
 <strong>输出：</strong>2
@@ -39,15 +39,17 @@ tags:
 <strong>输出：</strong>3
 </pre>
 
+&nbsp;
+
 <p><strong>提示：</strong></p>
 
 <ul>
 	<li><code>n == wall.length</code></li>
-	<li><code>1 <= n <= 10<sup>4</sup></code></li>
-	<li><code>1 <= wall[i].length <= 10<sup>4</sup></code></li>
-	<li><code>1 <= sum(wall[i].length) <= 2 * 10<sup>4</sup></code></li>
+	<li><code>1 &lt;= n &lt;= 10<sup>4</sup></code></li>
+	<li><code>1 &lt;= wall[i].length &lt;= 10<sup>4</sup></code></li>
+	<li><code>1 &lt;= sum(wall[i].length) &lt;= 2 * 10<sup>4</sup></code></li>
 	<li>对于每一行 <code>i</code> ，<code>sum(wall[i])</code> 是相同的</li>
-	<li><code>1 <= wall[i][j] <= 2<sup>31</sup> - 1</code></li>
+	<li><code>1 &lt;= wall[i][j] &lt;= 2<sup>31</sup> - 1</code></li>
 </ul>
 
 <!-- description:end -->

solution/0900-0999/0906.Super Palindromes/README.md

@@ -4,6 +4,7 @@ difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0900-0999/0906.Super%20Palindromes/README.md
 tags:
     - 数学
+    - 字符串
     - 枚举
 ---
 

solution/0900-0999/0906.Super Palindromes/README_EN.md

@@ -4,6 +4,7 @@ difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0900-0999/0906.Super%20Palindromes/README_EN.md
 tags:
     - Math
+    - String
     - Enumeration
 ---
 

solution/1000-1099/1023.Camelcase Matching/README.md

@@ -24,7 +24,7 @@ tags:
 
 <p>给你一个字符串数组 <code>queries</code>，和一个表示模式的字符串&nbsp;<code>pattern</code>，请你返回一个布尔数组 <code>answer</code> 。只有在待查项&nbsp;<code>queries[i]</code> 与模式串&nbsp;<code>pattern</code> 匹配时，&nbsp;<code>answer[i]</code>&nbsp;才为 <code>true</code>，否则为 <code>false</code>。</p>
 
-<p>如果可以将<strong>小写字母</strong>插入模式串&nbsp;<code>pattern</code>&nbsp;得到待查询项&nbsp;<code>queries[i]</code>，那么待查询项与给定模式串匹配。可以在任何位置插入每个字符，也可以不插入字符。</p>
+<p>如果可以将&nbsp;<strong>小写字母&nbsp;</strong>插入模式串&nbsp;<code>pattern</code>&nbsp;得到待查询项&nbsp;<code>queries[i]</code>，那么待查询项与给定模式串匹配。您可以在模式串中的任何位置插入字符，也可以选择不插入任何字符。</p>
 
 <p>&nbsp;</p>
 

solution/1000-1099/1023.Camelcase Matching/README_EN.md

@@ -24,7 +24,7 @@ tags:
 
 <p>Given an array of strings <code>queries</code> and a string <code>pattern</code>, return a boolean array <code>answer</code> where <code>answer[i]</code> is <code>true</code> if <code>queries[i]</code> matches <code>pattern</code>, and <code>false</code> otherwise.</p>
 
-<p>A query word <code>queries[i]</code> matches <code>pattern</code> if you can insert lowercase English letters pattern so that it equals the query. You may insert each character at any position and you may not insert any characters.</p>
+<p>A query word <code>queries[i]</code> matches <code>pattern</code> if you can insert lowercase English letters into the pattern so that it equals the query. You may insert a character at any position in pattern or you may choose not to insert any characters <strong>at all</strong>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/1100-1199/1183.Maximum Number of Ones/README.md

@@ -6,6 +6,8 @@ rating: 2366
 source: 第 8 场双周赛 Q4
 tags:
     - 贪心
+    - 数学
+    - 排序
     - 堆（优先队列）
 ---
 

solution/1100-1199/1183.Maximum Number of Ones/README_EN.md

@@ -6,6 +6,8 @@ rating: 2366
 source: Biweekly Contest 8 Q4
 tags:
     - Greedy
+    - Math
+    - Sorting
     - Heap (Priority Queue)
 ---
 

solution/1400-1499/1400.Construct K Palindrome Strings/README.md

@@ -21,7 +21,7 @@ tags:
 
 <!-- description:start -->
 
-<p>给你一个字符串 <code>s</code>&nbsp;和一个整数 <code>k</code>&nbsp;。请你用 <code>s</code>&nbsp;字符串中 <strong>所有字符</strong>&nbsp;构造 <code>k</code>&nbsp;个非空 <span data-keyword="palindrome-string">回文串</span>&nbsp;。</p>
+<p>给你一个字符串 <code>s</code>&nbsp;和一个整数 <code>k</code>&nbsp;。请你用 <code>s</code>&nbsp;字符串中 <strong>所有字符</strong>&nbsp;构造 <code>k</code>&nbsp;个<strong>非空</strong> <span data-keyword="palindrome-string">回文串</span>&nbsp;。</p>
 
 <p>如果你可以用&nbsp;<code>s</code>&nbsp;中所有字符构造&nbsp;<code>k</code>&nbsp;个回文字符串，那么请你返回 <strong>True</strong>&nbsp;，否则返回&nbsp;<strong>False</strong>&nbsp;。</p>
 

solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README.md

@@ -9,6 +9,7 @@ tags:
     - 数组
     - 动态规划
     - 矩阵
+    - 前缀和
 ---
 
 <!-- problem:start -->