26 lines
488 B
Go
26 lines
488 B
Go
package main
|
|
|
|
type TreeNode struct {
|
|
Val int
|
|
Left *TreeNode
|
|
Right *TreeNode
|
|
}
|
|
|
|
/**
|
|
* Definition for a binary tree node.
|
|
* type TreeNode struct {
|
|
* Val int
|
|
* Left *TreeNode
|
|
* Right *TreeNode
|
|
* }
|
|
*/
|
|
func hasPathSum(root *TreeNode, targetSum int) bool {
|
|
if root == nil {
|
|
return false
|
|
}
|
|
if root.Left == nil && root.Right == nil {
|
|
return targetSum == root.Val
|
|
}
|
|
return hasPathSum(root.Left, targetSum-root.Val) || hasPathSum(root.Right, targetSum-root.Val)
|
|
}
|