LeetCode刷题笔记--112. Path Sum

112. Path Sum

Easy

801258FavoriteShare

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.

Note: A leaf is a node with no children.

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 visit(TreeNode* r,int want,int add)
        {
            if(r==NULL)return false;
            add+=r->val;
            if(r->left==NULL&&r->right==NULL)return (add==want);
            else
            {
               return( visit(r->left,want,add)||visit(r->right,want,add));//此处用了||，就是说主要有一个分支true了就true了。
            }
        }
    
    bool hasPathSum(TreeNode* root, int sum) {
        if(root==NULL)return false;
        return visit(root,sum,0);
    }
};