一刷1325

Author: diguage

README.adoc

@@ -9300,14 +9300,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/1324-print-words-vertically.adoc[题解]
 //|Medium
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/delete-leaves-with-a-given-value/[1325. Delete Leaves With a Given Value^]
-//|{source_base_url}/_1325_DeleteLeavesWithAGivenValue.java[Java]
-//|{doc_base_url}/1325-delete-leaves-with-a-given-value.adoc[题解]
-//|Medium
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/delete-leaves-with-a-given-value/[1325. Delete Leaves With a Given Value^]
+|{source_base_url}/_1325_DeleteLeavesWithAGivenValue.java[Java]
+|{doc_base_url}/1325-delete-leaves-with-a-given-value.adoc[题解]
+|Medium
+|
+
 //|{counter:codes}
 //|{leetcode_base_url}/minimum-number-of-taps-to-open-to-water-a-garden/[1326. Minimum Number of Taps to Open to Water a Garden^]
 //|{source_base_url}/_1326_MinimumNumberOfTapsToOpenToWaterAGarden.java[Java]

docs/1325-delete-leaves-with-a-given-value.adoc

@@ -1,75 +1,80 @@
 [#1325-delete-leaves-with-a-given-value]
-= 1325. Delete Leaves With a Given Value
+= 1325. 删除给定值的叶子节点
 
-{leetcode}/problems/delete-leaves-with-a-given-value/[LeetCode - Delete Leaves With a Given Value^]
+https://leetcode.cn/problems/delete-leaves-with-a-given-value/[LeetCode - 1325. 删除给定值的叶子节点 ^]
 
-Given a binary tree `root` and an integer `target`, delete all the *leaf nodes* with value `target`.
+给你一棵以 `root` 为根的二叉树和一个整数 `target` ，请你删除所有值为 `target` 的 *叶子节点* 。
 
-Note that once you delete a leaf node with value `target`*, *if it's parent node becomes a leaf node and has the value `<font face="monospace">target`, it should also be deleted (you need to continue doing that until you can't).
+注意，一旦删除值为 `target` 的叶子节点，它的父节点就可能变成叶子节点；如果新叶子节点的值恰好也是 `target`，那么这个节点也应该被删除。
 
- 
-*Example 1:*
+也就是说，你需要重复此过程直到不能继续删除。
 
-image::https://assets.leetcode.com/uploads/2020/01/09/sample_1_1684.png[{image_attr}]
+*示例 1：*
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* root = [1,2,3,2,null,2,4], target = 2
-*Output:* [1,null,3,null,4]
-*Explanation:* Leaf nodes in green with value (target = 2) are removed (Picture in left). 
-After removing, new nodes become leaf nodes with value (target = 2) (Picture in center).
-----
+image::images/1325-01.png[{image_attr}]
 
-*Example 2:*
+....
+输入：root = [1,2,3,2,null,2,4], target = 2
+输出：[1,null,3,null,4]
+解释：
+上面左边的图中，绿色节点为叶子节点，且它们的值与 target 相同（同为 2 ），它们会被删除，得到中间的图。
+有一个新的节点变成了叶子节点且它的值与 target 相同，所以将再次进行删除，从而得到最右边的图。
+....
 
-image::https://assets.leetcode.com/uploads/2020/01/09/sample_2_1684.png[{image_attr}]
+*示例 2：*
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* root = [1,3,3,3,2], target = 3
-*Output:* [1,3,null,null,2]
-----
+image::images/1325-02.png[{image_attr}]
 
-*Example 3:*
+....
+输入：root = [1,3,3,3,2], target = 3
+输出：[1,3,null,null,2]
+....
 
-image::https://assets.leetcode.com/uploads/2020/01/15/sample_3_1684.png[{image_attr}]
+*示例 3：*
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* root = [1,2,null,2,null,2], target = 2
-*Output:* [1]
-*Explanation:* Leaf nodes in green with value (target = 2) are removed at each step.
-----
+image::images/1325-03.png[{image_attr}]
 
-*Example 4:*
+....
+输入：root = [1,2,null,2,null,2], target = 2
+输出：[1]
+解释：每一步都删除一个绿色的叶子节点（值为 2）。
+....
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* root = [1,1,1], target = 1
-*Output:* []
-----
 
-*Example 5:*
-
-[subs="verbatim,quotes,macros"]
-----
-*Input:* root = [1,2,3], target = 1
-*Output:* [1,2,3]
-----
-
- 
-*Constraints:*
+*提示：*
 
+* 树中节点数量的范围是 `[1, 3000]`。
+* `+1 <= Node.val, target <= 1000+`
 
-* `1 <= target <= 1000`
-* Each tree has at most `3000` nodes.
-* Each node's value is between `[1, 1000]`.
 
+== 思路分析
 
+深度优先遍历，而且做“后序”处理：在获取返回值后，对当前节点再做判断，这样就可以链式地删除掉符合条件的节点。
 
 [[src-1325]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_1325_DeleteLeavesWithAGivenValue.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_1325_DeleteLeavesWithAGivenValue_2.java[tag=answer]
+// ----
+// --
+====
+
+
+== 参考资料
 
+. https://leetcode.cn/problems/delete-leaves-with-a-given-value/solutions/101264/shan-chu-gei-ding-zhi-de-xie-zi-jie-dian-by-leet-2/[1325. 删除给定值的叶子节点 - 官方题解^]
+. https://leetcode.cn/problems/delete-leaves-with-a-given-value/solutions/423926/java-shu-de-hou-xu-bian-li-xiang-guan-wen-ti-by-sa/[1325. 删除给定值的叶子节点 - Java 树的后续遍历相关问题^]

docs/images/1325-01.png

@@ -2733,7 +2733,7 @@ include::1289-minimum-falling-path-sum-ii.adoc[leveloffset=+1]
 
 // include::1324-print-words-vertically.adoc[leveloffset=+1]
 
-// include::1325-delete-leaves-with-a-given-value.adoc[leveloffset=+1]
+include::1325-delete-leaves-with-a-given-value.adoc[leveloffset=+1]
 
 // include::1326-minimum-number-of-taps-to-open-to-water-a-garden.adoc[leveloffset=+1]
 

docs/images/1325-02.png

@@ -788,6 +788,13 @@ endif::[]
 |{doc_base_url}/1561-maximum-number-of-coins-you-can-get.adoc[题解]
 |✅ 贪心。每次去第二大的数字即可。
 
+
+|{counter:codes2503}
+|{leetcode_base_url}/delete-leaves-with-a-given-value/[1325. 删除给定值的叶子节点^]
+|{doc_base_url}/1325-delete-leaves-with-a-given-value.adoc[题解]
+|✅ 深度优先遍历，在“后序”中做业务处理。
+
+
 |===
 
 截止目前，本轮练习一共完成 {codes2503} 道题。

docs/images/1325-03.png

@@ -0,0 +1,24 @@
+package com.diguage.algo.leetcode;
+
+import com.diguage.algo.util.TreeNode;
+
+public class _1325_DeleteLeavesWithAGivenValue {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2025-05-22 23:48:19
+   */
+  public TreeNode removeLeafNodes(TreeNode root, int target) {
+    if (root == null) {
+      return null;
+    }
+    root.left = removeLeafNodes(root.left, target);
+    root.right = removeLeafNodes(root.right, target);
+    if (root.left == null && root.right == null && root.val == target) {
+      return null;
+    }
+    return root;
+  }
+  // end::answer[]
+}