呓语Beta 2.0 首页 镜头后 灶台前 捐赠者名单 有趣的小站

leetcode 404 Sum Of Left Leaves

文档信息

leetcode 404 Sum Of Left Leaves

解法一

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def sumOfLeftLeaves(self, root, left=False):
        """
        :type root: TreeNode
        :rtype: int
        """
        if not root:
            return 0
        
        ans = 0
        if left and root.left == None and root.right == None:
            ans += root.val
        
        return ans + self.sumOfLeftLeaves(root.left, True) + self.sumOfLeftLeaves(root.right, False)

note

捐赠支持

可以使用支付宝转帐给richard.ma.19850509#gmail.com(请将#替换为@),谢谢!

Fork me on GitHub