[LeetCode] 112. Path Sum

思路:
简单递归. 直接看代码吧…很容易理解

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