leetcode 89: Path Sum

最新推荐文章于 2022-11-01 14:36:34 发布

xudli

最新推荐文章于 2022-11-01 14:36:34 发布

阅读量1.3k

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/xudli/article/details/8611839

版权

leetcode 专栏收录该内容

216 篇文章 0 订阅

订阅专栏

Path Sum Oct 14 '12

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

For example:
Given the below binary tree and sum = 22,

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \      \
        7    2      1

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean hasPathSum(TreeNode root, int sum) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(root==null) return false;
        return pathRec(root, 0, sum);
    }
    
    private boolean pathRec(TreeNode root, int parentSum, int sum) {
        if(root.left==null && root.right==null) {
            return parentSum + root.val ==sum;
        }
        
        boolean l=false,r=false;
        
        if(root.right==null) {
             l = pathRec(root.left, parentSum+root.val, sum);
             return l;
        }
        
        if(root.left==null) {
            r = pathRec(root.right, parentSum + root.val, sum);
            return r;
        }
        
        l = pathRec(root.left, parentSum+root.val, sum);
        r = pathRec(root.right, parentSum + root.val, sum);
        return l|r;
    } 
}

/**
 * Definition for binary tree
 * 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 target) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(root==NULL) return false;
        int sum = 0;
        return sumRec(root, sum, target);
    }
    
    bool sumRec(TreeNode* root, int sum, int target) {
        sum += root->val;
        if(root->left==NULL && root->right==NULL) {
            return sum == target;
        }
        bool res = false;
        if(root->left!=NULL) res |=sumRec(root->left, sum, target);
        if(root->right!=NULL) res |=sumRec(root->right, sum, target);
        return res;
    }
};