algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 16:54:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1959 from ZerenZhang2022/patch-16

Browse Source 
Update 0112.路径总和.md
This commit is contained in:
程序员Carl
2023-03-31 11:23:00 +08:00
committed by GitHub
parent 5c0e98ef29 79dfddde05
commit f0db0605f3
1 changed files with 6 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0112.路径总和.md
View File

@ -475,6 +475,12 @@ class solution:
return false # 别忘记处理空treenode return false # 别忘记处理空treenode
else: else:
return isornot(root, targetsum - root.val) return isornot(root, targetsum - root.val)
class Solution: # 简洁版
def hasPathSum(self, root: Optional[TreeNode], targetSum: int) -> bool:
if not root: return False
if root.left==root.right==None and root.val == targetSum: return True
return self.hasPathSum(root.left,targetSum-root.val) or self.hasPathSum(root.right,targetSum-root.val)
``` ```
**迭代 - 层序遍历** **迭代 - 层序遍历**