437. Path Sum III
来源:互联网 发布:网络广告公司铭心营销 编辑:程序博客网 时间:2024/05/30 05:30
You are given a binary tree in which each node contains an integer value.
Find the number of paths that sum to a given value.
The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes).
The tree has no more than 1,000 nodes and the values are in the range -1,000,000 to 1,000,000.
Example:
root = [10,5,-3,3,2,null,11,3,-2,null,1], sum = 8 10 / \ 5 -3 / \ \ 3 2 11 / \ \3 -2 1Return 3. The paths that sum to 8 are:1. 5 -> 32. 5 -> 2 -> 13. -3 -> 11
/** * 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 pathSum(TreeNode* root, int sum) { if(!root){ return 0; } return dfs(root, sum, 0) + pathSum(root->left, sum) + pathSum(root->right, sum); } int dfs(TreeNode* root, int sum, int start){ if(!root){ return 0; } int temp = root->val + start; return (temp == sum) + dfs(root->left, sum, temp) + dfs(root->right, sum, temp); }};
阅读全文
0 0
- 437. Path Sum III
- 437. Path Sum III
- 437. Path Sum III
- 437. Path Sum III
- 437. Path Sum III
- 437. Path Sum III
- 437. Path Sum III
- 437. Path Sum III
- 437. Path Sum III
- 437. Path Sum III*
- 437. Path Sum III
- 437. Path Sum III
- 437. Path Sum III
- 437. Path Sum III
- 437. Path Sum III
- 437. Path Sum III
- 437. Path Sum III
- 437. Path Sum III
- 在ubuntu中搜索文件或文件夹的方法
- 【问题处理】arcgis运行在android studio上jar包冲突解决
- 自定义View之开关
- HDU4300 Clairewd’s message(扩展KMP)
- C++ 隐式类型转换
- 437. Path Sum III
- 随心
- 很实用的属性:nowrap
- 数据库连接池浅析
- 开机广播的简单实现
- SSH整合的时候启动tomcat报错
- 忘记密码前端
- activiti和业务集成:使用aop
- So happy!(get 矩阵快速幂)ICPC :E HDU 6198