LeetCode 129. Sum Root to Leaf Numbers

LeetCode 129

这个题目只需要按层遍历, 利用一个queue,把当前层放入queue,同时计算出当前的数值加入到结果就可以了.

class Solution:
    def sumNumbers(self, root: TreeNode) -> int:
        q = [(0, root)]
        result = 0
        while q:
            pv, cnode = q.pop(0)
            if cnode.left == None and cnode.right == None:
                result += pv*10 + cnode.val
            else:
                if cnode.left != None:
                    q.append([pv*10 + cnode.val, cnode.left])
                if cnode.right != None:
                    q.append([pv*10 + cnode.val, cnode.right])

        return result