Path Sum

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.

1st iteration:

/**
 * 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 sum) {
        
        // invalid input
        if (root == NULL) {
            return false;
        }
        
        // leaf node
        if (root->left == NULL && root->right == NULL) {
            return root->val == sum;
        } 
        
        // depth-first-search
    
        // check on left child if it is not NULL
        if (root->left != NULL && hasPathSum(root->left, sum-root->val)) {
            return true;
        }
        
        // check on right child if it is not NULL
        if (root->right != NULL && hasPathSum(root->right, sum-root->val)) {
            return true;
        }
        
        return false;
    }
};


2nd iteration

/**
 * 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 sum) {
       return hasPathSumR(root, 0, sum);
    }
    
    // traverse the tree dfs, add up sum when traversing, when
    // approach leaft, compare with target sum, if equal return
    // otherwise, give up the path
    bool hasPathSumR(TreeNode *root, int sumSoFar, int target) {
        if (root == NULL) {
            return false;
        }
        
        // add up sum when traversing
        sumSoFar += root->val;
        
        // when approach leaft, compare with target sum,  if equal return
        // otherwise, give up the path
        if (root->left == NULL && root->right == NULL) {
            return sumSoFar == target;
        }
        
        // traverse the tree dfs
        return hasPathSumR(root->left, sumSoFar, target) ||
               hasPathSumR(root->right, sumSoFar, target);
    }
};



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值