class Solution {
public:
bool hasPathSum(TreeNode* root, int sum) {
if(!root) return false;
sum-=root->val;
if(!root->left&&!root->right) return !sum;
return root->left&&hasPathSum(root->left,sum)||root->right&&hasPathSum(root->right,sum);
}
};
路径总和leetcode
最新推荐文章于 2024-07-18 12:21:16 发布