leetcode刷题笔记(Golang)--112. Path Sum

最新推荐文章于 2024-09-15 15:43:59 发布

圆滚滚coder

最新推荐文章于 2024-09-15 15:43:59 发布

阅读量126

点赞数

分类专栏： leetcode刷题笔记(Golang) 文章标签： leetcode go golang

本文链接：https://blog.csdn.net/weixin_44555304/article/details/104385832

版权

leetcode刷题笔记(Golang) 专栏收录该内容

172 篇文章 4 订阅

订阅专栏

112. Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

Note: A leaf is a node with no children.

Example:

Given the below binary tree and sum = 22,

  5
 / \
4   8

/ /
11 13 4
/ \
7 2 1
return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

func hasPathSum(root *TreeNode, sum int) bool {
	if root == nil {
		return false
	}
	if root.Left == nil && root.Right == nil {
		return root.Val == sum
	}
	return hasPathSum(root.Left, sum-root.Val) || hasPathSum(root.Right, sum-root.Val)
}