Commit6d6af5c

authored

Improved task 3464

1 parentbeebc13 commit6d6af5cCopy full SHA for 6d6af5c

File tree

-6

lines changed

src/main/java/g3401_3500
- s3464_maximize_the_distance_between_points_on_a_square
  - Solution.java
- s3465_find_products_with_valid_serial_numbers
  - script.sql

-6

lines changed

Lines changed: 5 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,16 +1,16 @@`
`1`	`1`	`packageg3401_3500.s3464_maximize_the_distance_between_points_on_a_square;`
`2`	`2`
`3`		`-// #Hard #Array #Greedy #Binary_Search #2025_02_25_Time_18_ms_(98.51%)_Space_49.78_MB_(46.27%)`
	`3`	`+// #Hard #Array #Greedy #Binary_Search #2025_02_27_Time_17_ms_(98.18%)_Space_50.10_MB_(41.82%)`
`4`	`4`
`5`	`5`	`importjava.util.Arrays;`
`6`	`6`
`7`	`7`	`publicclassSolution {`
`8`		`-publicintmaxDistance(intside,int[][]pts,intk) {`
`9`		`-intn =pts.length;`
	`8`	`+publicintmaxDistance(intside,int[][]points,intk) {`
	`9`	`+intn =points.length;`
`10`	`10`	`long[]p =newlong[n];`
`11`	`11`	`for (inti =0;i <n;i++) {`
`12`		`-intx =pts[i][0];`
`13`		`-inty =pts[i][1];`
	`12`	`+intx =points[i][0];`
	`13`	`+inty =points[i][1];`
`14`	`14`	`longc;`
`15`	`15`	`if (y ==0) {`
`16`	`16`	`c =x;`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`	`1`	`# Write your MySQL query statement below`
`2`		`-# #Easy #Database #2025_02_25_Time_716_ms_(100.00%)_Space_0.0_MB_(100.00%)`
	`2`	`+# #Easy #Database #2025_02_26_Time_292_ms_(90.91%)_Space_0.0_MB_(100.00%)`
`3`	`3`	`SELECT*FROM productsWHERE description REGEXP'SN[0-9]{4}-[0-9]{4}$'`
`4`	`4`	`OR description REGEXP'SN[0-9]{4}-[0-9]{4}[^0-9]+'ORDER BY product_id`

Comments

(0)