题目
给定一个二叉树和一个目标和,找到所有从根节点到叶子节点路径总和等于给定目标和的路径。
说明:叶子节点是指没有子节点的节点。
示例:
给定如下二叉树,以及目标和 sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ / \
7 2 5 1
返回:
[
[5,4,11,2],
[5,8,4,5]
]
解题思路
DFS,最省代码的方式是采用递归遍历;
记录遍历路径的节点、路径和;
对叶子结点判断路径和是否为目标值;
Code in C++
/**
* 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 {
private:
int _sum;
void _AddResult(vector<vector<int>> &results, vector<TreeNode*> &candidate) {
vector<int> result;
for (vector<TreeNode*>::iterator iter = candidate.begin(); iter != candidate.end(); ++iter)
result.push_back((*iter)->val);
results.push_back(result);
return;
}
void _help(TreeNode* root, int tmpSum, vector<vector<int>> &results, vector<TreeNode*> &candidate) {
if (nullptr == root)
return;
tmpSum += root->val;
candidate.push_back(root);
if (tmpSum == _sum && nullptr == root->left && nullptr == root->right) {
_AddResult(results, candidate);
candidate.pop_back();
return;
}
_help(root->left, tmpSum, results, candidate);
_help(root->right, tmpSum, results, candidate);
candidate.pop_back();
return;
}
public:
vector<vector<int>> pathSum(TreeNode* root, int sum) {
vector<vector<int>> results;
if (nullptr == root)
return results;
vector<TreeNode*> candidate;
_sum = sum;
_help(root, 0, results, candidate);
return results;
}
};
效率
优化方案
- 采用非递归的先序遍历