LeetCode112. Path Sum

最新推荐文章于 2016-11-22 23:15:48 发布

Lonvon_

最新推荐文章于 2016-11-22 23:15:48 发布

阅读量229

点赞数

分类专栏： LeetCode 文章标签： leetcode binaryTree

本文链接：https://blog.csdn.net/Lonvon_/article/details/53066646

版权

LeetCode 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

题目

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.

分析

进行一次二叉树的先序遍历，到叶节点时比较路径的值与给定的值，用DFS来实现。

代码如下：

/**
 * Definition for a binary tree node.
 * 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) {
        if (root == NULL) {
            return false;
        }
        if (root->left == NULL && root->right == NULL) {
            return root->val == sum;
        }
        bool res = false;
        if (root->left != NULL) {
            res = res || hasPathSum(root->left, sum - root->val);
        }
        if (root->right != NULL) {
            res = res || hasPathSum(root->right, sum - root->val);
        }
        return res;   
    }
};