Improved tasks 2597, 2600, 2601

Author: javadev

gradle.properties

@@ -1,2 +1,2 @@
 sonar.coverage.jacoco.xmlReportPaths=build/jacoco/test/jacocoTestReport.xml
-org.gradle.jvmargs=-Xms256m -Xmx1024m
+org.gradle.jvmargs=-Xms512m -Xmx2048m

src/main/java/g2501_2600/s2597_the_number_of_beautiful_subsets/Solution.java

@@ -15,18 +15,18 @@ public int beautifulSubsets(int[] nums, int k) {
             map.put(n, map.getOrDefault(n, 0) + 1);
         }
         int res = 1;
-        for (int key : map.keySet()) {
-            if (!map.containsKey(key - k)) {
-                if (!map.containsKey(key + k)) {
-                    res *= 1 << map.get(key);
-                } else {
+        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
+            if (!map.containsKey(entry.getKey() - k)) {
+                if (map.containsKey(entry.getKey() + k)) {
                     List<Integer> freq = new ArrayList<>();
-                    int localKey = key;
+                    int localKey = entry.getKey();
                     while (map.containsKey(localKey)) {
                         freq.add(map.get(localKey));
                         localKey += k;
                     }
                     res *= helper(freq);
+                } else {
+                    res *= 1 << entry.getValue();
                 }
             }
         }

src/main/java/g2501_2600/s2600_k_items_with_the_maximum_sum/Solution.java

@@ -2,6 +2,7 @@
 
 // #Easy #Math #Greedy #2023_08_29_Time_1_ms_(100.00%)_Space_40.3_MB_(19.10%)
 
+@SuppressWarnings("java:S1172")
 public class Solution {
     public int kItemsWithMaximumSum(int numOnes, int numZeros, int numNegOnes, int k) {
         if (k <= numOnes) {

src/main/java/g2601_2700/s2601_prime_subtraction_operation/Solution.java

@@ -43,7 +43,13 @@ public boolean primeSubOperation(int[] nums) {
             if (pos == -1 && n <= prev) {
                 return false;
             }
-            prev = n - (pos == -1 ? 0 : (pos < 0 ? primes[-pos - 2] : primes[pos]));
+            final int index;
+            if (pos == -1) {
+                index = 0;
+            } else {
+                index = pos < 0 ? primes[-pos - 2] : primes[pos];
+            }
+            prev = n - index;
         }
         return true;
     }