[leetcode] 113. Path Sum II

Description

Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.

Note: A leaf is a node with no children.

Example:

Given the below binary tree and sum = 22,

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

Return:

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

分析

题目的意思是：给定一棵二叉树，找出根结点到叶子节点路径的值的和等于给定sum值的路径。

• 这里本质上就是一个二叉树的遍历，注意最后判断条件，当左右子树都为空的时候，说明到达了叶子结点，然后判断是否符合题目要求，我用vector来装路径，如果符合，就把这个vector装进结果集合，这样遍历下去，直到把二叉树遍历完为止。

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 {
public:
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        vector<vector<int>> res;
        vector<int> v1;
        solve(res,v1,root,sum);
        return res;
    }
    void solve(vector<vector<int>>& res,vector<int> v1,TreeNode* root, int sum){
        if(!root){
            return ;
        }
        if(!root->left&&!root->right&&sum==root->val){
            v1.push_back(root->val);
            res.push_back(v1);
            return;
        }
        v1.push_back(root->val);
        solve(res,v1,root->left,sum-root->val);
        solve(res,v1,root->right,sum-root->val);
    }
};

Python实现

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def solve(self, root, ans, res, targetSum):
        if root is None:
            return
        ans.append(root.val)
        if root.left is None and root.right is None:
            if sum(ans)==targetSum:
                res.append(ans[:])
        else:
            self.solve(root.left,ans, res, targetSum)
            self.solve(root.right, ans, res, targetSum)
        ans.pop()

    def pathSum(self, root: Optional[TreeNode], targetSum: int) -> List[List[int]]:
        res = []
        self.solve(root,[], res, targetSum)
        return res

参考文献

[编程题]path-sum-ii