给定一个节点数为 n 的二叉树和一个值 sum ,请找出所有的根节点到叶子节点的节点值之和等于的路径,如果没有则返回空。
思路:递归获取路径和即可,用一个栈来存储路径上的节点即可,后进先出。
package main
/*
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
/**
*
* @param root TreeNode类
* @param sum int整型
* @return int整型二维数组
*/
var pathSumOut [][]int
func pathSum(root *TreeNode, sum int) [][]int {
// write code here
if root == nil {
return pathSumOut
}
var path []int
path = append(path, root.Val)
getPathSum(root, 0, sum, path)
return pathSumOut
}
func getPathSum(root *TreeNode, sum int, targartSum int, path []int) {
if root.Right == nil && root.Left == nil {
if sum+root.Val == targartSum {
//需要给path一个全新的存放位置
pathSumOut = append(pathSumOut, append([]int{}, path...))
}
return
}
if root.Left != nil {
path = append(path, root.Left.Val)
getPathSum(root.Left, sum+root.Val, targartSum, path)
path = path[:len(path)-1]
}
if root.Right != nil {
path = append(path, root.Right.Val)
getPathSum(root.Right, sum+root.Val, targartSum, path)
path = path[:len(path)-1]
}
}