LeetCode 112. Path Sum

1. 题目描述
   ven 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.

2. 解题思路
   大概类似深搜，递归的求解。
   一棵二叉树有没有解，递归为两子树有没有关于sum-root->val解的异或。

3. 代码实现

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