From effcbb81f0ce97983fc033cc3e9dd954defb24ad Mon Sep 17 00:00:00 2001
From: algorithmzuo <algorithmzuo@163.com>
Date: Thu, 23 Feb 2023 16:56:51 +0800
Subject: [PATCH] modify code

---
 ...ameterOfBinaryTree.java => Code08_DiameterOfBinaryTree.java} | 2 +-
 .../{Code08_MaxSubBSTSize.java => Code09_MaxSubBSTSize.java}    | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)
 rename MCA算法突击课/第03期/mca_03/{Code09_DiameterOfBinaryTree.java => Code08_DiameterOfBinaryTree.java} (96%)
 rename MCA算法突击课/第03期/mca_03/{Code08_MaxSubBSTSize.java => Code09_MaxSubBSTSize.java} (98%)

diff --git a/MCA算法突击课/第03期/mca_03/Code09_DiameterOfBinaryTree.java b/MCA算法突击课/第03期/mca_03/Code08_DiameterOfBinaryTree.java
similarity index 96%
rename from MCA算法突击课/第03期/mca_03/Code09_DiameterOfBinaryTree.java
rename to MCA算法突击课/第03期/mca_03/Code08_DiameterOfBinaryTree.java
index a955b82..98e04a8 100644
--- a/MCA算法突击课/第03期/mca_03/Code09_DiameterOfBinaryTree.java
+++ b/MCA算法突击课/第03期/mca_03/Code08_DiameterOfBinaryTree.java
@@ -4,7 +4,7 @@ package 第03期.mca_03;
 // 一棵二叉树的直径长度是任意两个结点路径长度中的最大值
 // 这条路径可能穿过也可能不穿过根结点
 // 测试链接 : https://leetcode.cn/problems/diameter-of-binary-tree/
-public class Code09_DiameterOfBinaryTree {
+public class Code08_DiameterOfBinaryTree {
 
 	// 提交时不要提交这个类
 	public static class TreeNode {
diff --git a/MCA算法突击课/第03期/mca_03/Code08_MaxSubBSTSize.java b/MCA算法突击课/第03期/mca_03/Code09_MaxSubBSTSize.java
similarity index 98%
rename from MCA算法突击课/第03期/mca_03/Code08_MaxSubBSTSize.java
rename to MCA算法突击课/第03期/mca_03/Code09_MaxSubBSTSize.java
index 17e38c0..ef36c9b 100644
--- a/MCA算法突击课/第03期/mca_03/Code08_MaxSubBSTSize.java
+++ b/MCA算法突击课/第03期/mca_03/Code09_MaxSubBSTSize.java
@@ -7,7 +7,7 @@ package 第03期.mca_03;
 // 右子树的值大于其父（根）节点的值
 // 注意：子树必须包含其所有后代
 // 测试链接 : https://leetcode.cn/problems/largest-bst-subtree
-public class Code08_MaxSubBSTSize {
+public class Code09_MaxSubBSTSize {
 
 	// 提交时不要提交这个类
 	public static class TreeNode {