LeetCode(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 andsum = 22,

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

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

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool seekPath(TreeNode *ptr,int cnt,int sum)
    {
        cnt+=ptr->val;
        if(ptr->left==nullptr&&ptr->right==nullptr)
        {
            if(cnt==sum) return true;
            else return false;
        }
        bool l=false,r=false;
        if(ptr->left!=nullptr) l=seekPath(ptr->left,cnt,sum);
        if(ptr->right!=nullptr) r=seekPath(ptr->right,cnt,sum);
        return l||r;
    }
    bool hasPathSum(TreeNode *root, int sum) {
        if(root==nullptr) return false;
        return seekPath(root,0,sum);
    }
    
};

 

题目描述

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 andsum = 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 {
    void getPath(TreeNode *ptr,int sum,int cnt,vector<vector<int> >&ans,vector<int>v)
    {
        cnt+=ptr->val;
        v.push_back(ptr->val);
        if(ptr->left==nullptr&&ptr->right==nullptr)
        {
            if(cnt==sum) ans.push_back(v);
            else return ;
        }
        if(ptr->left!=nullptr) 
            getPath(ptr->left,sum,cnt,ans,v);
        if(ptr->right!=nullptr)
            getPath(ptr->right,sum,cnt,ans,v);
        return ;
    }
public:
    vector<vector<int> > pathSum(TreeNode *root, int sum) {
        vector<vector<int> >res;
        if(root==nullptr) return res;
        int cnt=0;
        vector<int>temp;
        getPath(root,sum,cnt,res,temp);
        return res;
    }
};