path-sum-ii

最新推荐文章于 2019-05-07 23:11:38 发布

原创最新推荐文章于 2019-05-07 23:11:38 发布 · 302 阅读

0 ·

CC 4.0 BY-SA版权

树专栏收录该内容

10 篇文章

订阅专栏

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
vector<vector<int>>ans;
vector<int>tmp;
int ts=0;
void kpathSum(TreeNode *root, int sum) {
    if(root){
        tmp.push_back(root->val);
        ts+=root->val;
        if(root->left==NULL&&root->right==NULL&&ts==sum) ans.push_back(tmp);
        else{
            if(root->left)  kpathSum(root->left,sum);
            if(root->right) kpathSum(root->right,sum);
        }
        ts-=root->val;
        tmp.pop_back();
    }}
class Solution {
public:
    vector<vector<int> > pathSum(TreeNode *root, int sum) {
       ans.clear(); tmp.clear(); //interesting
         kpathSum(root,sum);
        return ans;
    }
};