Golang Leetcode 1022. Sum of Root To Leaf Binary Numbers.go

思路

每次遍历的时候，之前的路径*2 + 当前的节点值当做路径表示的整数。

code

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

var ret int

func sumRootToLeaf(root *TreeNode) int {
	ret = 0
	helper(root, 0)
	return ret
}
func helper(root *TreeNode, sum int) {
	if root == nil {
		return
	}
	sum = sum << 1
	sum += root.Val
	if root.Left == nil && root.Right == nil {
		ret += sum
		return
	}
	if root.Left != nil {
		helper(root.Left, sum)
	}
	if root.Right != nil {
		helper(root.Right, sum)
	}
}

更多内容请移步我的repo：https://github.com/anakin/golang-leetcode