**《剑指offer》24：二叉树中和为某一值的路径

题目描述

输入一颗二叉树的跟节点和一个整数，打印出二叉树中结点值的和为输入整数的所有路径。路径定义为从树的根结点开始往下一直到叶结点所经过的结点形成一条路径。(注意: 在返回值的list中，数组长度大的数组靠前)

思路：递归实现

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>> a;
    vector<int> t;
    
    void dfs(TreeNode *r, int n)
    {
        t.push_back(r -> val);
        if(n - r -> val == 0 && !r -> left && !r -> right)
            a.push_back(t);
        else
        {
            if(r -> left)
                dfs(r -> left, n - r -> val);
            if(r -> right)
                dfs(r -> right, n - r -> val);
        }
        
        t.pop_back();
    }
    
    vector<vector<int> > FindPath(TreeNode* root,int expectNumber) {
        if(root == NULL)
            return a;
        
        dfs(root, expectNumber);
        
        return a;
    }
};

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
        t = []
        if root == None:
            return []
                
        a = []
        def dfs(r, t, n):
            n = n + r.val
            t.append(r)
            if n == expectNumber and r.left == None and r.right == None:
                tt = []
                for i in t:
                    tt.append(i.val)
                a.append(tt)
                
            if expectNumber > n:
                if r.left != None:
                    dfs(r.left, t, n)
                if r.right != None:
                    dfs(r.right, t, n)
        
            t.pop();
        
        dfs(root, [], 0)
        
        return a