update

Author: ThanhNIT

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

@@ -8,7 +8,8 @@ public int countSubmatrices(int[][] grid, int k) {
         int[] sums = new int[n];
         int ans = 0;
         for (int[] ints : grid) {
-            for (int col = 0, sum = 0; col < n; col++) {
+            int sum = 0;
+            for (int col = 0; col < n; col++) {
                 sum += ints[col];
                 sums[col] += sum;
                 if (sums[col] <= k) {

src/main/java/g3001_3100/s3072_distribute_elements_into_two_arrays_ii/Solution.java

@@ -51,19 +51,7 @@ public int[] resultArray(int[] source) {
         for (int i = 2; i < nums.length; i++) {
             int g1 = p1 + 1 - bit1.rsq(nums[i]);
             int g2 = p2 + 1 - bit2.rsq(nums[i]);
-            if (g1 > g2) {
-                p1++;
-                arr1[p1] = source[i];
-                bit1.update(nums[i]);
-            } else if (g1 < g2) {
-                p2++;
-                arr2[p2] = source[i];
-                bit2.update(nums[i]);
-            } else if (p1 < p2) {
-                p1++;
-                arr1[p1] = source[i];
-                bit1.update(nums[i]);
-            } else if (p1 > p2) {
+            if (g1 < g2 || p1 > p2) {
                 p2++;
                 arr2[p2] = source[i];
                 bit2.update(nums[i]);

src/test/java/g3001_3100/s3072_distribute_elements_into_two_arrays_ii/SolutionTest.java

@@ -17,7 +17,7 @@ void resultArray() {
     void resultArray2() {
         assertThat(
                 new Solution().resultArray(new int[] {5, 14, 3, 1, 2}),
-                equalTo(new int[] {5, 3, 1, 2, 14}));
+                equalTo(new int[] {5, 3, 2, 14, 1}));
     }
 
     @Test