DFS:112. Path Sum
2017-09-23 22:03
162 查看
这道题的一个测试例子是[]0->false。。。我觉得不太对啊,我总感觉这个应该输出true才对啊……不管了他说false就false吧,我的代码:
/**
* 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)
{
if(root->val == sum)
return true;
else
return false;
}
else
return hasPathSum(root->left, sum - root->val) || hasPathSum(root->right, sum - root->val);
}
};其中的一个else可以省略,让代码看起来更简单一点:
bool hasPathSum(TreeNode *root, int sum) {
if (root == NULL) return false;
if (root->val == sum && root->left == NULL && root->right == NULL) return true;
return hasPathSum(root->left, sum-root->val) || hasPathSum(root->right, sum-root->val);
}
相关文章推荐
- 112. Path Sum(DFS)
- [leedcode 112] Path Sum
- 【leetcode c++】 112 Path Sum
- leetcode112 Path Sum
- [leetcode 112]Path Sum
- Leetcoede 112 Path Sum 二叉树
- LeetCode题解-112-Path Sum
- 112- Path Sum
- LeetCode 112 Path Sum (DFS)
- 112. Path Sum
- LeetCode 112 Path Sum
- Leetcode#112 Path Sum
- [Leetcode 11] 112 Path Sum
- leetcode_112_Path Sum
- Leetcode 112 path sum & 113 path sum 2
- leetcode 112 Path Sum
- leetcode 112 —— Path Sum
- 112. Path Sum
- Lettcode_112_Path Sum
- 【LEETCODE】112-Path Sum