LeetCode-113. Path Sum II [C++][Java]

LeetCode-113. Path Sum IILevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/path-sum-ii/

Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where the sum of the node values in the path equals targetSum. Each path should be returned as a list of the node values, not node references.

A root-to-leaf path is a path starting from the root and ending at any leaf node. A leaf is a node with no children.

Example 1:

Input: root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
Output: [[5,4,11,2],[5,8,4,5]]
Explanation: There are two paths whose sum equals targetSum:
5 + 4 + 11 + 2 = 22
5 + 8 + 4 + 5 = 22

Example 2:

Input: root = [1,2,3], targetSum = 5
Output: []

Example 3:

Input: root = [1,2], targetSum = 0
Output: []

Constraints:

• The number of nodes in the tree is in the range [0, 5000].
• -1000 <= Node.val <= 1000
• -1000 <= targetSum <= 1000

【C++】

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> pathSum(TreeNode* root, int targetSum) {
        vector<vector<int>> res;
        vector<int> tmp;
        pathSumDFS(root, targetSum, tmp, res);
        return res;
    }
    
    void pathSumDFS(TreeNode* root,
                    int sum,
                    vector<int>& tmp,
                    vector<vector<int>>& res) {
        if (root == nullptr) {return;}
        tmp.push_back(root->val);
        if (root->left == nullptr
            && root->right == nullptr
            && sum == root->val) {
            res.push_back(tmp);
        } else {
            int remaining = sum - root->val;
            pathSumDFS(root->left, remaining, tmp, res);
            pathSumDFS(root->right, remaining, tmp, res);
        }
        tmp.pop_back();
    }
};

【Java】

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<List<Integer>> pathSum(TreeNode root, int targetSum) {
        List<List<Integer>> res = new ArrayList<List<Integer>>();
        List<Integer> tmp = new ArrayList<>();
        pathSumDFS(root, targetSum, tmp, res);
        return res;
    }
    
    void pathSumDFS(TreeNode root,
                    int sum,
                    List<Integer> tmp,
                    List<List<Integer>> res) {
        if (root == null) {return;}
        tmp.add(root.val);
        if (root.left == null
            && root.right == null
            && sum == root.val) {
            res.add(new ArrayList<Integer>(tmp));
        } else {
            int remaining = sum - root.val;
            pathSumDFS(root.left, remaining, tmp, res);
            pathSumDFS(root.right, remaining, tmp, res);
        }
        tmp.remove(tmp.size()-1);
    }
}