Fixed sonar

Author: javadev

src/main/java/g3401_3500/s3489_zero_array_transformation_iv/Solution.java

@@ -23,7 +23,8 @@ private int solve(int[][] q, int i, int target, int k, int[][] dp) {
         if (q[k][0] <= i && i <= q[k][1]) {
             res = Math.min(res, solve(q, i, target - q[k][2], k + 1, dp));
         }
-        return dp[target][k] = res;
+        dp[target][k] = res;
+        return res;
     }
 
     public int minZeroArray(int[] nums, int[][] queries) {

src/main/java/g3401_3500/s3490_count_beautiful_numbers/Solution.java

@@ -10,9 +10,6 @@ public int beautifulNumbers(int l, int r) {
     }
 
     private int countBeautiful(int x) {
-        if (x < 0) {
-            return 0;
-        }
         char[] digits = getCharArray(x);
         HashMap<String, Integer> dp = new HashMap<>();
         return solve(0, 1, 0, 1, digits, dp);

src/test/java/g3401_3500/s3487_maximum_unique_subarray_sum_after_deletion/SolutionTest.java

@@ -20,4 +20,9 @@ void maxSum2() {
     void maxSum3() {
         assertThat(new Solution().maxSum(new int[] {1, 2, -1, -2, 1, 0, -1}), equalTo(3));
     }
+
+    @Test
+    void maxSum4() {
+        assertThat(new Solution().maxSum(new int[] {-100}), equalTo(-100));
+    }
 }

src/test/java/g3401_3500/s3490_count_beautiful_numbers/SolutionTest.java

@@ -15,4 +15,9 @@ void beautifulNumbers() {
     void beautifulNumbers2() {
         assertThat(new Solution().beautifulNumbers(1, 15), equalTo(10));
     }
+
+    @Test
+    void beautifulNumbers3() {
+        assertThat(new Solution().beautifulNumbers(6725, 270910825), equalTo(178996547));
+    }
 }