Fixed sonar

Author: javadev

src/main/java/g3101_3200/s3180_maximum_total_reward_using_operations_i/Solution.java

@@ -2,6 +2,7 @@
 
 // #Medium #Array #Dynamic_Programming #2024_06_14_Time_1_ms_(100.00%)_Space_43.3_MB_(97.85%)
 
+@SuppressWarnings("java:S135")
 public class Solution {
     private int[] sortedSet(int[] values) {
         int max = 0;
@@ -34,7 +35,8 @@ public int maxTotalReward(int[] rewardValues) {
         boolean[] isSumPossible = new boolean[max];
         isSumPossible[0] = true;
         int maxSum = 0;
-        for (int sum = rewardValues[0], last = 1; sum < max; sum++) {
+        int last = 1;
+        for (int sum = rewardValues[0]; sum < max; sum++) {
             while (last < n && rewardValues[last] <= sum) {
                 last++;
             }
@@ -50,6 +52,7 @@ public int maxTotalReward(int[] rewardValues) {
                     break;
                 }
             }
+            last++;
         }
         return maxSum + max;
     }