Skip to content

Commit 79341da

Browse files
dunwudunwu
committed
update codes
1 parent 595b69c commit 79341da

27 files changed

+451
-366
lines changed

‎codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/BinaryTreePaths.java‎

Lines changed: 0 additions & 59 deletions
This file was deleted.

‎codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/LevelOrderBottom.java‎

Lines changed: 0 additions & 58 deletions
This file was deleted.

‎codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/MinDiffInBST.java‎

Lines changed: 0 additions & 61 deletions
This file was deleted.

codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/TreeMaxDepth.java renamed to codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/N叉树的最大深度.java

Lines changed: 6 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -18,20 +18,19 @@
1818
//
1919
// 树的深度不会超过 1000。
2020
// 树的节点总不会超过 5000。
21+
public class N叉树的最大深度 {
2122

22-
public class TreeMaxDepth {
23-
24-
public int maxDepth(Node root) {
23+
public static int maxDepth(Node root) {
2524
if (root == null) return 0;
2625
if (root.children == null || root.children.size() == 0) return 1;
27-
int subMax = 0;
26+
int max = 0;
2827
for (Node node : root.children) {
2928
int temp = maxDepth(node);
30-
if (temp > subMax) {
31-
subMax = temp;
29+
if (temp > max) {
30+
max = temp;
3231
}
3332
}
34-
return subMax + 1;
33+
return max + 1;
3534
}
3635

3736
static class Node {

‎codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/TreeUtils.java‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
11
package io.github.dunwu.algorithm.tree;
22

3+
import io.github.dunwu.algorithm.tree.btree.TreeNode;
4+
35
import java.util.ArrayList;
46
import java.util.LinkedList;
57
import java.util.List;

‎codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/ZigzagLevelOrder.java‎

Lines changed: 0 additions & 75 deletions
This file was deleted.

codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/BTree.java renamed to codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/btree/BTree.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package io.github.dunwu.algorithm.tree;
1+
package io.github.dunwu.algorithm.tree.btree;
22

33
import java.util.*;
44

codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/BTreeDemo.java renamed to codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/btree/BTreeDemo.java

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package io.github.dunwu.algorithm.tree;
1+
package io.github.dunwu.algorithm.tree.btree;
22

33
import java.util.LinkedList;
44
import java.util.Queue;
@@ -162,11 +162,11 @@ public static TreeNode _sortedArrayToBST(int[] nums, int left, int right) {
162162

163163
public static class TreeNode {
164164

165-
int val;
165+
public int val;
166166

167-
TreeNode left;
167+
public TreeNode left;
168168

169-
TreeNode right;
169+
public TreeNode right;
170170

171171
public TreeNode(int val) { this.val = val; }
172172

codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/BinaryTree.java renamed to codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/btree/BinaryTree.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package io.github.dunwu.algorithm.tree;
1+
package io.github.dunwu.algorithm.tree.btree;
22

33
import io.github.dunwu.algorithm.common.ITree;
44

codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/TreeNode.java renamed to codes/algorithm/src/main/java/io/github/dunwu/algorithm/tree/btree/TreeNode.java

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,16 +1,16 @@
1-
package io.github.dunwu.algorithm.tree;
1+
package io.github.dunwu.algorithm.tree.btree;
22

33
/**
44
* @author <a href="mailto:forbreak@163.com">Zhang Peng</a>
55
* @since 2020-01-28
66
*/
77
public class TreeNode {
88

9-
int val;
9+
public int val;
1010

11-
TreeNode left;
11+
public TreeNode left;
1212

13-
TreeNode right;
13+
public TreeNode right;
1414

1515
public TreeNode(int val) { this.val = val; }
1616

0 commit comments

Comments
 (0)