LeetCode: Path Sum

最新推荐文章于 2019-08-01 18:24:25 发布

原创最新推荐文章于 2019-08-01 18:24:25 发布 · 3k 阅读

0 ·

CC 4.0 BY-SA版权

算法同时被 2 个专栏收录

109 篇文章

订阅专栏

C++

108 篇文章

订阅专栏

本文介绍了一种算法，用于判断给定的二叉树中是否存在从根节点到叶子节点的路径，使得路径上的所有节点值之和等于给定的目标值。

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
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (root == NULL)
        {
            return false;
        }
        
        int leftsum = sum - root->val;
        // 找到sum，并且为叶子节点
        if (leftsum == 0 && root->left == NULL && root->right == NULL)
        {
            return true;
        }
        
        bool left = hasPathSum(root->left, leftsum);
        bool right = hasPathSum(root->right, leftsum);

        return left || right;
    }
};