[Leetcode] 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.

思路：

和上一道题目一样，还是典型的深度优先搜索。当遇到叶子节点的时候，判断当前的sum是否为零，进而返回；否则就接着检查它的左子树和右子树是否符合条件。需要注意的是，只有在它的左子树或右子树不为空的情况下，才可以递归调用，因为此时才可以形成从根节点到叶子节点的完整路径。

代码：

/**
 * 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;
        }
        if (!root->left && !root->right) {
            return root->val == sum;
        }
        if (root->left && hasPathSum(root->left, sum - root->val)) {
            return true;
        }
        if (root->right && hasPathSum(root->right, sum - root->val)) {
            return true;
        }
        return false;
    }
};