leetcode129. 求根到叶子节点数字之和 medium

class Solution(object):
    def sumNumbers(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        self.list=[]
        self.sum=0
        def rec(root):
            if not root:
                return 0
            self.list.append(root.val)
            rec(root.left)
            rec(root.right)
            if not root.left and not root.right:
                string=''
                for num in self.list:
                    string+=str(num)
                self.sum+=int(string)
            self.list.pop()
            return 0
        rec(root)
        return self.sum