diff --git a/algorithm-learning-common/target/classes/log4j2.xml b/algorithm-learning-common/target/classes/log4j2.xml
deleted file mode 100644
index f5177ea..0000000
--- a/algorithm-learning-common/target/classes/log4j2.xml
+++ /dev/null
@@ -1,14 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/algorithm-learning-ilene/src/main/java/com/example/ilene/DiameterofBinaryTree.java b/algorithm-learning-ilene/src/main/java/com/example/ilene/DiameterofBinaryTree.java
new file mode 100644
index 0000000..cf6c343
--- /dev/null
+++ b/algorithm-learning-ilene/src/main/java/com/example/ilene/DiameterofBinaryTree.java
@@ -0,0 +1,43 @@
+package com.example.ilene;
+
+import com.example.common.TemplateCallBack;
+import com.example.common.TreeNode;
+import lombok.extern.slf4j.Slf4j;
+import junit.framework.Assert;
+
+
+/**
+ * 543. 二叉树的直径
+ * 给定一棵二叉树，你需要计算它的直径长度。一棵二叉树的直径长度是任意两个结点路径长度中的最大值。这条路径可能穿过也可能不穿过根结点。
+ */
+@Slf4j
+public class DiameterofBinaryTree implements TemplateCallBack {
+ int ans = 0;
+ public int diameterOfBinaryTree(TreeNode root) {
+ sideDepth(root);
+ return ans;
+ }
+
+ public int sideDepth(TreeNode root){
+ if (root == null){
+ return 0;
+ }
+
+ int leftDepth = sideDepth(root.left);
+ int rightDepth = sideDepth(root.right);
+ ans = Math.max(ans, leftDepth+rightDepth);
+ return Math.max(leftDepth, rightDepth)+1;
+
+ }
+ TreeNode root1;
+ @Override
+ public void generateCase() {
+ Integer[] case1 = new Integer[]{1, 2, 3, 4, 5};
+ root1 = TreeNode.getInstance(case1);
+ }
+
+ @Override
+ public void run() {
+ Assert.assertEquals(3, sideDepth(root1));
+ }
+}
diff --git a/algorithm-learning-loorr/target/classes/log4j2.xml b/algorithm-learning-loorr/target/classes/log4j2.xml
deleted file mode 100644
index f5177ea..0000000
--- a/algorithm-learning-loorr/target/classes/log4j2.xml
+++ /dev/null
@@ -1,14 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file