最简单的递归
/**
* 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:
int pathNumber=0;
int pathSum(TreeNode* root, int sum) {
if(!root) return 0;
path(root,sum);
pathSum(root->left,sum);
pathSum(root->right,sum);
return pathNumber;
}
void path(TreeNode* root, int sum){
if(!root) return;
sum-=root->val;
if(!sum) ++pathNumber;
path(root->left,sum);
path(root->right,sum);
}
};