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.

Note: A leaf is a node with no children.

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.

分析:

 

题意是需要求到叶子节点和为目标值的路径,自己刚开始写的时候第一次ac没有过,最主要的原因就是没有意识到是叶子节点,有一种情况就是根节点只有一个左孩子,但是它自身的val就等于sum，这种情况下虽然符合但是非叶子节点,所以我们需要在叶子节点处判断是否符合,如果root等于空说明这个路径不符

代码实现:

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