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.

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.

/**
 * Definition for a binary tree node.
 * 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) {
		if (root == NULL){
			return false;
		}
		return helper(root, sum, 0);
	}
private:
	bool helper(TreeNode* root, int sum, int curSum){
		curSum += root->val;
		if (root->left == NULL&&root->right == NULL){
			return curSum == sum;
		}

		bool left = false;
		if (root->left){
			left = helper(root->left, sum, curSum);
		}
		bool right = false;
		if (root->right){
			right = helper(root->right, sum, curSum);
		}
		return left || right;
	}
};

或者

/**
 * Definition for a binary tree node.
 * 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) {
		if (root == NULL){
			return false;
		}
		return helper(root, sum, 0);
	}
private:
	bool helper(TreeNode* root, int sum, int curSum){
		curSum += root->val;
		if (root->left == NULL&&root->right == NULL){
			return curSum == sum;
		}

		bool found = false;
		if (root->left){
			found = helper(root->left, sum, curSum);
		}
		
		if (!found&&root->right){
			found = helper(root->right, sum, curSum);
		}
		return found;
	}
};