Path Sum II

Author: w2xi

README.md

@@ -26,6 +26,7 @@
 |110|[平衡二叉树](https://leetcode.cn/problems/balanced-binary-tree/)|[JavaScript](./algorithms/balanced-binary-tree.js)|Easy|
 |111|[二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/)|[JavaScript](./algorithms/minimum-depth-of-binary-tree.js)|Easy|
 |112|[路径总和](https://leetcode.cn/problems/path-sum/)|[JavaScript](./algorithms/path-sum.js)|Easy|
+|113|[路径总和 II](https://leetcode.cn/problems/path-sum-ii/)|[JavaScript]()|Medium|
 |136|[只出现一次的数字](https://leetcode-cn.com/problems/single-number/)|[JavaScript](./algorithms/single-number.js)|Easy|
 |141|[环形链表](https://leetcode-cn.com/problems/linked-list-cycle/)|[JavaScript](./algorithms/linked-list-cycle.js)|Easy|
 |142|[环形链表 II](https://leetcode.cn/problems/linked-list-cycle-ii/)|[JavaScript](./algorithms/linked-list-cycle-ii.js)|Medium|

algorithms/path-sum-ii.js

@@ -0,0 +1,34 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * 路径总和 II
+ * @param {TreeNode} root
+ * @param {number} targetSum
+ * @return {number[][]}
+ */
+var pathSum = function (root, targetSum) {
+  const arr = [];
+  const result = [];
+
+  const dfs = (node, sum) => {
+    if (node) {
+      arr.push(node.val);
+      if (!node.left && !node.right && node.val === sum) {
+        result.push([...arr]);
+      }
+      dfs(node.left, sum - node.val);
+      dfs(node.right, sum - node.val);
+      arr.pop();
+    }
+  };
+  
+  dfs(root, targetSum);
+
+  return result;
+};