fix styles

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_1844.java

@@ -14,9 +14,10 @@ public String replaceDigits(String s) {
             return sb.toString();
         }
     }
+
     public static class Solution2 {
         public String replaceDigits(String s) {
-            char inpArr[] = s.toCharArray();
+            char[] inpArr = s.toCharArray();
             for (int i = 1; i < inpArr.length; i += 2) {
                 inpArr[i] = (char) (inpArr[i - 1] + inpArr[i] - '0');
             }

src/main/java/com/fishercoder/solutions/_1891.java

@@ -8,7 +8,7 @@ public static class Solution1 {
          * My completely original solution on 1/27/2022.
          */
         public int maxLength(int[] ribbons, int k) {
-            long sum = 0l;
+            long sum = 0L;
             int max = ribbons[0];
             for (int num : ribbons) {
                 sum += num;

src/main/java/com/fishercoder/solutions/_2325.java

@@ -39,7 +39,7 @@ public String decodeMessage(String key, String message) {
 
             Map<Character, Character> bucket = new HashMap<>();
             char ch = 'a';
-            char keyArr[] = key.toCharArray();
+            char[] keyArr = key.toCharArray();
             StringBuilder result = new StringBuilder();
 
             for (int i = 0; i < keyArr.length; i++) {
@@ -49,7 +49,7 @@ public String decodeMessage(String key, String message) {
             }
 
             // decode the message using the bucket
-            char msgArr[] = message.toCharArray();
+            char[] msgArr = message.toCharArray();
             for (int i = 0; i < msgArr.length; i++) {
                 if (msgArr[i] == ' ') {
                     result.append(" ");

src/main/java/com/fishercoder/solutions/_2455.java

@@ -3,7 +3,7 @@
 public class _2455 {
     public static class Solution1 {
         public int averageValue(int[] nums) {
-            Long sum = 0l;
+            Long sum = 0L;
             int count = 0;
             for (int num : nums) {
                 if (num % 3 == 0 && num % 2 == 0) {

src/main/java/com/fishercoder/solutions/_2525.java

@@ -3,11 +3,11 @@
 public class _2525 {
     public static class Solution1 {
         public String categorizeBox(int length, int width, int height, int mass) {
-            int DIMENSION_LIMIT = 10000;
-            int VOLUME_LIMIT = 1000000000;
+            int dimensionLimit = 10000;
+            int volumeLimit = 1000000000;
             boolean isBulky = false;
             long volume = (long) length * width * height;
-            if (length >= DIMENSION_LIMIT || width >= DIMENSION_LIMIT || height >= DIMENSION_LIMIT || volume >= VOLUME_LIMIT) {
+            if (length >= dimensionLimit || width >= dimensionLimit || height >= dimensionLimit || volume >= volumeLimit) {
                 isBulky = true;
             }
             boolean isHeavy = mass >= 100;

src/main/java/com/fishercoder/solutions/_2535.java

@@ -3,8 +3,8 @@
 public class _2535 {
     public static class Solution1 {
         public int differenceOfSum(int[] nums) {
-            long elementSum = 0l;
-            long digitSum = 0l;
+            long elementSum = 0L;
+            long digitSum = 0L;
             for (int num : nums) {
                 elementSum += num;
                 while (num != 0) {

src/main/java/com/fishercoder/solutions/_2558.java

@@ -13,7 +13,7 @@ public long pickGifts(int[] gifts, int k) {
                 int max = maxHeap.poll();
                 maxHeap.offer((int) Math.sqrt(max));
             }
-            long res = 0l;
+            long res = 0L;
             while (!maxHeap.isEmpty()) {
                 res += maxHeap.poll();
             }

src/main/java/com/fishercoder/solutions/_2583.java

@@ -12,7 +12,7 @@ public long kthLargestLevelSum(TreeNode root, int k) {
             queue.offer(root);
             while (!queue.isEmpty()) {
                 int size = queue.size();
-                long thisSum = 0l;
+                long thisSum = 0L;
                 for (int i = 0; i < size; i++) {
                     TreeNode curr = queue.poll();
                     thisSum += curr.val;

src/main/java/com/fishercoder/solutions/_528.java

@@ -18,16 +18,18 @@ public Solution1(int[] w) {
         public int pickIndex() {
             int len = preSums.length;
             int idx = random.nextInt(preSums[len - 1]) + 1;
-            int left = 0, right = len - 1;
+            int left = 0;
+            int right = len - 1;
             // search position
             while (left < right) {
                 int mid = left + (right - left) / 2;
-                if (preSums[mid] == idx)
+                if (preSums[mid] == idx) {
                     return mid;
-                else if (preSums[mid] < idx)
+                } else if (preSums[mid] < idx) {
                     left = mid + 1;
-                else
+                } else {
                     right = mid;
+                }
             }
             return left;
         }

src/main/java/com/fishercoder/solutions/_54.java

@@ -59,14 +59,14 @@ public List<Integer> spiralOrder(int[][] matrix) {
             while (ans.size() < total) {
                 for (; i < m && i >= lowerRow && j < n && j >= lowerCol; ) {
                     ans.add(matrix[i][j]);
-                    if (direction == 0) {//east
+                    if (direction == 0) { //east
                         j++;
-                    } else if (direction == 1) {//south
+                    } else if (direction == 1) { //south
                         i++;
-                    } else if (direction == 2) {//west
+                    } else if (direction == 2) { //west
                         j--;
                     } else {
-                        i--;//north
+                        i--; //north
                     }
                 }
                 if (direction == 0) {