LeetCode 112. Path Sum

最新推荐文章于 2019-04-12 14:55:36 发布

HelloSilicat

最新推荐文章于 2019-04-12 14:55:36 发布

阅读量220

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/peisir/article/details/77103326

版权

Leetcode 专栏收录该内容

65 篇文章 0 订阅

订阅专栏

112. Path Sum

Description

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.

Solution

题意即判断二叉树是否存在某条路径，该路径上数和为指定的sum值。
用递归的思想很容易解决，判断两个临界条件(空节点和满足题意的)，然后递归即可，代码如下

class Solution {
public:
    bool hasPathSum(TreeNode* root, int sum) {
        if (root == NULL)
            return false;
        else if (sum == root->val && !root->left && !root->right) 
            return true;
        else 
            return hasPathSum(root->left,sum - root->val) || hasPathSum(root->right,sum - root->val);
    }
};