Improved task 2106.

javadev · web-flow · commit 96e859188923 · 2022-05-31T15:04:21.000+03:00
diff --git a/src/main/java/g2101_2200/s2106_maximum_fruits_harvested_after_at_most_k_steps/Solution.java b/src/main/java/g2101_2200/s2106_maximum_fruits_harvested_after_at_most_k_steps/Solution.java
@@ -7,7 +7,8 @@ public class Solution {
     public int maxTotalFruits(int[][] fruits, int startPos, int k) {
         int res = 0;
         int sum = 0;
-        for (int left = 0, right = 0; right < fruits.length; right++) {
+        int left = 0;
+        for (int right = 0; right < fruits.length; right++) {
             sum += fruits[right][1];
             while (left <= right && !isValidRange(fruits[left][0], fruits[right][0], startPos, k)) {
                 sum -= fruits[left++][1];
