题解 | #二叉树中和为某一值的路径(二)#

package main

import . "nc_tools"

/*
 * type TreeNode struct {
 *   Val int
 *   Left *TreeNode
 *   Right *TreeNode
 * }
 */

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param root TreeNode类
 * @param target int整型
 * @return int整型二维数组
 */
func FindPath(root *TreeNode, target int) [][]int {
	// write code here
	var ret [][]int
	var path []int

	var dfs func(root *TreeNode, target int)
	dfs = func(root *TreeNode, target int) {
		if root == nil {
			return
		}
		path = append(path, root.Val)
		target -= root.Val
		if root.Left == nil && root.Right == nil && target == 0 {
			ret = append(ret, append([]int{}, path...))
		}
		dfs(root.Left, target)
		dfs(root.Right, target)
		path = path[:len(path)-1]
	}
	dfs(root, target)

	return ret
}