Improved task

javadev · javadev · commit 82252dda51f7 · 2025-05-04T16:50:14.000+03:00
diff --git a/src/main/java/g3501_3600/s3538_merge_operations_for_minimum_travel_time/Solution.java b/src/main/java/g3501_3600/s3538_merge_operations_for_minimum_travel_time/Solution.java
@@ -31,7 +31,6 @@ public int minTravelTime(int l, int n, int k, int[] position, int[] time) {
                 }
             }
         }
-
         int ans = Integer.MAX_VALUE;
         for (int curr = 0; curr <= k; curr++) {
             ans = Math.min(ans, dp[n - 1][curr][k]);

Original file line number	Diff line number	Diff line change
`@@ -31,7 +31,6 @@ public int minTravelTime(int l, int n, int k, int[] position, int[] time) {`
`31`	`31`	`}`
`32`	`32`	`}`
`33`	`33`	`}`
`34`		`-`
`35`	`34`	`int ans = Integer.MAX_VALUE;`
`36`	`35`	`for (int curr = 0; curr <= k; curr++) {`
`37`	`36`	`ans = Math.min(ans, dp[n - 1][curr][k]);`