class Solution {
public:
bool hasPathSum(TreeNode *root, int sum) {
if(root==NULL)return false;
if(!root->left&&!root->right)return root->val==sum;
return hasPathSum(root->left,sum-root->val)|
hasPathSum(root->right,sum-root->val);
}
};
题目地址 https://leetcode.com/problems/path-sum/description/[...
https://leetcode-cn.com/problems/path-sum/ （图片来源https://l...
112. 路径总和[https://leetcode-cn.com/problems/path-sum/] 题意：...
题目描述： https://leetcode-cn.com/problems/path-sum/ 解题思路： 第一...
112. 路径总和[https://leetcode-cn.com/problems/path-sum/] 问题描...
原题链接：https://leetcode-cn.com/problems/path-sum/[https://l...
本文标题：path-sum
本文链接：https://www.haomeiwen.com/subject/vhlitctx.html
网友评论