LeetCode 112. Path Sum--递归
来源:互联网 发布:dnf扫拍软件 编辑:程序博客网 时间:2024/05/17 09:21
题目链接
112. Path Sum
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 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 sum == root->val ? true : false; return hasPathSum(root->left, sum - root->val) || hasPathSum(root->right, sum - root->val); }};
阅读全文