Update Solution.java

Author: javadev

src/main/java/g3401_3500/s3420_count_non_decreasing_subarrays_after_k_operations/Solution.java

@@ -17,7 +17,8 @@ public long countNonDecreasingSubarrays(int[] nums, long k) {
 
         long res = 0;
         Deque<Integer> q = new ArrayDeque<>();
-        for (int j = 0, i = 0; j < nums.length; ++j) {
+        int i = 0;
+        for (int j = 0; j < nums.length; ++j) {
             while (!q.isEmpty() && nums[q.peekLast()] < nums[j]) {
                 int r = q.pollLast();
                 int l = q.isEmpty() ? i - 1 : q.peekLast();