关闭

Path Sum

标签: 二叉树
125人阅读 评论(0) 收藏 举报
分类:
  1. 问题

    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.

  2. 解答
    bool hasPathSum(struct TreeNode* root, int sum) 
    {
        if(root==NULL) return false;
        if(root->left==NULL && root->right==NULL && root->val==sum)
            return true;
        return hasPathSum(root->left,sum-root->val)||hasPathSum(root->right,sum-root->val);
    }


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:9850次
    • 积分:514
    • 等级:
    • 排名:千里之外
    • 原创:42篇
    • 转载:7篇
    • 译文:0篇
    • 评论:0条