commit

Author: 王俊超

Diff for: .gitignore

@@ -1,4 +1,4 @@
 # Created by .ignore support plugin (hsz.mobi)
-out
+   out
 .idea
 *.iml

Diff for: .idea/modules.xml

@@ -0,0 +1,56 @@
+import java.util.LinkedList;
+import java.util.List;
+
+/**
+ * <pre>
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode(int x) { val = x; }
+ * }
+ * </pre>
+ *
+ * @author: wangjunchao(王俊超)
+ * @time: 2018-10-10 11:16
+ **/
+public class Solution {
+    public List<String> binaryTreePaths(TreeNode root) {
+        List<String> result = new LinkedList<>();
+        binaryTreePaths(root, new LinkedList<>(), result);
+
+        return result;
+    }
+
+    private void binaryTreePaths(TreeNode root, LinkedList<TreeNode> path, List<String> result) {
+
+        if (root == null) {
+            return;
+        }
+
+        path.add(root);
+
+        if (root.left == null && root.right == null) {
+            addResult(path, result);
+        } else {
+            binaryTreePaths(root.left, path, result);
+            binaryTreePaths(root.right, path, result);
+        }
+
+        path.remove(path.size() - 1);
+    }
+
+    private void addResult(LinkedList<TreeNode> path, List<String> result) {
+        StringBuilder builder = new StringBuilder();
+        if (path != null) {
+            for (TreeNode node : path) {
+                builder.append("->").append(node.val);
+            }
+        }
+
+        if (builder.length() > 0) {
+            result.add(builder.substring(2));
+        }
+    }
+}

Diff for: 【257】【Binary Tree Paths】/src/Solution.java

@@ -0,0 +1,16 @@
+/**
+ * @author: wangjunchao(王俊超)
+ * @time: 2018-10-10 11:25
+ **/
+public class Test {
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+
+        TreeNode root = new TreeNode(1);
+        root.left = new TreeNode(2);
+        root.right = new TreeNode(3);
+        root.left.right = new TreeNode(5);
+
+        System.out.println(solution.binaryTreePaths(root));
+    }
+}

Diff for: 【257】【Binary Tree Paths】/src/Test.java

@@ -0,0 +1,15 @@
+/**
+ * Author: 王俊超
+ * Date: 2015-06-18
+ * Time: 10:02
+ * Declaration: All Rights Reserved !!!
+ */
+public class TreeNode {
+    int val;
+    TreeNode left;
+    TreeNode right;
+
+    TreeNode(int x) {
+        val = x;
+    }
+}

Diff for: 【257】【Binary Tree Paths】/src/TreeNode.java

@@ -0,0 +1,26 @@
+/**
+ * @author: wangjunchao(王俊超)
+ * @time: 2018-10-10 13:28
+ **/
+public class Solution {
+    public int addDigits(int num) {
+
+        if (num < 0) {
+            throw new IllegalArgumentException("input num :" + num + ", must not be negative");
+        }
+
+        int result = 0;
+
+        while (num != 0) {
+            result += num % 10;
+            num /= 10;
+
+            if (num == 0 && result > 9) {
+                num = result;
+                result = 0;
+            }
+        }
+
+        return result;
+    }
+}