LeetCode 112. Path Sum

//##描述
求出从根节点到叶子节点之间是否存在一条路径之和为sum

解决

递归遍历

---

class Solution {public:    bool hasPathSum(TreeNode* root, int sum) {        //cout << "now = " << sum << endl;        if (!root)            return false;        else if (sum == root -> val && !root -> left && !root -> right)            return true;         return hasPathSum(root -> left, sum - root -> val) || hasPathSum(root -> right, sum - root -> val);    }};