Path Sum--路径和(重)

最新推荐文章于 2019-05-07 23:11:38 发布

阿萨德发的阿达

最新推荐文章于 2019-05-07 23:11:38 发布

阅读量353

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/skyoceanlover/article/details/34135403

版权

leetcode 专栏收录该内容

119 篇文章 0 订阅

订阅专栏

问题：链接

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.

解答：

DFS或者BFS。同时，当本节点是叶子节点才判断和，否则节点为空时返回false

参考：http://www.cnblogs.com/remlostime/archive/2012/11/13/2767746.html

代码：

class Solution {
public:
    bool hasPathSum(TreeNode *root, int sum) {
		return DFS(root, 0, sum);
    }
	bool DFS(TreeNode *root, int sum, int target)
	{
		if(root == NULL)
			return false;
		if(root->left == NULL && root->right == NULL)
			return (target == sum + root->val);
		return DFS(root->left, sum+root->val, target) || DFS(root->right, sum+root->val, target);
	}
};