leetcode 113 pathSum2

最新推荐文章于 2018-04-27 11:48:22 发布

流风远山

最新推荐文章于 2018-04-27 11:48:22 发布

阅读量218

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_32417133/article/details/77823366

版权

leetcode 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

地址：https://leetcode.com/problems/path-sum-ii/description/

/**
 * 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> resp;
        if(!root) return res;

        pathSum(root, sum, resp, res);

        return res;
    }

    void pathSum(TreeNode* root, int sum, vector<int>& path, vector<vector<int>>& paths){

        if(!root) return;

        path.push_back(root->val);

        if(!root->left && !root->right && sum == root->val){
            paths.push_back(path);
            path.pop_back(); // 这里是关键，不要遗忘了在这里pop_back()
            return;
        }

        pathSum(root->left, sum - root->val, path, paths);
        pathSum(root->right, sum - root->val, path, paths);

        if(path.size() > 1)
            path.pop_back();
    }
};