257

Author: lazzzis

257/Solution.java

@@ -0,0 +1,17 @@
+class Solution {
+    public List<String> binaryTreePaths(TreeNode root) {
+        List<String> list = new LinkedList<>();
+        if (root == null) return list;
+        dfs(root, "", list);
+        return list;
+    }
+
+    private void dfs(TreeNode root, String path, List<String> list) {
+        if (root.left == null && root.right == null) {
+            list.add(path + root.val);
+            return;
+        }
+        if (root.left != null) dfs(root.left, path + root.val + "->", list);
+        if (root.right != null) dfs(root.right, path + root.val + "->", list);
+    }
+}

README.md

@@ -105,6 +105,7 @@
 - [217 Contains Duplicate](./217)
 - [219 Contains Duplicate II](./219)
 - [238 Product of Array Except Self](./238)
+- [257 Binary Tree Paths](./257)
 - [270 Closest Binary Search Tree Value](./270)
 - [278 First Bad Version](./278)
 - [283 Move Zeroes](./283)