Fixed checks.

Author: javadev

src/main/java/g1001_1100/s1042_flower_planting_with_no_adjacent/Solution.java

@@ -6,9 +6,9 @@
 import java.util.ArrayList;
 import java.util.List;
 
+@SuppressWarnings("unchecked")
 public class Solution {
     private List<Integer>[] graph;
-    private int n;
     private int[] color;
     private boolean[] visited;
 

src/main/java/g1001_1100/s1044_longest_duplicate_substring/Solution.java

@@ -8,58 +8,64 @@
 import java.util.List;
 import java.util.Set;
 
+@SuppressWarnings("unchecked")
 public class Solution {
-    private final int mod = (int) 1e9 + 7;
+    private static final int MOD = (int) 1e9 + 7;
     private long[] hsh;
     private long[] pw;
     private final List[] cnt = new List[26];
 
     public String longestDupSubstring(String s) {
-        int n = s.length(), base = 131;
-        for (int i = 0; i < 26; i++) cnt[i] = new ArrayList<>();
+        int n = s.length();
+        int base = 131;
+        for (int i = 0; i < 26; i++) {
+            cnt[i] = new ArrayList<>();
+        }
         hsh = new long[n + 1];
         pw = new long[n + 1];
         pw[0] = 1;
         for (int j = 1; j <= n; j++) {
-            hsh[j] = (hsh[j - 1] * base + s.charAt(j - 1)) % mod;
-            pw[j] = pw[j - 1] * base % mod;
+            hsh[j] = (hsh[j - 1] * base + s.charAt(j - 1)) % MOD;
+            pw[j] = pw[j - 1] * base % MOD;
             cnt[s.charAt(j - 1) - 'a'].add(j - 1);
         }
         String ans = "";
         for (int i = 0; i < 26; i++) {
-            if (cnt[i].size() == 0) {
+            if (cnt[i].isEmpty()) {
                 continue;
             }
             List<Integer> idx = cnt[i];
             Set<Long> set;
-            int lo = 1, hi = n - idx.get(0);
+            int lo = 1;
+            int hi = n - idx.get(0);
             while (lo <= hi) {
                 int len = (lo + hi) / 2;
                 set = new HashSet<>();
                 boolean found = false;
                 for (int nxt : idx) {
-                    if (nxt + len > n) {
-                        break;
-                    }
-                    long substrHash = getSubstrHash(nxt, nxt + len);
-                    if (set.contains(substrHash)) {
-                        found = true;
-                        if (len + 1 > ans.length()) {
-                            ans = s.substring(nxt, nxt + len);
+                    if (nxt + len <= n) {
+                        long substrHash = getSubstrHash(nxt, nxt + len);
+                        if (set.contains(substrHash)) {
+                            found = true;
+                            if (len + 1 > ans.length()) {
+                                ans = s.substring(nxt, nxt + len);
+                            }
+                            break;
                         }
-                        break;
+                        set.add(substrHash);
                     }
-                    set.add(substrHash);
                 }
                 if (found) {
                     lo = len + 1;
-                } else hi = len - 1;
+                } else {
+                    hi = len - 1;
+                }
             }
         }
         return ans;
     }
 
     private long getSubstrHash(int l, int r) {
-        return (hsh[r] - hsh[l] * pw[r - l] % mod + mod) % mod;
+        return (hsh[r] - hsh[l] * pw[r - l] % MOD + MOD) % MOD;
     }
 }