modify code

algorithmzuo · algorithmzuo · commit 3af73df5bc72 · 2021-01-13T12:47:14.000+08:00
diff --git a/src/class06/Code01_MergeKSortedLists.java b/src/class06/Code01_MergeKSortedLists.java
@@ -4,7 +4,7 @@
 import java.util.PriorityQueue;
 
 // 测试链接：https://leetcode.com/problems/merge-k-sorted-lists/
-public class Code02_MergeKSortedLists {
+public class Code01_MergeKSortedLists {
 
 	public static class ListNode {
 		public int val;
diff --git a/src/class06/Code02_SameTree.java b/src/class06/Code02_SameTree.java
@@ -1,7 +1,7 @@
 package class06;
 
 // 测试链接：https://leetcode.com/problems/same-tree
-public class Code03_SameTree {
+public class Code02_SameTree {
 
 	public static class TreeNode {
 		public int val;
diff --git a/src/class06/Code03_SymmetricTree.java b/src/class06/Code03_SymmetricTree.java
@@ -1,7 +1,7 @@
 package class06;
 
 // 测试链接：https://leetcode.com/problems/symmetric-tree
-public class Code04_SymmetricTree {
+public class Code03_SymmetricTree {
 
 	public static class TreeNode {
 		public int val;
diff --git a/src/class06/Code04_MaximumDepthOfBinaryTree.java b/src/class06/Code04_MaximumDepthOfBinaryTree.java
@@ -1,7 +1,7 @@
 package class06;
 
 // 测试链接：https://leetcode.com/problems/maximum-depth-of-binary-tree
-public class Code05_MaximumDepthOfBinaryTree {
+public class Code04_MaximumDepthOfBinaryTree {
 
 	public static class TreeNode {
 		public int val;
diff --git a/src/class06/Code05_ConstructBinaryTreeFromPreorderAndInorderTraversal.java b/src/class06/Code05_ConstructBinaryTreeFromPreorderAndInorderTraversal.java
@@ -2,7 +2,8 @@
 
 import java.util.HashMap;
 
-public class Code06_ConstructBinaryTreeFromPreorderAndInorderTraversal {
+//测试链接：https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal
+public class Code05_ConstructBinaryTreeFromPreorderAndInorderTraversal {
 
 	public static class TreeNode {
 		int val;
diff --git a/src/class06/Code06_BinaryTreeLevelOrderTraversalII.java b/src/class06/Code06_BinaryTreeLevelOrderTraversalII.java
@@ -5,7 +5,7 @@
 import java.util.Queue;
 
 // 测试链接：https://leetcode.com/problems/binary-tree-level-order-traversal-ii
-public class Code07_BinaryTreeLevelOrderTraversalII {
+public class Code06_BinaryTreeLevelOrderTraversalII {
 
 	public static class TreeNode {
 		public int val;
diff --git a/src/class06/Code07_GetMax.java b/src/class06/Code07_GetMax.java
@@ -1,6 +1,6 @@
 package class06;
 
-public class Code09_GetMax {
+public class Code07_GetMax {
 
 	public static int flip(int n) {
 		return n ^ 1;
diff --git a/src/class06/Code08_AverageOfLevelsInBinaryTree.java b/src/class06/Code08_AverageOfLevelsInBinaryTree.java
diff --git a/src/class06/ShowComparator.java b/src/class06/ShowComparator.java
@@ -5,7 +5,7 @@
 import java.util.Comparator;
 import java.util.TreeMap;
 
-public class Code01_Comparator {
+public class ShowComparator {
 
 	public static class Student {
 		public String name;
diff --git a/src/class06/TraversalBinaryTree.java b/src/class06/TraversalBinaryTree.java
@@ -1,6 +1,6 @@
 package class06;
 
-public class TraversalBT {
+public class TraversalBinaryTree {
 
 	public static class Node {
 		public int value;
