Updated tags

Author: javadev

src/main/kotlin/g0501_0600/s0530_minimum_absolute_difference_in_bst/Solution.kt

@@ -1,10 +1,10 @@
 package g0501_0600.s0530_minimum_absolute_difference_in_bst
 
-import com_github_leetcode.TreeNode
-
 // #Easy #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Binary_Search_Tree
 // #2023_01_15_Time_209_ms_(86.96%)_Space_38.5_MB_(69.57%)
 
+import com_github_leetcode.TreeNode
+
 /*
  * Example:
  * var ti = TreeNode(5)

src/main/kotlin/g0501_0600/s0572_subtree_of_another_tree/Solution.kt

@@ -1,11 +1,11 @@
 package g0501_0600.s0572_subtree_of_another_tree
 
-import com_github_leetcode.TreeNode
-
 // #Easy #Depth_First_Search #Tree #Binary_Tree #Hash_Function #String_Matching
 // #Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search
 // #2023_01_23_Time_214_ms_(92.39%)_Space_38.4_MB_(45.65%)
 
+import com_github_leetcode.TreeNode
+
 /*
  * Example:
  * var ti = TreeNode(5)

src/main/kotlin/g0501_0600/s0587_erect_the_fence/Solution.kt

@@ -1,12 +1,12 @@
 package g0501_0600.s0587_erect_the_fence
 
+// #Hard #Array #Math #Geometry #2023_01_30_Time_470_ms_(100.00%)_Space_54.7_MB_(100.00%)
+
 import kotlin.math.abs
 import kotlin.math.atan2
 import kotlin.math.pow
 import kotlin.math.sqrt
 
-// #Hard #Array #Math #Geometry #2023_01_30_Time_470_ms_(100.00%)_Space_54.7_MB_(100.00%)
-
 class Solution {
     private fun dist(p1: Pair<Int, Int>, p2: Pair<Int, Int>): Double {
         return sqrt((p2.second - p1.second).toDouble().pow(2.0) + Math.pow((p2.first - p1.first).toDouble(), 2.0))