Leetcode 113. Path Sum II (Medium) (cpp)

最新推荐文章于 2021-12-03 20:50:54 发布

Niko_Ke

最新推荐文章于 2021-12-03 20:50:54 发布

阅读量581

点赞数

本文链接：https://blog.csdn.net/Niko_Ke/article/details/53277596

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Tree

48 篇文章 0 订阅

订阅专栏

Leetcode 113. Path Sum II (Medium) (cpp)

Tag: Tree, Depth-first Search

Difficulty: Medium

/*

113. Path Sum II (Medium)

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.

For example:
Given the below binary tree and sum = 22,
              5
             / \
            4   8
           /   / \
          11  13  4
         /  \    / \
        7    2  5   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(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        vector<vector<int>> res;
        vector<int> res_sub;
        pathSum(root, res, res_sub, sum);
        return res;
    }
private:
    void pathSum(TreeNode* root, vector<vector<int>>& res, vector<int>& res_sub, int sum) {
        if (root == NULL) {
            return;
        } else if (root->left == NULL && root->right == NULL && sum == root->val) {
            res_sub.push_back(root->val);
            res.push_back(res_sub);
            res_sub.pop_back();
            return;
        }
        res_sub.push_back(root->val);
        if (root->left != NULL) {
            pathSum(root->left, res, res_sub, sum - root->val);
        }
        if (root->right != NULL) {
            pathSum(root->right, res, res_sub, sum - root->val);
        }
        res_sub.pop_back();
       
    }
};