擅长:python、mysql、java
<p>我认为这是一对相互交织的递归函数:</p>
<pre><code>class Solution:
def sumOfLeftLeaves(self, node):
total = 0
if node:
if node.left:
total += self.sumOfLeftLeaf(node.left)
return total + self.sumOfLeftLeaves(node.right)
return total
def sumOfLeftLeaf(self, node):
total = node.val
if node.left:
total += self.sumOfLeftLeaf(node.left)
return total + self.sumOfLeftLeaves(node.right)
</code></pre>
<p>一个是通用节点处理程序,另一个专门处理左手节点</p>