关闭

LeetCode:Path Sum

标签: LeetCodePath SumTreeDepth-first Search
282人阅读 评论(0) 收藏 举报
分类:

Path Sum

Total Accepted: 78908 Total Submissions: 261199 Difficulty: Easy

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.























code:

/**
 * 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(NULL == root) return false;
        if(sum==root->val && NULL == root->left && NULL == root->right) return true;
        return hasPathSum(root->left, sum-root->val) || hasPathSum(root->right, sum-root->val);
    }
};


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:338547次
    • 积分:6275
    • 等级:
    • 排名:第4055名
    • 原创:312篇
    • 转载:1篇
    • 译文:0篇
    • 评论:23条
    博客专栏
    最新评论