Fixed sonar

Author: javadev

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

@@ -20,7 +20,7 @@ private long sumE(long k) {
         long n = 0;
         long cnt1 = 0;
         long sumI = 0;
-        for (long i = 63 - Long.numberOfLeadingZeros(k + 1); i > 0; i--) {
+        for (long i = 63L - Long.numberOfLeadingZeros(k + 1); i > 0; i--) {
             long c = (cnt1 << i) + (i << (i - 1));
             if (c <= k) {
                 k -= c;

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

@@ -5,7 +5,7 @@
 import java.util.List;
 
 public class Solution {
-    public static int maxScore(List<List<Integer>> grid) {
+    public int maxScore(List<List<Integer>> grid) {
         int m = grid.size() - 1;
         List<Integer> row = grid.get(m);
         int n = row.size();

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

@@ -9,7 +9,8 @@ public class Solution {
     private int findMinScore(int mask, int prevNum, int[] nums, int[][] dp) {
         int n = nums.length;
         if (Integer.bitCount(mask) == n) {
-            return dp[mask][prevNum] = Math.abs(prevNum - nums[0]);
+            dp[mask][prevNum] = Math.abs(prevNum - nums[0]);
+            return dp[mask][prevNum];
         }
         if (dp[mask][prevNum] != -1) {
             return dp[mask][prevNum];
@@ -30,7 +31,8 @@ private int[] constructMinScorePermutation(int n, int[] nums, int[][] dp) {
         int[] permutation = new int[n];
         int i = 0;
         permutation[i++] = 0;
-        for (int mask = 1, prevNum = 0; i < n; mask |= 1 << prevNum) {
+        int prevNum = 0;
+        for (int mask = 1; i < n; mask |= 1 << prevNum) {
             for (int currNum = 0; currNum < n; currNum++) {
                 if ((mask >> currNum & 1 ^ 1) == 1) {
                     int currScore =