LeetCode 112. Path Sum
Solution1:我的答案
递归写的好麻烦啊
/**
* 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)
return false;
else
return my_hasPathSum(root, sum);
}
bool my_hasPathSum(TreeNode* root, int sum) {
if (!root->left && !root->right) {
if (sum - root->val == 0)
return true;
else
return false;
}
else if (root->left && !root->right)
return my_hasPathSum(root->left, sum - root->val);
else if (!root->left && root->right)
return my_hasPathSum(root->right, sum - root->val);
else
return my_hasPathSum(root->left, sum - root->val)
|| my_hasPathSum(root->right, sum - root->val);
}
};
Solution2:
简练的递归写法
参考网址:http://www.cnblogs.com/grandyang/p/4036961.html
/**
* 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) {
if (root == NULL) return false;
if (root->left == NULL && root->right == NULL && root->val == sum ) return true;
return hasPathSum(root->left, sum - root->val) || hasPathSum(root->right, sum - root->val);
}
};