Leetcode 112 path sum & 113 path sum 2
给定一棵二叉树和一个整数。path sum 要求判断在该二叉树中是否存在一条根节点到叶子结点的路径,路径上的数字和等于给出的整数。path sum 2要求返回所有满足的路径。
算法
遍历整棵二叉树,在遍历的同时,若向子代走,则将节点值加起来,若回溯,则减掉节点值。
对于path sum,在每个叶子结点处进行判断当前和是否等于要求的整数,并返回true/false。
对于path sum 2 , 在每个节点处将节点值加起来的同时还要将该节点值保存在一个数组中,同时减掉节点值时将节点值从数组中删掉,然后在每个叶子节点处和path sum一样进行判断,若等于目标,则将目前数组保存。最后返回所有保存的数组。
code
path sum
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
bool hasPathSum(TreeNode* root, int sum) {
if(root==NULL) return false;
int nowsum = 0;
return traver(root, nowsum, sum);
}
bool traver(TreeNode* root, int& nowsum, int sum){
nowsum += root->val;
if (root->left == NULL && root->right == NULL){
if(nowsum == sum) return true;
}
else if(root->left!=NULL && root->right==NULL){
if(traver(root->left, nowsum, sum)) return true;
}
else if(root->left==NULL && root->right!=NULL){
if(traver(root->right, nowsum, sum)) return true;
}
else if(root->left!=NULL&&root->right!=NULL){
if(traver(root->left, nowsum, sum)||traver(root->right, nowsum, sum)) return true;
}
nowsum -= root->val;
return false;
}
};
path sum 2
class Solution {
public:
vector<vector<int>> pathSum(TreeNode* root, int sum) {
vector<vector<int>> allvpath;
vector<int> currentpath;
if (root == NULL) return allvpath;
int nowsum = 0;
traver(root, nowsum, sum, allvpath, currentpath);
return allvpath;
}
void traver(TreeNode* root, int& nowsum, int sum, vector<vector<int>>& allvpath, vector<int>& currentpath){
currentpath.push_back(root->val);
nowsum += root->val;
if (root->left == NULL && root->right == NULL){
if(nowsum == sum) allvpath.push_back(currentpath);
}
else if(root->left!=NULL && root->right==NULL){
traver(root->left, nowsum, sum, allvpath, currentpath);
}
else if(root->left==NULL && root->right!=NULL){
traver(root->right, nowsum, sum, allvpath, currentpath);
}
else if(root->left!=NULL&&root->right!=NULL){
traver(root->left, nowsum, sum, allvpath, currentpath);
traver(root->right, nowsum, sum, allvpath, currentpath);
}
nowsum -= root->val;
currentpath.erase(currentpath.end() - 1);
}
};
时间复杂度
两种情况都是O(n), n为二叉树中的节点数。