LeetCode_113.路径总和2

113. 路径总和 II

给定一个二叉树和一个目标和，找到所有从根节点到叶子节点路径总和等于给定目标和的路径。

说明: 叶子节点是指没有子节点的节点。

示例:
给定如下二叉树，以及目标和 sum = 22，

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \    / \
        7    2  5   1

返回:

[
   [5,4,11,2],
   [5,8,4,5]
]

---

解题思路：

 

解题代码：

1.

class Solution {
public:
	vector<int> tmp;
	vector<vector<int>> result;
	vector<vector<int>> path(TreeNode* root, int sum, vector<int> tmp) {
		if (root == NULL)
			return{};
		tmp.push_back(root->val);
		if (root->val == sum && root->left == NULL && root->right == NULL) {
			result.push_back(tmp);
			return result;
		}
		else if (root->left == NULL && root->right == NULL) {
			return result;
		}
		path(root->left, sum - root->val, tmp);
		path(root->right, sum - root->val, tmp);
		return result;
	}
	vector<vector<int>> pathSum(TreeNode* root, int sum) {
		vector<vector<int>> result = path(root, sum, tmp);
		return result;
	}
};

2.更好的解法

class Solution {
public:
    vector<vector<int>> res;
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        vector<int> curr;
        dfs(root,curr,0,sum);
        return res;
    }
    
    void dfs(TreeNode* root, vector<int>& curr, int sum, int target){
        if(!root) return;
        if(!root->left && !root->right && root->val+sum == target){
            curr.push_back(root->val);
            res.push_back(curr);
            curr.pop_back();
        }
        curr.push_back(root->val);
        dfs(root->left,curr,sum+root->val,target);
        dfs(root->right,curr,sum+root->val,target);
        curr.pop_back();
    }
};