路径总和I
给定一个二叉树和一个目标和,判断该树中是否存在根节点到叶子节点的路径,这条路径上所有节点值相加等于目标和。
class Solution {
public:
bool hasPathSum(TreeNode* root, int sum) {
if(root == NULL) return false;
sum = sum - root->val;
if(root->left == NULL && root->right == NULL)
return (sum == 0);
return hasPathSum(root->left, sum) || hasPathSum(root->right, sum);
}
};
路径总和II
给定一个二叉树和一个目标和,找到所有从根节点到叶子节点路径总和等于给定目标和的路径。
这里指的是从根节点到叶子节点的路径
主要思想就是回溯算法
class Solution {
public:
vector<vector<int>> pathSum(TreeNode* root, int sum) {
vector<vector<int>> res;
if(root == NULL) return res;
vector<int> rev;
helper(root, sum, res, rev);
return res;
}
void helper(TreeNode* head, int sum, vector<vector<int>> &res, vector<int> &rev)
{
if(head == NULL) return;
sum = sum - head->val;
rev.push_back(head->val);
if(head->left == NULL && head->right == NULL)
{
if(sum == 0)
res.push_back(rev);
}
if(head->left != NULL) helper(head->left, sum, res, rev);
if(head->right != NULL) helper(head->right, sum, res, rev);
rev.pop_back();
return;
}
};
路径总和III
给定一个二叉树,它的每个结点都存放着一个整数值。
找出路径和等于给定数值的路径总数。
路径不需要从根节点开始,也不需要在叶子节点结束,但是路径方向必须是向下的(只能从父节点到子节点)。
核心思想:前缀和
class Solution {
public:
int count;
int pathSum(TreeNode* root, int sum) {
//if(root == NULL) return 0;
long prefixsum = 0;
//int count = 0;
unordered_map<long, int> mymap;
mymap[0] = 1;
helper(root, sum, prefixsum, mymap);
return count;
}
void helper(TreeNode* root, int sum, long prefixsum, unordered_map<long, int>& mymap)
{
if(root == NULL) return;
prefixsum += root->val;
//看以前是否出现过
if(mymap.find(prefixsum-sum) != mymap.end()) count += mymap[prefixsum-sum];
mymap[prefixsum]++;
helper(root->left, sum, prefixsum, mymap);
helper(root->right, sum, prefixsum, mymap);
mymap[prefixsum]--;
}
};