Skip to content

Commit 4c189a4

Browse files
committed
Fixed sonar
1 parent 674ca39 commit 4c189a4

File tree

2 files changed

+13
-12
lines changed
  • src/main/java/g3401_3500

2 files changed

+13
-12
lines changed

src/main/java/g3401_3500/s3413_maximum_coins_from_k_consecutive_bags/Solution.java

Lines changed: 10 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -11,25 +11,27 @@ public long maximumCoins(int[][] coins, int k) {
1111
int n = coins.length;
1212
long res = 0;
1313
long cur = 0;
14-
for (int i = 0, j = 0; i < n; ++i) {
15-
while (j < n && coins[j][1] <= coins[i][0] + k - 1) {
14+
int j = 0;
15+
for (int[] ints : coins) {
16+
while (j < n && coins[j][1] <= ints[0] + k - 1) {
1617
cur += (long) (coins[j][1] - coins[j][0] + 1) * coins[j][2];
1718
j++;
1819
}
1920
if (j < n) {
20-
long part = (long) Math.max(0, coins[i][0] + k - 1 - coins[j][0] + 1) * coins[j][2];
21+
long part = (long) Math.max(0, ints[0] + k - 1 - coins[j][0] + 1) * coins[j][2];
2122
res = Math.max(res, cur + part);
2223
}
23-
cur -= (long) (coins[i][1] - coins[i][0] + 1) * coins[i][2];
24+
cur -= (long) (ints[1] - ints[0] + 1) * ints[2];
2425
}
2526
cur = 0;
26-
for (int i = 0, j = 0; i < n; ++i) {
27-
cur += (long) (coins[i][1] - coins[i][0] + 1) * coins[i][2];
28-
while (coins[j][1] < coins[i][1] - k + 1) {
27+
j = 0;
28+
for (int[] coin : coins) {
29+
cur += (long) (coin[1] - coin[0] + 1) * coin[2];
30+
while (coins[j][1] < coin[1] - k + 1) {
2931
cur -= (long) (coins[j][1] - coins[j][0] + 1) * coins[j][2];
3032
j++;
3133
}
32-
long part = (long) Math.max(0, coins[i][1] - k - coins[j][0] + 1) * coins[j][2];
34+
long part = (long) Math.max(0, coin[1] - k - coins[j][0] + 1) * coins[j][2];
3335
res = Math.max(res, cur - part);
3436
}
3537
return res;

src/main/java/g3401_3500/s3414_maximum_score_of_non_overlapping_intervals/Solution.java

Lines changed: 3 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -7,6 +7,7 @@
77
import java.util.Comparator;
88
import java.util.List;
99

10+
@SuppressWarnings("java:S6541")
1011
public class Solution {
1112
public int[] maximumWeight(List<List<Integer>> intervals) {
1213
int n = intervals.size();
@@ -57,7 +58,6 @@ class S {
5758
}
5859
return Integer.compare(a.x.length, b.x.length);
5960
};
60-
6161
for (int i = 0; i < n; i++) {
6262
dp[i][0] = base;
6363
for (int k = 1; k <= 4; k++) {
@@ -76,9 +76,8 @@ class S {
7676
S ans = base;
7777
for (int k = 1; k <= 4; k++) {
7878
S candidate = dp[n - 1][k];
79-
if (ans.sum < candidate.sum) {
80-
ans = candidate;
81-
} else if (ans.sum == candidate.sum && cmp.compare(ans, candidate) > 0) {
79+
if (ans.sum < candidate.sum
80+
|| ans.sum == candidate.sum && cmp.compare(ans, candidate) > 0) {
8281
ans = candidate;
8382
}
8483
}

0 commit comments

Comments
 (0)