class Solution {
public:
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);
}
};
LeetCode - Path Sum
猜你喜欢
转载自blog.csdn.net/real_lisa/article/details/82935925
今日推荐
周排行