Skip to content

Commit 33fcb2e

Browse files
committed
Fixed sonar
1 parent a268825 commit 33fcb2e

File tree

3 files changed

+6
-4
lines changed

3 files changed

+6
-4
lines changed

src/main/java/g3101_3200/s3145_find_products_of_elements_of_big_array/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@ private long sumE(long k) {
2020
long n = 0;
2121
long cnt1 = 0;
2222
long sumI = 0;
23-
for (long i = 63 - Long.numberOfLeadingZeros(k + 1); i > 0; i--) {
23+
for (long i = 63L - Long.numberOfLeadingZeros(k + 1); i > 0; i--) {
2424
long c = (cnt1 << i) + (i << (i - 1));
2525
if (c <= k) {
2626
k -= c;

src/main/java/g3101_3200/s3148_maximum_difference_score_in_a_grid/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
import java.util.List;
66

77
public class Solution {
8-
public static int maxScore(List<List<Integer>> grid) {
8+
public int maxScore(List<List<Integer>> grid) {
99
int m = grid.size() - 1;
1010
List<Integer> row = grid.get(m);
1111
int n = row.size();

src/main/java/g3101_3200/s3149_find_the_minimum_cost_array_permutation/Solution.java

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,8 @@ public class Solution {
99
private int findMinScore(int mask, int prevNum, int[] nums, int[][] dp) {
1010
int n = nums.length;
1111
if (Integer.bitCount(mask) == n) {
12-
return dp[mask][prevNum] = Math.abs(prevNum - nums[0]);
12+
dp[mask][prevNum] = Math.abs(prevNum - nums[0]);
13+
return dp[mask][prevNum];
1314
}
1415
if (dp[mask][prevNum] != -1) {
1516
return dp[mask][prevNum];
@@ -30,7 +31,8 @@ private int[] constructMinScorePermutation(int n, int[] nums, int[][] dp) {
3031
int[] permutation = new int[n];
3132
int i = 0;
3233
permutation[i++] = 0;
33-
for (int mask = 1, prevNum = 0; i < n; mask |= 1 << prevNum) {
34+
int prevNum = 0;
35+
for (int mask = 1; i < n; mask |= 1 << prevNum) {
3436
for (int currNum = 0; currNum < n; currNum++) {
3537
if ((mask >> currNum & 1 ^ 1) == 1) {
3638
int currScore =

0 commit comments

Comments
 (0)