/**
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (root == NULL)
{
return false;
}
return pathSum(root, sum);
}
bool pathSum(TreeNode *root, int sum)
{
if (root == NULL)
{
return sum == 0;
}
sum -= root->val;
if (root->left != NULL && root->right == NULL)
{
return pathSum(root->left, sum);
}
else if (root->left == NULL && root->right != NULL)
{
return pathSum(root->right, sum);
}
else
{
return pathSum(root->left, sum) || pathSum(root->right, sum);
}
}
};
可以再简洁一些:
/**
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
return dfs(root, sum);
}
bool dfs(TreeNode *root, int curRest)
{
if (root == NULL)
return false;
if (root->left == NULL && root->right == NULL)
return curRest == root->val;
return dfs(root->left, curRest - root->val) || dfs(root->right, curRest - root->val);
}
};
参考:http://www.cnblogs.com/remlostime/archive/2012/11/13/2767746.html