Fixed style

Author: javadev

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

@@ -16,7 +16,10 @@ public int[] findProductsOfElements(long[][] queries) {
     }
 
     private long sumE(long k) {
-        long res = 0, n = 0, cnt1 = 0, sumI = 0;
+        long res = 0;
+        long n = 0;
+        long cnt1 = 0;
+        long sumI = 0;
         for (long i = 63 - Long.numberOfLeadingZeros(k + 1); i > 0; i--) {
             long c = (cnt1 << i) + (i << (i - 1));
             if (c <= k) {

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

@@ -7,15 +7,15 @@
 
 public class Solution {
     private int findMinScore(int mask, int prevNum, int[] nums, int[][] dp) {
-        int N = nums.length;
-        if (Integer.bitCount(mask) == N) {
+        int n = nums.length;
+        if (Integer.bitCount(mask) == n) {
             return dp[mask][prevNum] = Math.abs(prevNum - nums[0]);
         }
         if (dp[mask][prevNum] != -1) {
             return dp[mask][prevNum];
         }
         int minScore = Integer.MAX_VALUE;
-        for (int currNum = 0; currNum < N; currNum++) {
+        for (int currNum = 0; currNum < n; currNum++) {
             if ((mask >> currNum & 1 ^ 1) == 1) {
                 int currScore =
                         Math.abs(prevNum - nums[currNum])
@@ -26,12 +26,12 @@ private int findMinScore(int mask, int prevNum, int[] nums, int[][] dp) {
         return dp[mask][prevNum] = minScore;
     }
 
-    private int[] constructMinScorePermutation(int N, int[] nums, int[][] dp) {
-        int[] permutation = new int[N];
+    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) {
-            for (int currNum = 0; currNum < N; currNum++) {
+        for (int mask = 1, prevNum = 0; i < n; mask |= 1 << prevNum) {
+            for (int currNum = 0; currNum < n; currNum++) {
                 if ((mask >> currNum & 1 ^ 1) == 1) {
                     int currScore =
                             Math.abs(prevNum - nums[currNum]) + dp[mask | 1 << currNum][currNum];