diff --git a/solution/0400-0499/0431.Encode N-ary Tree to Binary Tree/README.md b/solution/0400-0499/0431.Encode N-ary Tree to Binary Tree/README.md index 891dc6e22048d..cf118de586745 100644 --- a/solution/0400-0499/0431.Encode N-ary Tree to Binary Tree/README.md +++ b/solution/0400-0499/0431.Encode N-ary Tree to Binary Tree/README.md @@ -26,16 +26,47 @@ tags:
-
+
+输入：root = [1,null,3,2,4,null,5,6] ++
注意，上面的方法仅仅是一个例子，可能可行也可能不可行。你没有必要遵循这种形式转化，你可以自己创造和实现不同的方法。
-注意：
++ +
示例 1：
+ ++输入：root = [1,null,3,2,4,null,5,6] +输出：[1,null,3,2,4,null,5,6] ++ +
示例 2：
+ ++输入：root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14] +输出：[1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14] ++ +
示例 3：
+ ++输入：root = [] +输出：[] ++ +
+ +
提示：
-
-
N的范围在[1, 1000]
+ N的范围在[1, 104]
+ 0 <= Node.val <= 104
+ - N 叉树的高度小于等于
1000。 - 不要使用类成员 / 全局变量 / 静态变量来存储状态。你的编码和解码算法应是无状态的。
class Node {
public boolean val;
- public boolean isLeaf;
- public Node topLeft;
- public Node topRight;
- public Node bottomLeft;
- public Node bottomRight;
+ public boolean isLeaf;
+ public Node topLeft;
+ public Node topRight;
+ public Node bottomLeft;
+ public Node bottomRight;
}
我们可以按以下步骤为二维区域构建四叉树：
@@ -60,9 +60,9 @@ class Node {它与二叉树的序列化非常相似。唯一的区别是节点以列表形式表示 [isLeaf, val] 。
如果 isLeaf 或者 val 的值为 True ，则表示它在列表 [isLeaf, val] 中的值为 1 ；如果 isLeaf 或者 val 的值为 False ，则表示值为 0 。
如果 isLeaf 或者 val 的值为 True ，则表示它在列表 [isLeaf, val] 中的值为 1 ；如果 isLeaf 或者 val 的值为 False ，则表示值为 0 。
+
示例 1：
@@ -88,37 +88,13 @@ class Node { 结果矩阵大小为 1*1，值全为 0 。 -示例 3：
- --输入：quadTree1 = [[0,0],[1,0],[1,0],[1,1],[1,1]] -, quadTree2 = [[0,0],[1,1],[1,1],[1,0],[1,1]] -输出：[[1,1]] -- -
示例 4：
- --输入：quadTree1 = [[0,0],[1,1],[1,0],[1,1],[1,1]] -, quadTree2 = [[0,0],[1,1],[0,1],[1,1],[1,1],null,null,null,null,[1,1],[1,0],[1,0],[1,1]] -输出：[[0,0],[1,1],[0,1],[1,1],[1,1],null,null,null,null,[1,1],[1,0],[1,0],[1,1]] -- -
示例 5：
- --输入：quadTree1 = [[0,1],[1,0],[0,1],[1,1],[1,0],null,null,null,null,[1,0],[1,0],[1,1],[1,1]] -, quadTree2 = [[0,1],[0,1],[1,0],[1,1],[1,0],[1,0],[1,0],[1,1],[1,1]] -输出：[[0,0],[0,1],[0,1],[1,1],[1,0],[1,0],[1,0],[1,1],[1,1],[1,0],[1,0],[1,1],[1,1]] -- -
+
提示：
quadTree1和quadTree2都是符合题目要求的四叉树，每个都代表一个n * n的矩阵。
- n == 2^x，其中0 <= x <= 9.
+ n == 2x，其中0 <= x <= 9.
- 给定的 N 叉树的深度小于或等于
1000。
- - 节点的总个数在
[0, 10^4]之间
+ - 节点的总个数在
[0, 104]之间
diff --git a/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README.md b/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README.md index 2199ea70bd3e9..21c47458df022 100644 --- a/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README.md +++ b/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README.md @@ -5,7 +5,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/1600-1699/1612.Ch tags: - 树 - 深度优先搜索 + - 哈希表 - 二叉树 + - 计数 --- diff --git a/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README_EN.md b/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README_EN.md index 900d2ba2ec4b5..4297af217b4f1 100644 --- a/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README_EN.md +++ b/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README_EN.md @@ -5,7 +5,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/1600-1699/1612.Ch tags: - Tree - Depth-First Search + - Hash Table - Binary Tree + - Counting --- diff --git a/solution/1600-1699/1625.Lexicographically Smallest String After Applying Operations/README.md b/solution/1600-1699/1625.Lexicographically Smallest String After Applying Operations/README.md index b627d70c31348..46c2a2f6d59c5 100644 --- a/solution/1600-1699/1625.Lexicographically Smallest String After Applying Operations/README.md +++ b/solution/1600-1699/1625.Lexicographically Smallest String After Applying Operations/README.md @@ -5,8 +5,10 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/1600-1699/1625.Le rating: 1992 source: 第 211 场周赛 Q2 tags: + - 深度优先搜索 - 广度优先搜索 - 字符串 + - 枚举 --- diff --git a/solution/1600-1699/1625.Lexicographically Smallest String After Applying Operations/README_EN.md b/solution/1600-1699/1625.Lexicographically Smallest String After Applying Operations/README_EN.md index 6f4cd47f3bedd..93fbdf73b2432 100644 --- a/solution/1600-1699/1625.Lexicographically Smallest String After Applying Operations/README_EN.md +++ b/solution/1600-1699/1625.Lexicographically Smallest String After Applying Operations/README_EN.md @@ -5,8 +5,10 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/1600-1699/1625.Le rating: 1992 source: Weekly Contest 211 Q2 tags: + - Depth-First Search - Breadth-First Search - String + - Enumeration --- diff --git a/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README.md b/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README.md index ec3919c0c1466..2288b3815533c 100644 --- a/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README.md +++ b/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README.md @@ -6,6 +6,7 @@ tags: - 栈 - 树 - 设计 + - 数组 - 数学 - 二叉树 --- diff --git a/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README_EN.md b/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README_EN.md index 938ba824d3fd7..1934da2fa2231 100644 --- a/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README_EN.md +++ b/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README_EN.md @@ -6,6 +6,7 @@ tags: - Stack - Tree - Design + - Array - Math - Binary Tree --- diff --git a/solution/1600-1699/1638.Count Substrings That Differ by One Character/README.md b/solution/1600-1699/1638.Count Substrings That Differ by One Character/README.md index ea2ad082ae243..206abc3120c8a 100644 --- a/solution/1600-1699/1638.Count Substrings That Differ by One Character/README.md +++ b/solution/1600-1699/1638.Count Substrings That Differ by One Character/README.md @@ -8,6 +8,7 @@ tags: - 哈希表 - 字符串 - 动态规划 + - 枚举 --- diff --git a/solution/1600-1699/1638.Count Substrings That Differ by One Character/README_EN.md b/solution/1600-1699/1638.Count Substrings That Differ by One Character/README_EN.md index a5f65c97d2e07..25a42ac17a2a3 100644 --- a/solution/1600-1699/1638.Count Substrings That Differ by One Character/README_EN.md +++ b/solution/1600-1699/1638.Count Substrings That Differ by One Character/README_EN.md @@ -8,6 +8,7 @@ tags: - Hash Table - String - Dynamic Programming + - Enumeration --- diff --git a/solution/2600-2699/2644.Find the Maximum Divisibility Score/README.md b/solution/2600-2699/2644.Find the Maximum Divisibility Score/README.md index d4d7b6f5882e6..d915e2ac4716e 100644 --- a/solution/2600-2699/2644.Find the Maximum Divisibility Score/README.md +++ b/solution/2600-2699/2644.Find the Maximum Divisibility Score/README.md @@ -37,13 +37,13 @@ tags:
divisors[0] 的可整除性分数为 2 因为 nums[2] 和 nums[3] 能被 5 整除。
divisors[1] 的可整除性分数为 1 因为只有 nums[1] 能被 3 整除。
divisors[1] 的可整除性分数为 2 因为 nums[1] 和 nums[2] 能被 3 整除。
divisors[2] 的可整除性分数为 0 因为 nums 中没有数字能被 7 整除。
divisors[3] 的可整除性分数为 2 因为 nums[0] 和 nums[3] 能够被 2 整除。
因为 divisors[0] 和 divisors[3] 有相同的可整除性分数，我们返回更小的那个 divisors[3]。
因为 divisors[0] 、divisor[1] 和 divisors[3] 有相同的可整除性分数，我们返回更小的那个 divisors[3]。
示例 2：
@@ -71,13 +71,13 @@ tags:解释：
-divisors[0] 的可整除性分数为 0 因为 nums 中没有数字能被 10 整除。
divisors[0] 的可整除性分数为 2 因为 nums[0] 和 nums[3] 能被 10 整除。
divisors[1] 的可整除性分数为 0 因为 nums 中没有数字能被 16 整除。
divisors[2] 的可整除性分数为 0 因为 nums 中没有数字能被 20 整除。
divisors[2] 的可整除性分数为 1 因为 nums[0] 能被 20 整除。
因为 divisors[0]，divisors[1] 和 divisors[2] 都有相同的可整除性分数，我们返回最小的那个 divisors[0]。
因为 divisors[0] 的可整除性分数最大，我们返回 divisors[0]。