Fixed sonar

Author: javadev

src/main/java/g3301_3400/s3332_maximum_points_tourist_can_earn/Solution.java

@@ -24,7 +24,8 @@ private int f(int day, int city, int[][] stayScore, int[][] travelScore) {
             }
             maxScore = Math.max(maxScore, score + f(day + 1, desCity, stayScore, travelScore));
         }
-        return dp[day][city] = maxScore;
+        dp[day][city] = maxScore;
+        return dp[day][city];
     }
 
     public int maxScore(int n, int k, int[][] stayScore, int[][] travelScore) {

src/main/java/g3301_3400/s3333_find_the_original_typed_string_ii/Solution.java

@@ -32,7 +32,7 @@ public int possibleStringCount(String word, int k) {
         long[][] dp = new long[m][k - m + 1];
         for (i = 0; i < k - m + 1; i++) {
             if (list.get(m - 1) + i + m > k) {
-                dp[m - 1][i] = list.get(m - 1) - (k - m - i);
+                dp[m - 1][i] = list.get(m - 1) - (long) (k - m - i);
             }
         }
         for (i = m - 2; i >= 0; i--) {

src/main/java/g3301_3400/s3334_find_the_maximum_factor_score_of_array/Solution.java

@@ -24,23 +24,20 @@ public long maxScore(int[] nums) {
         }
         long max = 0;
         for (int i = 0; i < n; i++) {
-            long gcd =
-                    i == 0
-                            ? rToL[i + 1][0]
-                            : (i == n - 1 ? lToR[i - 1][0] : gcd(rToL[i + 1][0], lToR[i - 1][0]));
-            max =
-                    Math.max(
-                            max,
-                            gcd
-                                    * (i == 0
-                                            ? rToL[i + 1][1]
-                                            : i == n - 1
-                                                    ? lToR[i - 1][1]
-                                                    : lcm(rToL[i + 1][1], lToR[i - 1][1])));
+            long gcd = i == 0 ? rToL[i + 1][0] : getLong(i, n, lToR, rToL);
+            max = Math.max(max, gcd * (i == 0 ? rToL[i + 1][1] : getaLong(i, n, lToR, rToL)));
         }
         return Math.max(max, rToL[0][0] * rToL[0][1]);
     }
 
+    private long getaLong(int i, int n, long[][] lToR, long[][] rToL) {
+        return i == n - 1 ? lToR[i - 1][1] : lcm(rToL[i + 1][1], lToR[i - 1][1]);
+    }
+
+    private long getLong(int i, int n, long[][] lToR, long[][] rToL) {
+        return i == n - 1 ? lToR[i - 1][0] : gcd(rToL[i + 1][0], lToR[i - 1][0]);
+    }
+
     private long gcd(long a, long b) {
         if (b == 0) {
             return a;
@@ -49,6 +46,6 @@ private long gcd(long a, long b) {
     }
 
     private long lcm(long a, long b) {
-        return (a * b) / gcd(a, b);
+        return a * b / gcd(a, b);
     }
 }