LeetCode 112. Path Sum 题解

112. Path Sum

 

Question Editorial Solution

  My Submissions

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.

解题思路：

如果根节点为空，则返回false。否则就递归的分别搜索左子树，和右子树。搜索左右子树即为。

return hasPathSum(root->right,sum-root->val);

return hasPathSum(root->left,sum-root->val);

返回左右子节点结果的或值。

代码展示：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
int c_count =0;
class Solution {
public:
    bool hasPathSum(TreeNode* root, int sum) {
        if(!c_count&&root==NULL)
            return false;
        if(root==NULL&&sum==0)
          {   if(c_count)
                return true;
              else 
                return false;
          }
        c_count++;
        if(root==NULL&&sum!=0)
            return false;
        if(root->left==NULL)
            return hasPathSum(root->right,sum-root->val);
        else if(root->right==NULL)
            return hasPathSum(root->left,sum-root->val);
        return hasPathSum(root->left,sum-root->val)||hasPathSum(root->right,sum-root->val);
        
        
    }
};