113. Path Sum II [LeetCode]

最新推荐文章于 2020-03-20 17:18:08 发布

luuyiran

最新推荐文章于 2020-03-20 17:18:08 发布

阅读量288

点赞数

分类专栏： LeetCode解题笔记

本文链接：https://blog.csdn.net/mc_007/article/details/80853263

版权

LeetCode解题笔记专栏收录该内容

57 篇文章 0 订阅

订阅专栏

/**************************************************************************
 * 
 * 112. [Path Sum II](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 each path's sum equals targetSum. 
 * A leaf is a node with no children.
 * 
 * Example:
 * Given the below binary tree and sum = 22,
 * 
 *       5
 *      / \
 *     4   8
 *    /   / \
 *   11  13  4
 *  /  \      \
 * 7    2      1
 * 
 * return:
 * [
 *    [5,4,11,2],
 *    [5,8,4,5]
 * ]
 * 
 **************************************************************************/
/**
 * 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> > result;
        vector<int> cur;
        sum(root, targetSum, result, cur);
        return result;
    }
    void sum(TreeNode* root, int target, vector<vector<int> > &result, vector<int> &cur) {
        if (nullptr == root) return;
        cur.push_back(root->val);
        if (nullptr == root->left && nullptr == root->right && target == root->val)
            result.push_back(cur);
        sum(root->left, target - root->val, result, cur);
        sum(root->right,target - root->val, result, cur);
        cur.pop_back();
    }
};