fd

Author: dingjikerbo

leetcode/solution/src/PathSumII.java

@@ -16,13 +16,12 @@ private void helper(TreeNode node, int sum, List<List<Integer>> result, List<Int
         }
 
         list.add(node.val);
-        sum -= node.val;
 
-        if (node.left == null && node.right == null && sum == 0) {
+        if (node.left == null && node.right == null && sum == node.val) {
             result.add(new ArrayList<>(list));
         } else {
-            helper(node.left, sum, result, list);
-            helper(node.right, sum, result, list);
+            helper(node.left, sum - node.val, result, list);
+            helper(node.right, sum - node.val, result, list);
         }
 
         list.remove(list.size() - 1);

leetcode/src/Main.java

@@ -6,8 +6,27 @@ public class Main {
 
     public static class Solution {
 
-        public int sumOfLeftLeaves(TreeNode root) {
+        public List<List<Integer>> pathSum(TreeNode root, int sum) {
+            List<List<Integer>> result = new ArrayList<>();
+            helpr(root, sum, new ArrayList<>(), result);
+            return result;
+        }
+
+        private void helpr(TreeNode root, int sum, List<Integer> list, List<List<Integer>> result) {
+            if (root == null) {
+                return;
+            }
+
+            list.add(root.val);
+
+            if (root.left == null && root.right == null && root.val == sum) {
+                result.add(new ArrayList<>(list));
+            } else {
+                helpr(root.left, sum - root.val, list, result);
+                helpr(root.right, sum - root.val, list, result);
+            }
 
+            list.remove(list.size() - 1);
         }
     }