g1901_2000.s1923_longest_common_subpath.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 g1901_2000.s1923_longest_common_subpath;

// #Hard #Array #Binary_Search #Hash_Function #Rolling_Hash #Suffix_Array
// #2022_05_15_Time_517_ms_(73.88%)_Space_209.3_MB_(50.00%)

import java.util.HashSet;

@SuppressWarnings("java:S1172")
public class Solution {
    private static final long BASE = 100001;
    private static final long MOD = (long) (Math.pow(10, 11) + 7);
    private long[] pow;

    public int longestCommonSubpath(int n, int[][] paths) {
        int res = 0;
        int min = Integer.MAX_VALUE;
        for (int[] path : paths) {
            min = Math.min(min, path.length);
        }
        pow = new long[min + 1];
        pow[0]++;
        for (int i = 1; i <= min; i++) {
            pow[i] = (pow[i - 1] * BASE) % MOD;
        }
        int st = 1;
        int end = min;
        int mid = (st + end) / 2;
        while (st <= end) {
            if (commonSubstring(paths, mid)) {
                res = mid;
                st = mid + 1;
            } else {
                end = mid - 1;
            }
            mid = (st + end) / 2;
        }
        return res;
    }

    private boolean commonSubstring(int[][] paths, int l) {
        HashSet set = rollingHash(paths[0], l);
        for (int i = 1, n = paths.length; i < n; i++) {
            set.retainAll(rollingHash(paths[i], l));
            if (set.isEmpty()) {
                return false;
            }
        }
        return true;
    }

    private HashSet rollingHash(int[] a, int l) {
        HashSet set = new HashSet<>();
        long hash = 0;
        for (int i = 0; i < l; i++) {
            hash = (hash * BASE + a[i]) % MOD;
        }
        set.add(hash);
        for (int n = a.length, curr = l, prev = 0; curr < n; prev++, curr++) {
            hash = (((hash * BASE) % MOD - (a[prev] * pow[l]) % MOD + a[curr]) + MOD) % MOD;
            set.add(hash);
        }
        return set;
    }
}