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

leetcode 257 Binary Tree Paths

文档信息

leetcode 257 Binary Tree Paths

解法一

# 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 __init__(self):
        self.ans = []
        
    def binaryTreePaths(self, root, s=""):
        """
        :type root: TreeNode
        :rtype: List[str]
        """
        if root == None:
            return self.ans
        
        if s == "":
            s += str(root.val)
        else:
            s += "->" + str(root.val)
            
        if root.left == None and root.right == None:
            self.ans.append(s)
        
        self.binaryTreePaths(root.left, s)
        self.binaryTreePaths(root.right, s)

        return self.ans

note

捐赠支持

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

Fork me on GitHub