剑指offer--面试题25: 二叉树中和为某一值的路径



题目描述

输入一颗二叉树和一个整数，打印出二叉树中结点值的和为输入整数的所有路径。路径定义为从树的根结点开始往下一直到叶结点所经过的结点形成一条路径。

python实现：

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    # 返回二维列表，内部每个列表表示找到的路径
    def FindPath(self, root, expectNumber):
        # write code here
        if root is None:
            return []
        result = []
        
        def dfs(root, tmp, cursum): # 利用先序遍历
            if root:
                cursum += root.val
                tmp.append(root.val)
                if root.left is None and root.right is None: # 叶子结点
                    if cursum == expectNumber:
                        result.append(tmp[:])
                dfs(root.left, tmp, cursum)
                dfs(root.right, tmp, cursum)
                cursum -= root.val # cursum为非引用型变量，所以这一句也可以不写
                tmp.pop()
                
            
        dfs(root, [], 0)
        return result

c++实现：

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};*/
class Solution {
public:
    vector<vector<int> > FindPath(TreeNode* root,int expectNumber) {
        vector<vector<int> > result;
        vector<int> tmpPath;
        if(root==NULL)
            return result;
        dfs(root, expectNumber, result, tmpPath);
        return result;
         
    }
     
    void dfs(TreeNode* root,int target, vector<vector<int>> &result, vector<int> &tmpPath){
        if(root){
            tmpPath.push_back(root->val);
            target -= root->val;
            bool isLeaf = root->left==NULL && root->right==NULL;
            if(target==0 && isLeaf)
                result.push_back(tmpPath);
            dfs(root->left, target, result, tmpPath);
            dfs(root->right, target, result, tmpPath);
            tmpPath.pop_back();
            target += root->val;
        }
    }
};