feat: update lc problems (doocs#4022)

Author: yanglbme

solution/0000-0099/0047.Permutations II/README.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/0000-0099/0047.Pe
 tags:
     - 数组
     - 回溯
+    - 排序
 ---
 
 <!-- problem:start -->

solution/0000-0099/0047.Permutations II/README_EN.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/0000-0099/0047.Pe
 tags:
     - Array
     - Backtracking
+    - Sorting
 ---
 
 <!-- problem:start -->

solution/0600-0699/0691.Stickers to Spell Word/README.md

@@ -4,7 +4,9 @@ difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README.md
 tags:
     - 位运算
+    - 记忆化搜索
     - 数组
+    - 哈希表
     - 字符串
     - 动态规划
     - 回溯

solution/0600-0699/0691.Stickers to Spell Word/README_EN.md

@@ -4,7 +4,9 @@ difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README_EN.md
 tags:
     - Bit Manipulation
+    - Memoization
     - Array
+    - Hash Table
     - String
     - Dynamic Programming
     - Backtracking

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

@@ -18,33 +18,40 @@ tags:
 
 <!-- description:start -->
 
-<p>如果一个正整数自身是回文数，而且它也是一个回文数的平方，那么我们称这个数为超级回文数。</p>
+<p>如果一个正整数自身是回文数，而且它也是一个回文数的平方，那么我们称这个数为 <strong>超级回文数</strong> 。</p>
 
-<p>现在，给定两个正整数&nbsp;<code>L</code> 和&nbsp;<code>R</code> （以字符串形式表示），返回包含在范围 <code>[L, R]</code> 中的超级回文数的数目。</p>
+<p>现在，给你两个以字符串形式表示的正整数 <font color="#c7254e" face="Menlo, Monaco, Consolas, Courier New, monospace"><span style="caret-color: rgb(199, 37, 78); font-size: 12.6px; background-color: rgb(249, 242, 244);">left</span></font>&nbsp;和 <font color="#c7254e" face="Menlo, Monaco, Consolas, Courier New, monospace"><span style="caret-color: rgb(199, 37, 78); font-size: 12.6px; background-color: rgb(249, 242, 244);">right</span></font>&nbsp; ，统计并返回区间&nbsp;<code>[left, right]</code> 中的 <strong>超级回文数</strong> 的数目。</p>
 
 <p>&nbsp;</p>
 
-<p><strong>示例：</strong></p>
+<p><b>示例 1：</b></p>
 
-<pre><strong>输入：</strong>L = &quot;4&quot;, R = &quot;1000&quot;
-<strong>输出：</strong>4
-<strong>解释：
-</strong>4，9，121，以及 484 是超级回文数。
-注意 676 不是一个超级回文数： 26 * 26 = 676，但是 26 不是回文数。</pre>
+<pre>
+<b>输入：</b>left = "4", right = "1000"
+<b>输出：</b>4
+<b>解释：</b>4、9、121 和 484 都是超级回文数。
+注意 676 不是超级回文数：26 * 26 = 676 ，但是 26 不是回文数。
+</pre>
 
-<p>&nbsp;</p>
-
-<p><strong>提示：</strong></p>
+<p><b>示例 2：</b></p>
 
-<ol>
-	<li><code>1 &lt;= len(L) &lt;= 18</code></li>
-	<li><code>1 &lt;= len(R) &lt;= 18</code></li>
-	<li><code>L</code> 和&nbsp;<code>R</code>&nbsp;是表示&nbsp;<code>[1, 10^18)</code>&nbsp;范围的整数的字符串。</li>
-	<li><code>int(L) &lt;= int(R)</code></li>
-</ol>
+<pre>
+<b>输入：</b>left = "1", right = "2"
+<b>输出：</b>1
+</pre>
 
 <p>&nbsp;</p>
 
+<p><b>提示：</b></p>
+
+<ul>
+	<li><code>1 &lt;= left.length, right.length &lt;= 18</code></li>
+	<li><code>left</code>&nbsp;和&nbsp;<code>right</code>&nbsp;仅由数字（0 - 9）组成。</li>
+	<li><code>left</code>&nbsp;和&nbsp;<code>right</code>&nbsp;不含前导零。</li>
+	<li><code>left</code>&nbsp;和&nbsp;<code>right</code>&nbsp;表示的整数在区间&nbsp;<code>[1, 10<sup>18</sup> - 1]</code> 内。</li>
+	<li><code>left</code>&nbsp;小于等于&nbsp;<code>right</code>&nbsp;。</li>
+</ul>
+
 <!-- description:end -->
 
 ## 解法

solution/1700-1799/1752.Check if Array Is Sorted and Rotated/README_EN.md

@@ -31,7 +31,7 @@ tags:
 <strong>Input:</strong> nums = [3,4,5,1,2]
 <strong>Output:</strong> true
 <strong>Explanation:</strong> [1,2,3,4,5] is the original sorted array.
-You can rotate the array by x = 3 positions to begin on the the element of value 3: [3,4,5,1,2].
+You can rotate the array by x = 3 positions to begin on the element of value 3: [3,4,5,1,2].
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
@@ -51,6 +51,24 @@ You can rotate the array by x = 3 positions to begin on the the element of value
 You can rotate the array by x = 0 positions (i.e. no rotation) to make nums.
 </pre>
 
+<div class="simple-translate-system-theme" id="simple-translate">
+<div>
+<div class="simple-translate-button " style="background-image: url(&quot;moz-extension://8a9ffb6b-7e69-4e93-aae1-436a1448eff6/icons/512.png&quot;); height: 22px; width: 22px; top: 10px; left: 10px;">&nbsp;</div>
+
+<div class="simple-translate-panel " style="width: 300px; height: 200px; top: 0px; left: 0px; font-size: 13px;">
+<div class="simple-translate-result-wrapper" style="overflow: hidden;">
+<div class="simple-translate-move" draggable="true">&nbsp;</div>
+
+<div class="simple-translate-result-contents">
+<p class="simple-translate-result" dir="auto">&nbsp;</p>
+
+<p class="simple-translate-candidate" dir="auto">&nbsp;</p>
+</div>
+</div>
+</div>
+</div>
+</div>
+
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>
 

solution/1900-1999/1911.Maximum Alternating Subsequence Sum/README.md

@@ -11,7 +11,7 @@ tags:
 
 <!-- problem:start -->
 
-# [1911. 最大子序列交替和](https://leetcode.cn/problems/maximum-alternating-subsequence-sum)
+# [1911. 最大交替子序列和](https://leetcode.cn/problems/maximum-alternating-subsequence-sum)
 
 [English Version](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README_EN.md)
 

solution/2300-2399/2360.Longest Cycle in a Graph/README.md

@@ -6,6 +6,7 @@ rating: 1897
 source: 第 304 场周赛 Q4
 tags:
     - 深度优先搜索
+    - 广度优先搜索
     - 图
     - 拓扑排序
 ---

solution/2300-2399/2360.Longest Cycle in a Graph/README_EN.md

@@ -6,6 +6,7 @@ rating: 1897
 source: Weekly Contest 304 Q4
 tags:
     - Depth-First Search
+    - Breadth-First Search
     - Graph
     - Topological Sort
 ---

solution/2400-2499/2493.Divide Nodes Into the Maximum Number of Groups/README.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/2400-2499/2493.Di
 rating: 2415
 source: 第 322 场周赛 Q4
 tags:
+    - 深度优先搜索
     - 广度优先搜索
     - 并查集
     - 图