leetcode113 - path sum II - medium
发布时间:2020-12-14 05:06:27 所属栏目:大数据 来源:网络整理
导读:Given a binary tree and a sum,find all root-to-leaf paths where each path‘s sum 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 5 1 Return:
Given a binary tree and a sum,find all root-to-leaf paths where each path‘s sum equals the given sum. Note:?A leaf is a node with no children. Example: Given the below binary tree and? 5 / 4 8 / / 11 13 4 / / 7 2 5 1 Return: [ [5,4,11,2],[5,8,5] ] class Solution: def pathSum(self,root: TreeNode,sum: int) -> List[List[int]]: ans = [] if not root: return ans self.help(root,ans,[],sum) return ans def help(self,root,path,sum): if not root: return ans if not root.left and not root.right and root.val == sum: ans.append(path+[root.val]) self.help(root.left,path+[root.val],sum-root.val) self.help(root.right,sum-root.val) return ans (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |