bool hasPathSum(TreeNode* root, int sum) {
if(!root) return false;
if(!root->left&&!root->right&&root->val==sum) return true;
return hasPathSum(root->left,sum-root->val)||hasPathSum(root->right,sum-root->val);
}
112. Path Sum
最新推荐文章于 2021-12-24 23:44:26 发布