一刷1022

Author: diguage

README.adoc

@@ -7179,14 +7179,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/1021-remove-outermost-parentheses.adoc[题解]
 //|Easy
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/sum-of-root-to-leaf-binary-numbers/[1022. Sum of Root To Leaf Binary Numbers^]
-//|{source_base_url}/_1022_SumOfRootToLeafBinaryNumbers.java[Java]
-//|{doc_base_url}/1022-sum-of-root-to-leaf-binary-numbers.adoc[题解]
-//|Easy
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/sum-of-root-to-leaf-binary-numbers/[1022. Sum of Root To Leaf Binary Numbers^]
+|{source_base_url}/_1022_SumOfRootToLeafBinaryNumbers.java[Java]
+|{doc_base_url}/1022-sum-of-root-to-leaf-binary-numbers.adoc[题解]
+|Easy
+|
+
 //|{counter:codes}
 //|{leetcode_base_url}/camelcase-matching/[1023. Camelcase Matching^]
 //|{source_base_url}/_1023_CamelcaseMatching.java[Java]

docs/1022-sum-of-root-to-leaf-binary-numbers.adoc

@@ -1,42 +1,71 @@
 [#1022-sum-of-root-to-leaf-binary-numbers]
-= 1022. Sum of Root To Leaf Binary Numbers
+= 1022. 从根到叶的二进制数之和
 
-{leetcode}/problems/sum-of-root-to-leaf-binary-numbers/[LeetCode - Sum of Root To Leaf Binary Numbers^]
+https://leetcode.cn/problems/sum-of-root-to-leaf-binary-numbers/[LeetCode - 1022. 从根到叶的二进制数之和 ^]
 
-Given a binary tree, each node has value `0` or `1`.  Each root-to-leaf path represents a binary number starting with the most significant bit.  For example, if the path is `0 -> 1 -> 1 -> 0 -> 1`, then this could represent `01101` in binary, which is `13`.
+给出一棵二叉树，其上每个结点的值都是 `0` 或 `1` 。每一条从根到叶的路径都代表一个从最高有效位开始的二进制数。
 
-For all leaves in the tree, consider the numbers represented by the path from the root to that leaf.
+* 例如，如果路径为 `0 -> 1 -> 1 -> 0 -> 1`，那么它表示二进制数 `01101`，也就是 `13` 。
 
-Return the sum of these numbers.
+对树上的每一片叶子，我们都要找出从根到该叶子的路径所表示的数字。
 
- 
+返回这些数字之和。题目数据保证答案是一个 *32 位* 整数。
 
-*Example 1:*
+*示例 1：*
 
-image::https://assets.leetcode.com/uploads/2019/04/04/sum-of-root-to-leaf-binary-numbers.png[{image_attr}]
+image::images/1022-01.png[{image_attr}]
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* [1,0,1,0,1,0,1]
-*Output:* 22
-*Explanation:* (100) + (101) + (110) + (111) = 4 + 5 + 6 + 7 = 22
-----
+....
+输入：root = [1,0,1,0,1,0,1]
+输出：22
+解释：(100) + (101) + (110) + (111) = 4 + 5 + 6 + 7 = 22
+....
+
+*示例 2：*
+
+....
+输入：root = [0]
+输出：0
+....
 
- 
 
-*Note:*
+*提示：*
 
+* 树中的节点数在 `[1, 1000]` 范围内
+* `Node.val` 仅为 `0` 或 `1`
 
-. The number of nodes in the tree is between `1` and `1000`.
-. node.val is `0` or `1`.
-. The answer will not exceed `2^31 - 1`.
 
+== 思路分析
 
+深度优先遍历，从 `root` 节点开始计算数值，到叶子节点计算完毕加入到总和中即可。
 
+image::images/1022-10.jpeg[{image_attr}]
 
 [[src-1022]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_1022_SumOfRootToLeafBinaryNumbers.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_1022_SumOfRootToLeafBinaryNumbers_2.java[tag=answer]
+// ----
+// --
+====
+
+
+== 参考资料
 
+. https://leetcode.cn/problems/sum-of-root-to-leaf-binary-numbers/[1022. 从根到叶的二进制数之和 - 官方题解^]
+. https://leetcode.cn/problems/sum-of-root-to-leaf-binary-numbers/solutions/1526069/by-ac_oier-1905/[1022. 从根到叶的二进制数之和 - 树的遍历运用题^]
+. https://leetcode.cn/problems/sum-of-root-to-leaf-binary-numbers/solutions/1525940/by-nehzil-4gym/[1022. 从根到叶的二进制数之和 - 递归三部曲「图解过程」^]

docs/images/1022-01.png

@@ -2127,7 +2127,7 @@ include::1020-number-of-enclaves.adoc[leveloffset=+1]
 
 // include::1021-remove-outermost-parentheses.adoc[leveloffset=+1]
 
-// include::1022-sum-of-root-to-leaf-binary-numbers.adoc[leveloffset=+1]
+include::1022-sum-of-root-to-leaf-binary-numbers.adoc[leveloffset=+1]
 
 // include::1023-camelcase-matching.adoc[leveloffset=+1]
 

docs/images/1022-10.jpeg

@@ -828,6 +828,10 @@ endif::[]
 |{doc_base_url}/1020-number-of-enclaves.adoc[题解]
 |✅ 深度优先遍历。有机会尝试一下广度优先遍历。
 
+|{counter:codes2503}
+|{leetcode_base_url}/sum-of-root-to-leaf-binary-numbers/[1022. 从根到叶的二进制数之和^]
+|{doc_base_url}/1022-sum-of-root-to-leaf-binary-numbers.adoc[题解]
+|✅ 深度优先遍历。
 
 |===
 

docs/index.adoc

@@ -0,0 +1,39 @@
+package com.diguage.algo.leetcode;
+
+import com.diguage.algo.util.TreeNode;
+import com.diguage.util.TreeNodes;
+
+import java.util.Arrays;
+
+public class _1022_SumOfRootToLeafBinaryNumbers {
+  // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2025-05-25 23:02:00
+   */
+  int sum = 0;
+
+  public int sumRootToLeaf(TreeNode root) {
+    dfs(root, 0);
+    return sum;
+  }
+
+  private void dfs(TreeNode root, int head) {
+    if (root == null) {
+      return;
+    }
+    int num = 2 * head + root.val;
+    if (root.left == null && root.right == null) {
+      sum += num;
+      return;
+    }
+    dfs(root.left, num);
+    dfs(root.right, num);
+  }
+
+  // end::answer[]
+  public static void main(String[] args) {
+    new _1022_SumOfRootToLeafBinaryNumbers()
+      .sumRootToLeaf(TreeNodes.buildTree(Arrays.asList(1, 0, 1, 0, 1, 0, 1)));
+  }
+}