dfs。注意判断是不是叶子结点。
/**
* 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 hasPathSum(TreeNode *root, int sum) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
flag = false;
int ans = 0;
dfs(root, sum, ans);
return flag;
}
void dfs(TreeNode *root, int sum, int ans){
if(flag || root== NULL)
return ;
if(root->left == NULL && root->right ==NULL){
if(ans+root->val == sum) flag = true;
return ;
}
dfs(root->left, sum, ans+root->val);
dfs(root->right, sum, ans+root->val);
}
bool flag;
};