LeetCode/JavaScript/path-sum-ii.js at main · PranamBhat/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
/**
 * 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)
 * }
 */
/**
 * @param {TreeNode} root
 * @param {number} targetSum
 * @return {number[][]}
 */

var pathSum = function(root, targetSum) {

    var res = [];

    helper(root, targetSum, [], res);

    return res;

};

var helper = function (root, targetSum, now, res) {

    if (!root)
      return;

  now.push(root.val);

  if (root.val === targetSum && !root.left && !root.right)
      res.push(now);

  helper(root.left, targetSum - root.val, Array.from(now), res);
  helper(root.right, targetSum - root.val, Array.from(now), res);

};