g1001_1100.s1044_longest_duplicate_substring.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

The newest version!

package g1001_1100.s1044_longest_duplicate_substring;

// #Hard #String #Binary_Search #Sliding_Window #Hash_Function #Rolling_Hash #Suffix_Array
// #2022_02_27_Time_447_ms_(62.53%)_Space_118.6_MB_(57.97%)

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

@SuppressWarnings("unchecked")
public class Solution {
    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();
        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;
            cnt[s.charAt(j - 1) - 'a'].add(j - 1);
        }
        String ans = "";
        for (int i = 0; i < 26; i++) {
            if (cnt[i].isEmpty()) {
                continue;
            }
            List idx = cnt[i];
            Set set;
            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) {
                        long substrHash = getSubstrHash(nxt, nxt + len);
                        if (set.contains(substrHash)) {
                            found = true;
                            if (len + 1 > ans.length()) {
                                ans = s.substring(nxt, nxt + len);
                            }
                            break;
                        }
                        set.add(substrHash);
                    }
                }
                if (found) {
                    lo = 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;
    }
}