Path Sum I,II

112. Path Sum

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

For example:
Given the below binary tree and  sum = 22 ,

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \      \
        7    2      1

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

思路: 回溯法，每遍历到一个节点，sum更新=>sum-node->val

<pre name="code" class="cpp">class Solution {
public:
    bool hasPathSum(TreeNode* root, int sum) {
        TreeNode *r=root;
         if(!r)
        return false;
        if(!r->left && !r->right)
        return sum==r->val;
        else return (hasPathSum(r->left,sum-root->val)||(hasPathSum(r->right,sum-root->val))); 
    }
};

点击打开113. Path Sum II链接

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]
]

找到所有满足条件的路径。

class Solution {
    void dfs(TreeNode* root, int sum, vector<vector<int>> &paths,vector<int>& path)
    {
        if(!root) return;
        path.push_back(root->val);
        if(!root->left&&!root->right&&sum==root->val) 
        paths.push_back(path);
        dfs(root->left,sum-root->val,paths,path);
        dfs(root->right,sum-root->val,paths,path);
        path.pop_back();
    }
public:
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        vector<vector<int>> paths;
        vector<int> path;
        dfs(root,sum,paths,path);
        return paths;
    }
};