update

Author: ThanhNIT

src/main/java/g3001_3100/s3070_count_submatrices_with_top_left_element_and_sum_less_than_k/Solution.java

@@ -11,8 +11,11 @@ public int countSubmatrices(int[][] grid, int k) {
             for (int col = 0, sum = 0; col < n; col++) {
                 sum += ints[col];
                 sums[col] += sum;
-                if (sums[col] <= k) ans++;
-                else break;
+                if (sums[col] <= k) {
+                    ans++;
+                } else {
+                    break;
+                }
             }
         }
         return ans;

src/main/java/g3001_3100/s3074_apple_redistribution_into_boxes/Solution.java

@@ -9,7 +9,7 @@ public int minimumBoxes(int[] apple, int[] capacity) {
         for (int j : apple) {
             appleSum += j;
         }
-        int req_capacity = 0;
+        int reqCapacity = 0;
         int max = 0;
         for (int j : capacity) {
             count[j]++;
@@ -19,14 +19,14 @@ public int minimumBoxes(int[] apple, int[] capacity) {
             if (count[i] >= 1) {
                 while (count[i] != 0) {
                     appleSum -= i;
-                    req_capacity++;
+                    reqCapacity++;
                     if (appleSum <= 0) {
-                        return req_capacity;
+                        return reqCapacity;
                     }
                     count[i]--;
                 }
             }
         }
-        return req_capacity;
+        return reqCapacity;
     }
 }