2020-01-19

JiayangWu · JiayangWu · commit 67b55f21a4de · 2020-01-19T23:58:25.000-05:00
diff --git a/0257.二叉树的所有路径/0257-二叉树的所有路径.py b/0257.二叉树的所有路径/0257-二叉树的所有路径.py
@@ -12,18 +12,19 @@ def binaryTreePaths(self, root):
         :rtype: List[str]
         """
         if not root:
-          return []
-        if not root.left and not root.right:
-          return [str(root.val)]
+            return []
         self.res = []
+        
         def dfs(node, tmp):
-          if not node:
-            return 
-          if not node.left and not node.right:
-            self.res.append(tmp + "->" + str(node.val))
-          dfs(node.left, tmp + "->" + str(node.val))
-          dfs(node.right, tmp + "->" + str(node.val))
-          
-        dfs(root.left, str(root.val))
-        dfs(root.right, str(root.val))
-        return self.res
+            if not node:
+                return
+            if not node.left and not node.right:
+                self.res.append(tmp + str(node.val))
+                return
+            
+            dfs(node.left, tmp + str(node.val) + "->")
+            dfs(node.right, tmp + str(node.val) + "->")
+            
+        dfs(root, "")
+        return self.res
+        
