Re: [闲聊] 每日leetcode

楼主: argorok (s.green)   2024-04-15 14:10:17
今天有想到 赶快练习一下
无脑implace改值再加起来
感觉不太优就是了==
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution(object):
def sumNumbers(self, root):
"""
:type root: TreeNode
:rtype: int
"""
if not root:
return 0
if not (root.left or root.right):
return root.val
else:
if root.left:
root.left.val += root.val * 10
if root.right:
root.right.val += root.val * 10
return self.sumNumbers(root.left) + self.sumNumbers(root.right)

Links booklink

Contact Us: admin [ a t ] ucptt.com