三刷113

Author: diguage

docs/0113-path-sum-ii.adoc

@@ -38,33 +38,8 @@ Return:
 
 这样要重点注意的是：回溯时，前进和后退要成对出现。
 
-== 参考资料
-
-. https://leetcode-cn.com/problems/path-sum-ii/solution/dfs-by-powcai-2/[DFS - 路径总和 II - 力扣（LeetCode）^]
-
-[[src-0113]]
-[{java_src_attr}]
-----
-include::{sourcedir}/_0113_PathSumII.java[tag=answer]
-----
-
-== 未优化版
-
-[{java_src_attr}]
-----
-include::{sourcedir}/_0113_PathSumII_2.java[tag=answer]
-----
-
-== 优化版
-
-[{java_src_attr}]
-----
-include::{sourcedir}/_0113_PathSumII_21.java[tag=answer]
-----
-
 TIP: 非常典型的回溯问题！
 
-
 image::images/0113-01.png[{image_attr}]
 
 image::images/0113-02.png[{image_attr}]
@@ -89,3 +64,47 @@ image::images/0113-11.png[{image_attr}]
 
 image::images/0113-12.png[{image_attr}]
 
+[[src-0113]]
+[tabs]
+====
+一刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0113_PathSumII.java[tag=answer]
+----
+--
+
+二刷（待优化）::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0113_PathSumII_2.java[tag=answer]
+----
+--
+
+二刷（优化）::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0113_PathSumII_21.java[tag=answer]
+----
+--
+
+三刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0113_PathSumII_3.java[tag=answer]
+----
+--
+====
+
+== 参考资料
+
+. https://leetcode-cn.com/problems/path-sum-ii/solution/dfs-by-powcai-2/[DFS - 路径总和 II - 力扣（LeetCode）^]
+

docs/0155-min-stack.adoc

@@ -57,7 +57,7 @@ include::{sourcedir}/_0155_MinStack_2.java[tag=answer]
 ----
 --
 
-二刷::
+三刷::
 +
 --
 [{java_src_attr}]

logbook/202406.adoc

@@ -575,6 +575,11 @@
 |{doc_base_url}/0121-best-time-to-buy-and-sell-stock.adoc[题解]
 |
 
+|{counter:codes}
+|{leetcode_base_url}/path-sum-ii/[113. Path Sum II^]
+|{doc_base_url}/0113-path-sum-ii.adoc[题解]
+|回溯
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

src/main/java/com/diguage/algo/leetcode/_0113_PathSumII_2.java

@@ -13,13 +13,16 @@
  * https://leetcode.com/problems/path-sum-ii/[Path Sum II - LeetCode]
  *
  * @author D瓜哥 · https://www.diguage.com
- * @since 2020-02-07 22:31
+ * @since 2024-06-20 18:48
  */
 public class _0113_PathSumII_2 {
   // tag::answer[]
 
     /**
      * 原始解法
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2024-06-20 18:48
      */
     public List<List<Integer>> pathSum(TreeNode root, int sum) {
       if (root == null) {

src/main/java/com/diguage/algo/leetcode/_0113_PathSumII_3.java

@@ -0,0 +1,47 @@
+package com.diguage.algo.leetcode;
+
+import com.diguage.algo.util.TreeNode;
+
+import java.util.ArrayList;
+import java.util.LinkedList;
+import java.util.List;
+
+import static com.diguage.util.TreeNodes.buildTree;
+import static java.util.Arrays.asList;
+
+public class _0113_PathSumII_3 {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-06-20 18:48
+   */
+  public List<List<Integer>> pathSum(TreeNode root, int targetSum) {
+    List<List<Integer>> result = new LinkedList<>();
+    List<Integer> path = new ArrayList<>();
+    backtrack(root, targetSum, result, path);
+    return result;
+  }
+
+  private void backtrack(TreeNode root, int targetSum,
+                         List<List<Integer>> result, List<Integer> path) {
+    if (root == null) {
+      return;
+    }
+    int nextSum = targetSum - root.val;
+    path.add(root.val);
+    if (nextSum == 0 && root.left == null && root.right == null) {
+      result.add(new ArrayList(path));
+    }
+    backtrack(root.left, nextSum, result, path);
+    backtrack(root.right, nextSum, result, path);
+    path.remove(path.size() - 1);
+  }
+  // end::answer[]
+
+  public static void main(String[] args) {
+    _0113_PathSumII_3 solution = new _0113_PathSumII_3();
+    List<List<Integer>> r1 = solution.pathSum(buildTree(asList(5, 4, 8, 11, null, 13, 4, 7, 2, null, null, null, null, 5, 1)), 22);
+    System.out.println(r1);
+  }
+}