leetcode 113-路径总和Ⅱ

liudongshizhang

于 2020-05-22 23:43:01 发布

阅读量143

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/liudongshizhang/article/details/106293153

版权

leetcode 专栏收录该内容

55 篇文章 1 订阅

订阅专栏

在这里插入图片描述

/**
 * 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<int>res;
    vector<vector<int>>result;
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        if(root){
            dfs(root,sum);
        }
        return result;
    }
    void dfs(TreeNode *root,int sum){
        int val = root->val;
        res.push_back(val);
        if(root->left == NULL && root->right == NULL && val == sum){
            result.push_back(res);
        }
        if(root->left != NULL ){
            dfs(root->left,sum - val);
        }
        if(root->right != NULL){
            dfs(root->right,sum - val);
        }
        res.pop_back();
    }
};