1 题目描述
给定一个二叉树和一个值 sum,请找出所有根节点到叶子节点的节点值之和为 sum的路径。
3 代码实现
/**
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
class Solution {
public:
/**
*
* @param root TreeNode类
* @param sum int整型
* @return int整型vector<vector<>>
*/
vector<vector<int> > pathSum(TreeNode* root, int sum) {
vector<vector<int>> path_list;
vector<int> path;
pathSumHelper(root, sum, path_list, path);
return path_list;
}
void pathSumHelper(TreeNode* root, int sum, vector<vector<int>>& path_list, vector<int> path){
if(root == NULL)
return;
path.push_back(root->val);
if(root->left == NULL && root->right == NULL && sum - root->val == 0)
path_list.push_back(path);
pathSumHelper(root->left, sum - root->val, path_list, path);
pathSumHelper(root->right, sum - root->val, path_list, path);
}
};
4 运行结果
运行时间:5ms
占用内存:796k