Update Solution.java

javadev · web-flow · commit 04b75da37bbe · 2022-12-17T03:36:57.000+02:00
diff --git a/src/main/java/g2401_2500/s2444_count_subarrays_with_fixed_bounds/Solution.java b/src/main/java/g2401_2500/s2444_count_subarrays_with_fixed_bounds/Solution.java
@@ -25,11 +25,9 @@ public long countSubarrays(int[] nums, int minK, int maxK) {
                             maxi++;
                         }
                     }
-
                     if (mini == 0 || maxi == 0) {
                         break;
                     }
-
                     for (; mini != 0 && maxi != 0; ans += 1 + (i - b), a++) {
                         if (nums[a] == minK) {
                             mini--;
@@ -42,7 +40,6 @@ public long countSubarrays(int[] nums, int minK, int maxK) {
             }
             i++;
         }
-
         return ans;
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -25,11 +25,9 @@ public long countSubarrays(int[] nums, int minK, int maxK) {`
`25`	`25`	`maxi++;`
`26`	`26`	`}`
`27`	`27`	`}`
`28`		`-`
`29`	`28`	`if (mini == 0 \|\| maxi == 0) {`
`30`	`29`	`break;`
`31`	`30`	`}`
`32`		`-`
`33`	`31`	`for (; mini != 0 && maxi != 0; ans += 1 + (i - b), a++) {`
`34`	`32`	`if (nums[a] == minK) {`
`35`	`33`	`mini--;`
`@@ -42,7 +40,6 @@ public long countSubarrays(int[] nums, int minK, int maxK) {`
`42`	`40`	`}`
`43`	`41`	`i++;`
`44`	`42`	`}`
`45`		`-`
`46`	`43`	`return ans;`
`47`	`44`	`}`
`48`	`45`	`}`