Merge pull request gzc426#336 from za1275952454/master

gzc426 · web-flow · commit 7cf5e20895e5 · 2018-12-06T21:49:54.000+08:00
1
diff --git a/2018.12.07-leetcode104/fish.md b/2018.12.07-leetcode104/fish.md
@@ -0,0 +1,30 @@
+```
+public class Solution {
+    public static int deepOfTree(TreeNode treeNode, int level){
+        if (treeNode == null) {
+            return level;
+        }
+        int left = deepOfTree(treeNode.getLeft(), level + 1);
+        int right = deepOfTree(treeNode.getRight(), level + 1);
+        return  left > right ? left : right;
+    }
+    public static void main(String[] args) {
+        TreeNode r4r = new TreeNode(21, null, null);
+        TreeNode r4l = new TreeNode(22, null, null);
+
+        TreeNode r3r = new TreeNode(7, null, null);
+        TreeNode r3l = new TreeNode(15, r4l, r4r);
+        TreeNode l2r = new TreeNode(20, r3l, r3r);
+        TreeNode l2l = new TreeNode(9, null, null);
+        TreeNode root = new TreeNode(3, l2l, l2r);
+        System.out.println(deepOfTree(root, 0));
+    }
+}
+@Data
+@AllArgsConstructor
+@NoArgsConstructor
+class TreeNode{
+    private int val;
+    private TreeNode left;
+    private TreeNode right;
+}
diff --git a/fish.md b/fish.md
@@ -0,0 +1,42 @@
+```````
+public class Solution {
+    public static List<List<Integer>> levelOrder(TreeNode root) {
+        List<List<Integer>> list = new ArrayList<>();
+        if (root == null) {
+            return list;
+        }
+        levelOrder(list, root, 0);
+        return list;
+    }
+
+    public static void levelOrder(List<List<Integer>> list, TreeNode node, int level) {
+        if (node == null) {
+            return;
+        }
+        if (list.size() < level + 1) {
+            List<Integer> levelEle = new ArrayList<>();
+            list.add(levelEle);
+        }
+        list.get(level).add(node.getVal());
+        levelOrder(list, node.getLeft(), level + 1);
+        levelOrder(list, node.getRight(), level + 1);
+    }
+
+    public static void main(String[] args) {
+        TreeNode r3r = new TreeNode(7, null, null);
+        TreeNode r3l = new TreeNode(15, null, null);
+        TreeNode l2r = new TreeNode(20, r3l, r3r);
+        TreeNode l2l = new TreeNode(9, null, null);
+        TreeNode root = new TreeNode(3, l2l, l2r);
+        System.out.println(levelOrder(root));
+    }
+}
+
+@Data
+@AllArgsConstructor
+@NoArgsConstructor
+class TreeNode {
+    private Integer val;
+    private TreeNode left;
+    private TreeNode right;
+}
