Improved 3161

javadev · javadev · commit 5a97bacad78b · 2025-03-16T03:00:21.000+02:00
diff --git a/src/main/java/g3101_3200/s3161_block_placement_queries/Solution.java b/src/main/java/g3101_3200/s3161_block_placement_queries/Solution.java
@@ -37,6 +37,11 @@ public List<Boolean> getResults(int[][] queries) {
             left.parent[j] = pos[size - 1];
             right.parent[j] = max;
         }
+        return List.of(getBooleans(queries, m, size, left, right, bit));
+    }
+
+    private Boolean[] getBooleans(
+            int[][] queries, int m, int size, UnionFind left, UnionFind right, BIT bit) {
         Boolean[] ans = new Boolean[m - size + 1];
         int index = ans.length - 1;
         for (int i = m - 1; i >= 0; i--) {
@@ -53,7 +58,7 @@ public List<Boolean> getResults(int[][] queries) {
                 ans[index--] = maxGap >= q[2];
             }
         }
-        return List.of(ans);
+        return ans;
     }
 
     private static final class BIT {

Original file line number	Diff line number	Diff line change
`@@ -37,6 +37,11 @@ public List<Boolean> getResults(int[][] queries) {`
`37`	`37`	`left.parent[j] = pos[size - 1];`
`38`	`38`	`right.parent[j] = max;`
`39`	`39`	`}`
	`40`	`+ return List.of(getBooleans(queries, m, size, left, right, bit));`
	`41`	`+ }`
	`42`	`+`
	`43`	`+ private Boolean[] getBooleans(`
	`44`	`+ int[][] queries, int m, int size, UnionFind left, UnionFind right, BIT bit) {`
`40`	`45`	`Boolean[] ans = new Boolean[m - size + 1];`
`41`	`46`	`int index = ans.length - 1;`
`42`	`47`	`for (int i = m - 1; i >= 0; i--) {`
`@@ -53,7 +58,7 @@ public List<Boolean> getResults(int[][] queries) {`
`53`	`58`	`ans[index--] = maxGap >= q[2];`
`54`	`59`	`}`
`55`	`60`	`}`
`56`		`- return List.of(ans);`
	`61`	`+ return ans;`
`57`	`62`	`}`
`58`	`63`
`59`	`64`	`private static final class BIT {`