Fixed style

Author: javadev

src/main/kotlin/g3501_3600/s3585_find_weighted_median_node_in_tree/Solution.kt

@@ -131,7 +131,9 @@ class Solution {
             var curr = v
             for (p in longMax - 1 downTo 0) {
                 val nextNode = parent[p][curr]
-                if (nextNode != -1 && depth[nextNode] >= depth[lca] && (dist[nextNode] - dist[lca]) >= remainingWeightFromLCA) {
+                if (nextNode != -1 && depth[nextNode] >= depth[lca] &&
+                    (dist[nextNode] - dist[lca]) >= remainingWeightFromLCA
+                ) {
                     curr = nextNode
                 }
             }