[二叉树]leetcode112：路径总和(easy)

总和(easy)"/>

[二叉树]leetcode112：路径总和(easy)

题目：

题解：

/*** 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==nullptr)return false;int t=sum-root->val;//与目标值做差if(root->left==nullptr&&root->right==nullptr)//到达叶子节点，某条路径走完return t==0?true:false;//递归遍历左右子树的所有路径return hasPathSum(root->left,t)||hasPathSum(root->right,t);}
};