Path Sum II

最新推荐文章于 2018-12-11 19:36:09 发布

VintNee

最新推荐文章于 2018-12-11 19:36:09 发布

阅读量858

点赞数

分类专栏： leetcode MyLeetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/vintionnee/article/details/17339785

版权

leetcode 同时被 2 个专栏收录

60 篇文章 0 订阅

订阅专栏

MyLeetcode

42 篇文章 0 订阅

订阅专栏

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 binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void basePath(TreeNode *root, int sum, vector<int> temp, vector<vector<int>> &result)
    {
        if(!root)
            return;
            
        temp.push_back(root->val);
        if(root->val==sum&&!root->left&&!root->right)
            result.push_back(temp);
        
        basePath(root->left, sum-root->val, temp, result);
        basePath(root->right, sum-root->val, temp, result);

    }
    vector<vector<int> > pathSum(TreeNode *root, int sum)
    {
        vector<vector<int>> result;
        if(!root)
            return result;
        vector<int> temp;
        
        basePath(root,sum,temp, result);
        
    }
};